Contention-Based Forwarding for Mobile Ad-Hoc Networks

Füßler, Holger ; Widmer, Jörg ; Käsemann, Michael ; Mauve, Martin ; Hartenstein, Hannes

Document Type: Article
Year of publication: 2003
The title of a journal, publication series: Ad Hoc Networks
Volume: 1
Issue number: 4
Page range: 351-369
Place of publication: Amsterdam [u.a.]
Publishing house: Elsevier Science
ISSN: 1570-8705
Publication language: English
Institution: School of Business Informatics and Mathematics > Praktische Informatik IV (Effelsberg 1989-2017)
Subject: 004 Computer science, internet
Abstract: Existing position-based unicast routing algorithms which forward packets in the geographic direction of the destination require that the forwarding node knows the positions of all neighbors in its transmission range. This information on direct neighbors is gained by observing beacon messages each node sends out periodically. Due to mobility, the information that a node receives about its neighbors becomes outdated, leading either to a significant decrease in the packet delivery rate or to a steep increase in load on the wireless channel as node mobility increases. In this paper, we propose a mechanism to perform position-based unicast forwarding without the help of beacons. In our contention-based forwarding scheme (CBF) the next hop is selected through a distributed contention process based on the actual positions of all current neighbors. For the contention process, CBF makes use of biased timers. To avoid packet duplication, the first node that is selected suppresses the selection of further nodes. We propose three suppression strategies which vary with respect to forwarding efficiency and suppression characteristics. We analyze the behavior of CBF with all three suppression strategies and compare it to an existing greedy position-based routing approach by means of simulation with ns-2. Our results show that CBF significantly reduces the load on the wireless channel required to achieve a specific delivery rate compared to the load a beacon-based greedy forwarding strategy generates.

Dieser Eintrag ist Teil der Universitätsbibliographie.

Metadata export


+ Search Authors in

+ Page Views

Hits per month over past year

Detailed information

You have found an error? Please let us know about your desired correction here: E-Mail

Actions (login required)

Show item Show item