skip to main content
10.1145/1287791.1287799acmconferencesArticle/Chapter ViewAbstractPublication PagescommConference Proceedingsconference-collections
Article

Evaluating opportunistic routing protocols with large realistic contact traces

Published: 14 September 2007 Publication History

Abstract

Traditional mobile ad hoc network (MANET) routing protocols assume that contemporaneous end-to-end communication paths exist between data senders and receivers. In some mobile ad hoc networks with a sparse node population, an end-to-end communication path may break frequently or may not exist at anytime. Many routing protocols have been proposed in the literature to address the problem, but few were evaluated in a realistic "opportunistic" network setting. We use simulation and contact traces (derived from logs in a production network) to evaluate and compare five existing protocols: direct-delivery, epidemic, random, PRoPHET, and Link-State, as well as our own proposed routing protocol. We show that the direct delivery and epidemic routing protocols suffer either low delivery ratio or high resource usage, and other protocols make tradeoffs between delivery ratio and resource usage.

References

[1]
John Burgess, Brian Gallagher, David Jensen, and Brian Neil Levine. MaxProp: routing for vehicle-based disruption-tolerant networks. In Proceedings of the 25th IEEE International Conference on Computer Communications (INFOCOM), April 2006.
[2]
Scott Burleigh, Adrian Hooke, Leigh Torgerson, Kevin Fall, Vint Cerf, Bob Durst, Keith Scott, and Howard Weiss. Delay-tolerant networking: An approach to interplanetary Internet. IEEE Communications Magazine, 41(6):128--136, June 2003.
[3]
Tracy Camp, Jeff Boleng, and Vanessa Davies. A survey of mobility models for ad hoc network research. Wireless Communication & Mobile Computing (WCMC): Special issue on Mobile Ad Hoc Networking: Research, Trends and Applications, 2(5):483--502, 2002.
[4]
Andrew Campbell, Shane Eisenman, Nicholas Lane, Emiliano Miluzzo, and Ronald Peterson. People-centric urban sensing. In IEEE Wireless Internet Conference, August 2006.
[5]
Augustin Chaintreau, Pan Hui, Jon Crowcroft, Christophe Diot, Richard Gass, and James Scott. Impact of human mobility on the design of opportunistic forwarding algorithms. In Proceedings of the 25th IEEE International Conference on Computer Communications (INFOCOM), April 2006.
[6]
Kevin Fall. A delay-tolerant network architecture for challenged internets. In Proceedings of the 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM), August 2003.
[7]
Tristan Henderson, David Kotz, and Ilya Abyzov. The changing usage of a mature campus-wide wireless network. In Proceedings of the 10th Annual International Conference on Mobile Computing and Networking (MobiCom), pages 187--201, September 2004.
[8]
Pan Hui, Augustin Chaintreau, James Scott, Richard Gass, Jon Crowcroft, and Christophe Diot. Pocket switched networks and human mobility in conference environments. In ACM SIGCOMM Workshop on Delay Tolerant Networking, pages 244--251, August 2005.
[9]
Ravi Jain, Dan Lelescu, and Mahadevan Balakrishnan. Model T: an empirical model for user registration patterns in a campus wireless LAN. In Proceedings of the 11th Annual International Conference on Mobile Computing and Networking (MobiCom), pages 170--184, 2005.
[10]
Sushant Jain, Mike Demmer, Rabin Patra, and Kevin Fall. Using redundancy to cope with failures in a delay tolerant network. In Proceedings of the 2005 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM), pages 109--120, August 2005.
[11]
Philo Juang, Hidekazu Oki, Yong Wang, Margaret Martonosi, Li-Shiuan Peh, and Daniel Rubenstein. Energy-efficient computing for wildlife tracking: Design tradeoffs and early experiences with ZebraNet. In the Tenth International Conference on Architectural Support for Programming Languages and Operating Systems, October 2002.
[12]
David Kotz and Kobby Essien. Analysis of a campus-wide wireless network. Wireless Networks, 11:115--133, 2005.
[13]
David Kotz, Tristan Henderson, and Ilya Abyzov. CRAWDAD data set dartmouth/campus. http://crawdad.cs.dartmouth.edu/dartmouth/campus, December 2004.
[14]
Jason LeBrun, Chen-Nee Chuah, Dipak Ghosal, and Michael Zhang. Knowledge-based opportunistic forwarding in vehicular wireless ad hoc networks. In IEEE Vehicular Technology Conference, pages 2289--2293, May 2005.
[15]
Jeremie Leguay, Timur Friedman, and Vania Conan. Evaluating mobility pattern space routing for DTNs. In Proceedings of the 25th IEEE International Conference on Computer Communications (INFOCOM), April 2006.
[16]
Anders Lindgren, Avri Doria, and Olov Schelen. Probabilistic routing in intermittently connected networks. In Workshop on Service Assurance with Partial and Intermittent Resources (SAPIR), pages 239--254, 2004.
[17]
Mirco Musolesi, Stephen Hailes, and Cecilia Mascolo. Adaptive routing for intermittently connected mobile ad hoc networks. In IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks, pages 183--189, June 2005. extended version.
[18]
OLPC. One laptop per child project. http://laptop.org.
[19]
C. E. Perkins and P. Bhagwat. Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers. Computer Communication Review, pages 234--244, October 1994.
[20]
C. E. Perkins and E. M. Royer. Ad-hoc on-demand distance vector routing. In IEEE Workshop on Mobile Computing Systems and Applications, pages 90--100, February 1999.
[21]
Libo Song, David Kotz, Ravi Jain, and Xiaoning He. Evaluating next-cell predictors with extensive Wi-Fi mobility data. IEEE Transactions on Mobile Computing, 5(12):1633--1649, December 2006.
[22]
Jing Su, Ashvin Goel, and Eyal de Lara. An empirical evaluation of the student-net delay tolerant network. In International Conference on Mobile and Ubiquitous Systems (MobiQuitous), July 2006.
[23]
Amin Vahdat and David Becker. Epidemic routing for partially-connected ad hoc networks. Technical Report CS-2000-06, Duke University, July 2000.
[24]
Yong Wang, Sushant Jain, Margaret Martonosia, and Kevin Fall. Erasure-coding based routing for opportunistic networks. In ACM SIGCOMM Workshop on Delay Tolerant Networking, pages 229--236, August 2005.
[25]
Yu Wang and Hongyi Wu. DFT-MSN: the delay fault tolerant mobile sensor network for pervasive information gathering. In Proceedings of the 25th IEEE International Conference on Computer Communications (INFOCOM), April 2006.

