On reducing broadcast expenses in ad hoc route discovery

Hao Zhang; Zhong Ping Jiang

doi:10.1109/ICDCSW.2005.103

On reducing broadcast expenses in ad hoc route discovery

Hao Zhang, Zhong Ping Jiang

Electrical and Computer Engineering

Research output: Contribution to conference › Paper › peer-review

Abstract

We propose two algorithms to reduce redundancy for route discovery in mobile ad hoc networks. The destination or any intermediate node containing the requested route marks the received packet before retransmitting it. The rules to propagate the marked packet are designed to reduce the number of nodes that have received and transmitted the packet (both marked and unmarked). Simulation results of applying the proposed methods show performance improvement compared with existing broadcasting schemes.

Original language	English (US)
DOIs	https://doi.org/10.1109/ICDCSW.2005.103
State	Published - 2005
Event	25th IEEE International Conference on Distributed Computing Systems Workshops, ICDCS 2005 - Columbus, OH, United States Duration: Jun 6 2005 → Jun 10 2005

Conference

Conference	25th IEEE International Conference on Distributed Computing Systems Workshops, ICDCS 2005
Country/Territory	United States
City	Columbus, OH
Period	6/6/05 → 6/10/05

ASJC Scopus subject areas

Software
Hardware and Architecture
Computer Networks and Communications

Access to Document

10.1109/ICDCSW.2005.103

Cite this

@conference{0b26092b31b24a27b3b2061d31f213be,

title = "On reducing broadcast expenses in ad hoc route discovery",

abstract = "We propose two algorithms to reduce redundancy for route discovery in mobile ad hoc networks. The destination or any intermediate node containing the requested route marks the received packet before retransmitting it. The rules to propagate the marked packet are designed to reduce the number of nodes that have received and transmitted the packet (both marked and unmarked). Simulation results of applying the proposed methods show performance improvement compared with existing broadcasting schemes.",

author = "Hao Zhang and Jiang, {Zhong Ping}",

note = "Publisher Copyright: {\textcopyright} 2005 IEEE; 25th IEEE International Conference on Distributed Computing Systems Workshops, ICDCS 2005 ; Conference date: 06-06-2005 Through 10-06-2005",

year = "2005",

doi = "10.1109/ICDCSW.2005.103",

language = "English (US)",

}

TY - CONF

T1 - On reducing broadcast expenses in ad hoc route discovery

AU - Zhang, Hao

AU - Jiang, Zhong Ping

PY - 2005

Y1 - 2005

N2 - We propose two algorithms to reduce redundancy for route discovery in mobile ad hoc networks. The destination or any intermediate node containing the requested route marks the received packet before retransmitting it. The rules to propagate the marked packet are designed to reduce the number of nodes that have received and transmitted the packet (both marked and unmarked). Simulation results of applying the proposed methods show performance improvement compared with existing broadcasting schemes.

AB - We propose two algorithms to reduce redundancy for route discovery in mobile ad hoc networks. The destination or any intermediate node containing the requested route marks the received packet before retransmitting it. The rules to propagate the marked packet are designed to reduce the number of nodes that have received and transmitted the packet (both marked and unmarked). Simulation results of applying the proposed methods show performance improvement compared with existing broadcasting schemes.

UR - http://www.scopus.com/inward/record.url?scp=84931445489&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84931445489&partnerID=8YFLogxK

U2 - 10.1109/ICDCSW.2005.103

DO - 10.1109/ICDCSW.2005.103

M3 - Paper

AN - SCOPUS:84931445489

T2 - 25th IEEE International Conference on Distributed Computing Systems Workshops, ICDCS 2005

Y2 - 6 June 2005 through 10 June 2005

ER -

On reducing broadcast expenses in ad hoc route discovery

Abstract

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this