skip to main content
10.1145/1066677.1066939acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
Article

Probabilistic multi-path vs. deterministic single-path protocols for dynamic ad-hoc network scenarios

Published: 13 March 2005 Publication History

Abstract

We investigate the performance of different protocol stacks under various application scenarios. Our method of choice is a full-fledged simulation in QualNet, testing the complete protocol stack over fairly large-scale networks. We find that the relative ranking of protocols strongly depends on the network scenario, the session load, the mobility level, and the choice of protocol parameters. We show that the Parametric Probabilistic Protocols, which we generalize from their original definition, can outperform standard routing protocols, such as AODV or Gossiping or Shortest-Path, in a variety of realistic scenarios.

References

[1]
Ian F. Akyildiz, Weilian Su, Yogesh Sankarasubramaniam, Erdal Cayirci; A Survey on Sensor Networks; IEEE Communications Magazine, August 2002.
[2]
C. Barrett, M. Drozda, A. Marathe and M. Marathe, Characterizing the Interaction Between Routing and MAC Protocols in Ad-hoc Networks. Proc. 3rd ACM international Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC), Lausanne, Switzerland, June 2002.
[3]
C.L. Barrett, S. Eidenbenz, L. Kroc, M. V. Marathe, and J. P. Smith. Parametric Probabilistic Sensor Network Routing; Proceedings of The Second ACM International Workshop on Wireless Sensor Networks and Applications (WSNA 2003), 2003.
[4]
C. Bettstetter, H. Hartenstein, X. Pérez-Costa. Stochastic Properties of the Random Waypoint Mobility Model. accepted for ACM/Kluwer Wireless Networks Special Issue on Modeling & Analysis of Mobile Networks, to appear in 2004
[5]
J. Broch, D. Maltz, D. Johnson, Y. Hu, and J. Jetcheva. Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols. Proc. 4th Annual ACM/IEEE International Conference on Mobile Computing and Networking, ACM, Dallas, TX, October 1998.
[6]
A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H. Sturgis, D. Swinehart, D. Terry; Epidemic algorithms for replicated database maintenance; Proceedings ACM Symposium on Principles of Distributed Computing (PODC), pp. 1--12, 1987.
[7]
Deepak Ganesan, Ramesh Govindan, Scott Shenker, Deborah Estrin; Highly Resilient, Energy Efficient Multipath Routing in Wireless Sensor Networks; Mobile Computing and Communications Review, Vol. 1, No. 2.,
[8]
Zygmunt Haas, Joseph Y. Halpern, Li Li; Gossip-Based Ad Hoc Routing; Proceedings of INFOCOM 2002, 2002.
[9]
David Kempe, Jon Kleinberg, Alan Demers; Spatial Gossip and Resource Location Protocols; Proceedings of 33rd ACM Symposium on the Theory of Computing (STOC), 2001.
[10]
Haiyun Luo, Ramachandran Ramjee, Prasun Sinha, Li Li, Songwu Lu, UCAN: A Unified Cellular and Ad-Hoc Network Architecture, ACM MOBICOM'03, p.353, 2003.
[11]
Jun Luo, Patrick Th. Eugster, Jean-Pierre Hubaux; Route Driven Gossip: Probabilistic Reliable Multicast in Ad Hoc Networks; Proceedings of INFOCOM 2003, 2003.
[12]
M. Mauve, J. Widmer and H. Hartenstein, A Survey on Position Based Routing in Mobile Ad-hoc Networks, IEEE Network, Nov. 2001.
[13]
Charles E. Perkins and Elizabeth M. Royer; Ad hoc On-Demand Distance Vector Routing; Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications, New Orleans, 1999.
[14]
S. Ramanathan and M. Steenstrup, A survey of Routing Techniques for Mobile Communication Networks. Mobile Networks and Applications, Vol. 1-2, 1996, pp. 89--104.
[15]
Routing in Communication Networks, M. Steenstrup, Editor, Prentice Hall, New Jersey, 1995
[16]
A. Vahdat and D. Becker. Epidemic Routing for Partially Connected Ad Hoc Networks. Technical Report CS-200006, Duke University, April 2000.
[17]
draft-08 and draft-09 of AODV are available from http://moment.cs.ucsb.edu/AODV/aodv.html
[18]
QualNet, http://www.scalable-networks.com/.

Cited By

View all
  • (2014)From Shortest-Path to All-PathIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2013.20325:7(1745-1755)Online publication date: 1-Jul-2014
  • (2011)The Routing Continuum from Shortest-Path to All-PathProceedings of the 2011 31st International Conference on Distributed Computing Systems10.1109/ICDCS.2011.57(847-856)Online publication date: 20-Jun-2011
  • (2007)Scalable and Reliable Sensor Network RoutingProceedings of the IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications10.1109/INFCOM.2007.84(670-678)Online publication date: 1-May-2007

Index Terms

  1. Probabilistic multi-path vs. deterministic single-path protocols for dynamic ad-hoc network scenarios

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    SAC '05: Proceedings of the 2005 ACM symposium on Applied computing
    March 2005
    1814 pages
    ISBN:1581139640
    DOI:10.1145/1066677
    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

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 13 March 2005

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. mobility
    2. probabilistic routing
    3. scenarios
    4. wireless networks

    Qualifiers

    • Article

    Conference

    SAC05
    Sponsor:
    SAC05: The 2005 ACM Symposium on Applied Computing
    March 13 - 17, 2005
    New Mexico, Santa Fe

    Acceptance Rates

    Overall Acceptance Rate 1,650 of 6,669 submissions, 25%

    Upcoming Conference

    SAC '25
    The 40th ACM/SIGAPP Symposium on Applied Computing
    March 31 - April 4, 2025
    Catania , Italy

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)2
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 14 Feb 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2014)From Shortest-Path to All-PathIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2013.20325:7(1745-1755)Online publication date: 1-Jul-2014
    • (2011)The Routing Continuum from Shortest-Path to All-PathProceedings of the 2011 31st International Conference on Distributed Computing Systems10.1109/ICDCS.2011.57(847-856)Online publication date: 20-Jun-2011
    • (2007)Scalable and Reliable Sensor Network RoutingProceedings of the IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications10.1109/INFCOM.2007.84(670-678)Online publication date: 1-May-2007

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media