Cited By

View all
  • (2024)A Hybrid Routing Protocol to Establish Communication in Mobility Cast Using Mobility PatternWireless Personal Communications10.1007/s11277-024-11081-8135:2(875-898)Online publication date: 2-May-2024
  • (2020)LoSeRO: A Locality Sensitive Routing Protocol in Opportunistic Networks with Contact ProfilesIEEE Transactions on Mobile Computing10.1109/TMC.2019.292322419:10(2392-2408)Online publication date: 1-Oct-2020
  • (2020)Implementation and Evaluation of Opportunistic Routing Protocols for Wireless and New Generation Communication NetworksWireless Personal Communications10.1007/s11277-020-07095-7Online publication date: 22-Jan-2020
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
CHANTS '07: Proceedings of the second ACM workshop on Challenged networks
September 2007
108 pages
ISBN:9781595937377
DOI:10.1145/1287791
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: 14 September 2007

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. oppotunistic networks
  2. routing
  3. simulation

Qualifiers

  • Article

Conference

MobiCom/MobiHoc '07
Sponsor:

Acceptance Rates

Overall Acceptance Rate 61 of 159 submissions, 38%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

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

Other Metrics

Citations

Cited By

View all
  • (2024)A Hybrid Routing Protocol to Establish Communication in Mobility Cast Using Mobility PatternWireless Personal Communications10.1007/s11277-024-11081-8135:2(875-898)Online publication date: 2-May-2024
  • (2020)LoSeRO: A Locality Sensitive Routing Protocol in Opportunistic Networks with Contact ProfilesIEEE Transactions on Mobile Computing10.1109/TMC.2019.292322419:10(2392-2408)Online publication date: 1-Oct-2020
  • (2020)Implementation and Evaluation of Opportunistic Routing Protocols for Wireless and New Generation Communication NetworksWireless Personal Communications10.1007/s11277-020-07095-7Online publication date: 22-Jan-2020
  • (2019)New Technique of Social Aware Routing Protocols in Delay Tolerant Network2019 IEEE 2nd Ukraine Conference on Electrical and Computer Engineering (UKRCON)10.1109/UKRCON.2019.8879984(1102-1106)Online publication date: Jul-2019
  • (2019)A Community Based Routing Algorithm for Mobile Opportunistic Networks2019 14th Conference on Industrial and Information Systems (ICIIS)10.1109/ICIIS47346.2019.9063337(302-307)Online publication date: Dec-2019
  • (2018)Building Realistic Mobility Models for Mobile Ad Hoc NetworksInformatics10.3390/informatics50200225:2(22)Online publication date: 30-Apr-2018
  • (2018)MOCHAProceedings of the 21st ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems10.1145/3242102.3242124(281-288)Online publication date: 25-Oct-2018
  • (2018)Vehicle Delay-tolerant Network Routing Algorithm based on Multi-period Bayesian Network2018 IEEE 37th International Performance Computing and Communications Conference (IPCCC)10.1109/PCCC.2018.8710825(1-8)Online publication date: Nov-2018
  • (2018)Scalable and Privacy Preserving Routing in Mobile Social Networks2018 IEEE 15th International Conference on Mobile Ad Hoc and Sensor Systems (MASS)10.1109/MASS.2018.00087(559-564)Online publication date: Oct-2018
  • (2018)PTDU: Public transit system based framework of data upload in urban crowd sensing2018 International Conference on Information Networking (ICOIN)10.1109/ICOIN.2018.8343258(920-925)Online publication date: Jan-2018
  • Show More Cited By

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