skip to main content
10.1145/1582379.1582481acmconferencesArticle/Chapter ViewAbstractPublication PagesiwcmcConference Proceedingsconference-collections
research-article

Using link-layer broadcast to improve scalable source routing

Published: 21 June 2009 Publication History

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

[1]
S. Biswas and R. Morris. Opportunistic routing in multi-hop wireless networks. In Proc. ACM SIGCOMM '05, Philadelphia, PA, USA, August 2005.
[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]
M. Caesar, M. Castro, E. B. Nightingale, G. O'Shea, and A. Rowstron. Virtual Ring Routing: Network Routing Inspired by DHTs. In Proc. ACM SIGCOMM '06, Pisa, Italy, Sept. 2006.
[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]
C. E. Perkins and E. M. Royer. Ad hoc On-Demand Distance Vector Routing. In Proc. 2nd IEEE Workshop on Mobile Computing Systems and Applications, pages 90--100, New Orleans, LA, USA, Feb. 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]
I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications. In Proc. ACM SIGCOMM '01, pages 149--160, 2001.
[14]
A. Varga. The OMNeT++ discrete event simulation system. In Proc. European Simulation Multiconference (ESM'2001)., Prague, Czech Republic, June 2001.

Index Terms

  1. Using link-layer broadcast to improve scalable source routing

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    IWCMC '09: Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
    June 2009
    1561 pages
    ISBN:9781605585697
    DOI:10.1145/1582379
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    In-Cooperation

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 21 June 2009

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. mobile ad-hoc network
    2. peer-to-peer
    3. routing

    Qualifiers

    • Research-article

    Conference

    IWCMC '09
    Sponsor:

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • 0
      Total Citations
    • 112
      Total Downloads
    • Downloads (Last 12 months)2
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 07 Jan 2025

    Other Metrics

    Citations

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media