IEEE Copyright Notice

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

ACM Copyright Notice

These are the authors' versions of the work. The copyright is with ACM. They are posted here by permission of ACM for your personal use. Not for redistribution. See individual publication details for information on the publication of the definitive versions.

Springer-Verlag LNCS Copyright Notice

The copyright of these contributions has been transferred to Springer-Verlag Berlin Heidelberg New York. The copyright transfer covers the exclusive right to reproduce and distribute the contribution, including reprints, translations, photographic reproductions, microform, electronic form (offline, online), or any other reproductions of similar nature. Online available from Springer-Verlag LNCS series.

Work that appeared before the 1st of September 2003 was published while the authors were with the Lehrstuhl Praktische Informatik IV at the University of Mannheim.

Beaconless Position-Based Routing for Mobile Ad-Hoc Networks

Author(s): Holger Füßler, Jörg Widmer, Michael Käsemann, Martin Mauve, Hannes Hartenstein.
Title: Beaconless Position-Based Routing for Mobile Ad-Hoc Networks
Published: TR-03-001, Department of Computer Science, University of Mannheim, February 2003
Abstract: Existing position-based unicast routing algorithms, where packets areforwarded in the geographic direction of the destination, require thatthe forwarding node knows the positions of all neighbors in itstransmission range. This information on direct neighbors is gained byobserving beacon messages each node sends out periodically. Thetransmission of beacons and the storage of neighbor informationconsumes resources. Due to mobility, collected neighbor informationcan quickly get outdated which in turn can lead to packet drops. Inthis paper, we propose a mechanism to perform position-basedforwarding without the help of beacons or the maintenance of neighbortables. In our contention-based forwarding scheme(CBF) thenext hop is selected through a distributed contention process usingbiased timers. To avoid packet duplication, the first node that isselected suppresses the selection of further nodes. We propose threesuppression strategies which vary with respect to forwardingefficiency and suppression characteristics. We analyze the behaviorof CBF with all three suppression strategies and compare it to anexisting greedy routing approach by means of simulation with ns-2. Ourresults demonstrate that CBF is a promising strategy forposition-based routing.
Note: CBF
Bib entry: [XML] [BibTeX]
Download: [PDF]
Verantwortlich für den Inhalt: E-Mail sendenWE Informatik