Using link-layer broadcast to improve scalable source routing

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Using link-layer broadcast to improve scalable source routing

Full text

Pdf (627 KB)

Source

International Conference On Communications And Mobile Computing archive
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly table of contents

Leipzig, Germany

SESSION: Routing and protocols (General symposium) table of contents

Pages 466-471

Year of Publication: 2009

ISBN:978-1-60558-569-7

Authors

Pengfei Di	TU Munich, Germany
Thomas Fuhrmann	TU Munich, Germany

Sponsors

ACM: Association for Computing Machinery
: Wiley-Blackwell

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 10, Downloads (12 Months): 17, Citation Count: 0

Additional Information:

abstract references index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1582379.1582481 What is a DOI?

ABSTRACT

Scalable source routing (SSR) is a network layer routing protocol that provides services that are similar to those of structured peer-to-peer overlays.

In this paper, we describe several improvements to the SSR protocol. They aim at providing nodes with more up-to-date routing information: 1. The use of link-layer broadcast enables all neighbors of a node to contribute to the forwarding process. 2. A light-weight and fast selection mechanism avoids packet duplication and optimizes the source route iteratively. 3. Nodes implicitly learn the network's topology from overheard broadcast messages.

We present simulation results which show the performance gain of the proposed improvements: 1. The delivery ratio in settings with high mobility increases. 2. The required per-node state can be reduced as compared with the original SSR protocol. 3. The route stretch decreases. --- These improvements are achieved without increasing the routing overhead.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Sanjit Biswas , Robert Morris, ExOR: opportunistic multi-hop routing for wireless networks, Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications, August 22-26, 2005, Philadelphia, Pennsylvania, USA
	2	B. Blum, T. He, S. Son, and J. Stankovic. IGF: A state-free robust communication protocol for wireless sensor networks. Technical report, Department of Computer Science, University of Virginia, USA, 2003.
	3	Matthew Caesar , Miguel Castro , Edmund B. Nightingale , Greg O'Shea , Antony Rowstron, Virtual ring routing: network routing inspired by DHTs, Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications, September 11-15, 2006, Pisa, Italy
	4	M. Chawla, N. Goel, K. Kalaichelvan, A. Nayak, and I. StojmenovicIvan. Beaconless Position-based Routing with Guaranteed Delivery for Wireless Ad hoc and Sensor Networks. In Proc. 19th IFIP World Computer Congress, Santiago de Chile, Chile, August 2006.
	5	T. Fuhrmann. Scalable routing for networked sensors and actuators. In Proc. 2nd Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, Sept. 2005.
	6	T. Fuhrmann, P. Di, K. Kutzner, and C. Cramer. Pushing Chord into the Underlay: Scalable Routing for Hybrid MANETs. Technical report, Universität Karlsruhe(TH), Germany, Fakultät für Informatik, 2006.
	7	M. Heissenbüttel, T. Braun, T. Bernoulli, and M. Wächtli. BLR: Beacon-less routing algorithm for mobile ad-hoc networkssigcomm. Elsevier's Computer Communications Journal (ECC), 27(11):1076--1086, 2004.
	8	IEEE 802.11 Working Group. IEEE Std. 802.11--1999: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications., 1999.
	9	D. B. Johnson and D. A. Maltz. Dynamic Source Routing in Ad Hoc Wireless Networks. Mobile Computing, 353:153--181, Feb. 1996.
	10	K. Kutzner and T. Fuhrmann. Using linearization for global consistency in ssr. In Proc. 4th Int. Workshop on Hot Topics in P2P Systems, Mar. 2007.
	11	Charles E. Perkins , Elizabeth M. Royer, Ad-hoc On-Demand Distance Vector Routing, Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications, p.90, February 25-26, 1999
	12	J. A. Sanchez, R. Marin-Perez, and P. M. Ruiz. Beacon-less geographic routing in real wireless sensor networks. In Proc. 4th IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems (MASS), 2007.
	13	Ion Stoica , Robert Morris , David Karger , M. Frans Kaashoek , Hari Balakrishnan, Chord: A scalable peer-to-peer lookup service for internet applications, Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications, p.149-160, August 2001, San Diego, California, United States
	14	A. Varga. The OMNeT++ discrete event simulation system. In Proc. European Simulation Multiconference (ESM'2001)., Prague, Czech Republic, June 2001.