Abstract
In this paper, we introduce two protocols - a routing and a broadcasting protocol - for ad-hoc networks which are based on a new paradigm enabled by the broadcast property of the wireless propagation medium. Nodes simply broadcast packets such that forwarding decisions are no longer taken at the sender of a packet, but in a completely distributed manner at the receivers. Consequently, nodes do not require knowledge about their neighbors. In this way, control traffic can be eliminated almost completely which in turn conserves scarce network resources such as battery power and bandwidth. Furthermore, as these two protocols are almost stateless and nodes do not store network topology information they remain unaffected by even very high rates of topology change and prove highly scalable in terms of number of nodes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Mauve, J. Widmer, H. Hartenstein, A survey on position-based routing in mobile ad-hoc networks, IEEE Network 15(6) (2001) 30–39.
B. Williams, T. Camp, Comparison of broadcasting techniques for mobile ad hoc networks, in: Proceedings of the 3rd ACM International Symposium on Mobile and Ad Hoc Networking and Computing (MobiHoc’ 02), Lausanne, Switzerland, 2002, pp. 194–2002.
E. M. Royer, C.-K. Toh, A review of current routing protocols for ad-hoc mobile wireless networks, IEEE Personal Communications Magazine 6(2).
T. Camp, Location information services in mobile ad hoc networks, Tech. Rep. MCS-03-15, The Colorado School of Mines, Golden, CO, USA (Oct. 2003).
M. Heissenbüttel, T. Braun, T. Bernoulli, M. Wälchli, BLR: Beacon-less routing algorithm for mobile ad-hoc networks, Elsevier’s Computer Communications Journal (Special Issue) 27(11) (2004) 1076–1086.
M. Heissenbüttel, T. Braun, M. Wälchli, T. Bernoulli, Optimized stateless broadcasting in wireless multi-hop networks, in: IEEE Infocom 2006, Barcelona, Spain, 2006.
F. Kuhn, R. Wattenhofer, A. Zollinger, Worst-case optimal and average-case efficient geometric ad-hoc routing, in: Proceedings of the 4th ACM International Symposium on Mobile and Ad Hoc Networking and Computing (MobiHoc’ 03), Annapolis, Maryland, USA, 2003, pp. 267–278.
Qualnet (Nov. 2006). URL http://www.qualnet.com/
P. Bose, P. Morin, I. Stojmenovic, J. Urrutia, Routing with guaranteed delivery in ad hoc wireless networks, in: Proceedings of the 3th International ACM Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM’ 99), Seattle, USA, 1999, pp. 48–55.
B. Karp, H. T. Kung, GPSR: Greedy perimeter stateless routing for wireless net works, in: Proceedings of the 6th Annual ACM/IEEE International Conference on Mobile Computing and Networking (MOBICOM’ 00), Boston, USA, 2000, pp. 243–254.
M. Heissenbüttel, Routing and Broadcasting in Ad-Hoc Networks, Ph.D. thesis, University of Bern, CH-3012 Bern, Switzerland (Jun. 2005).
J. Nonnenmacher, E. W. Biersack, Scalable feedback for large groups, IEEE/ACM Transactions on Networking 7(3) (1999) 375–386.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Heissenbüttel, M. (2007). Routing and Broadcasting in Ad-Hoc Networks. In: Braun, T., Carle, G., Stiller, B. (eds) Kommunikation in Verteilten Systemen (KiVS). Informatik aktuell. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69962-0_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-69962-0_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69961-3
Online ISBN: 978-3-540-69962-0
eBook Packages: Computer Science and Engineering (German Language)