A Novel Forwarding Paradigm for Position-Based Routing (with Implicit Addressing)

Füßler, Holger ; Widmer, Jörg ; Mauve, Martin ; Hartenstein, Hannes

URL: http://dx.doi.org/10.1109/CCW.2003.1240810
Document Type: Conference or workshop publication
Year of publication: 2003
Book title: Proceedings / CCW 2003, 2003 IEEE 18th Annual Workshop on Computer Communications : Dana Point, California, USA, 20 - 21 October 2003
The title of a journal, publication series: Proceedings of IEEE 18th Annual Workshop on Computer Communications (CCW 2003), Technical Committee on Computer Communications (TCCC) of the IEEE Communications Society, Dana Point, CA, 20.10.2003
Page range: 194-200
Place of publication: Piscataway, NJ
Publishing house: IEEE Operations Center
ISBN: 0-7803-8239-0
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 describe 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. Since the basic scheme can lead to packet duplication, we describe alternative ways of suppressing those. In addition to that, we compare the CBF schemes and standard greedy forwarding by means of simulation with ns-2.

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