Contention-Aware Performance Analysis of Mobility-Assisted Routing

A large body of work has theoretically analyzed the performance of mobility-assisted routing schemes for intermittently connected mobile networks. But the vast majority of these prior studies have ignored wireless contention. Recent papers have shown through simulations that ignoring contention leads to inaccurate and misleading results, even for sparse networks. In this paper, we analyze the performance of routing schemes under contention. First, we introduce a mathematical framework to model contention. This framework can be used to analyze any routing scheme with any mobility and channel model. Then, we use this framework to compute the expected delays for different representative mobility-assisted routing schemes under random direction, random waypoint and community-based mobility models. Finally, we use these delay expressions to optimize the design of routing schemes while demonstrating that designing and optimizing routing schemes using analytical expressions which ignore contention can lead to suboptimal or even erroneous behavior.

[1]  Stephen P. Boyd,et al.  Optimal power control in interference-limited fading wireless channels with outage-probability specifications , 2002, IEEE Trans. Wirel. Commun..

[2]  Paul A. S. Ward,et al.  Practical Routing in Delay-Tolerant Networks , 2005, IEEE Transactions on Mobile Computing.

[3]  J. D. Parsons,et al.  Outage probability in a mobile radio system subject to fading and shadowing , 1985 .

[4]  PsounisKonstantinos,et al.  Efficient routing in intermittently connected mobile networks , 2008 .

[5]  Tristan Henderson,et al.  The changing usage of a mature campus-wide wireless network , 2004, MobiCom '04.

[6]  Alan F. T. Winfield,et al.  Distributed Sensing and Data Collection via Broken Ad Hoc Wireless Connected Networks of Mobile Robots , 2000, DARS.

[7]  Donald F. Towsley,et al.  Performance modeling of epidemic routing , 2006, Comput. Networks.

[8]  Amin Vahdat,et al.  Epidemic Routing for Partially-Connected Ad Hoc Networks , 2009 .

[9]  Konstantinos Psounis,et al.  Fundamental properties of mobility for realistic performance analysis of mobility-assisted networks , 2006 .

[10]  Tracy Camp,et al.  A survey of mobility models for ad hoc network research , 2002, Wirel. Commun. Mob. Comput..

[11]  Yu-Chee Tseng,et al.  The Broadcast Storm Problem in a Mobile Ad Hoc Network , 1999, Wirel. Networks.

[12]  T. Spyropoulos,et al.  Efficient Routing in Intermittently Connected Mobile Networks: The Multiple-Copy Case , 2008, IEEE/ACM Transactions on Networking.

[13]  Kevin Curran,et al.  Disruption Tolerant Networking , 2008, Comput. Inf. Sci..

[14]  Ger Koole,et al.  The message delay in mobile ad hoc networks , 2005, Perform. Evaluation.

[15]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[16]  Ness B. Shroff,et al.  Delay and Capacity Trade-Offs in Mobile Ad Hoc Networks: A Global Perspective , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[17]  Zygmunt J. Haas,et al.  Resource and performance tradeoffs in delay-tolerant wireless networks , 2005, WDTN '05.

[18]  A. Jindal,et al.  Optimizing Multi-Copy Routing Schemes for Resource Constrained Intermittently Connected Mobile Networks , 2006, 2006 Fortieth Asilomar Conference on Signals, Systems and Computers.

[19]  Cauligi S. Raghavendra,et al.  Performance analysis of mobility-assisted routing , 2006, MobiHoc '06.

[20]  Yong Wang,et al.  Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with ZebraNet , 2002, ASPLOS X.

[21]  Asrar U. H. Sheikh,et al.  Outage probability analysis for microcell mobile radio systems with cochannel interferers in Rician/Rayleigh fading environment , 1990 .

[22]  Pan Hui,et al.  How Small Labels Create Big Improvements , 2006, Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07).

[23]  Maria Udén,et al.  Providing connectivity to the Saami nomadic community , 2002 .

[24]  Hao Wu,et al.  MDDV: a mobility-centric data dissemination algorithm for vehicular networks , 2004, VANET '04.

[25]  Jitendra Padhye,et al.  Routing in multi-radio, multi-hop wireless mesh networks , 2004, MobiCom '04.

[26]  Konstantinos Psounis,et al.  Contention-aware analysis of routing schemes for mobile opportunistic networks , 2007, MobiOpp '07.

[27]  Ahmed Helmy,et al.  Modeling Time-Variant User Mobility in Wireless Mobile Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[28]  Konstantinos Psounis,et al.  An analytical study of fundamental mobility properties for encounter-based protocols , 2008, Int. J. Auton. Adapt. Commun. Syst..

[29]  K. Psounis,et al.  Efficient Routing in Intermittently Connected Mobile Networks: The Single-Copy Case , 2008, IEEE/ACM Transactions on Networking.

[30]  Kejie Lu,et al.  Resilient Opportunistic Forwarding: Issues and Challenges , 2007, MILCOM 2007 - IEEE Military Communications Conference.

[31]  Konstantinos Psounis,et al.  Wireless Contention in Mobile Multi-hop Networks , 2007 .

[32]  Ellen W. Zegura,et al.  A message ferrying approach for data delivery in sparse mobile ad hoc networks , 2004, MobiHoc '04.

[33]  Konstantinos Psounis,et al.  Performance analysis of epidemic routing under contention , 2006, IWCMC '06.

[34]  Jean-Yves Le Boudec,et al.  Perfect simulation and stationarity of a class of mobility models , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[35]  Marco Zuniga,et al.  Analyzing the transitional region in low power wireless links , 2004, 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004..

[36]  Margaret Martonosi,et al.  Erasure-coding based routing for opportunistic networks , 2005, WDTN '05.

[37]  Arun Venkataramani,et al.  DTN routing as a resource allocation problem , 2007, SIGCOMM '07.

[38]  Michele Garetto,et al.  Modeling Per-Flow Throughput and Capturing Starvation in CSMA Multi-Hop Wireless Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[39]  Robert Morris,et al.  Link-level measurements from an 802.11b mesh network , 2004, SIGCOMM 2004.

[40]  Michele Garetto,et al.  Modeling media access in embedded two-flow topologies of multi-hop wireless networks , 2005, MobiCom '05.

[41]  Cauligi S. Raghavendra,et al.  Spray and wait: an efficient routing scheme for intermittently connected mobile networks , 2005, WDTN '05.

[42]  Anders Lindgren,et al.  Probabilistic routing in intermittently connected networks , 2003, MOCO.

[43]  Robert Tappan Morris,et al.  Link-level measurements from an 802.11b mesh network , 2004, SIGCOMM '04.

[44]  Ness B. Shroff,et al.  Delay and Capacity Trade-Offs in Mobile Ad Hoc Networks: A Global Perspective , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[45]  Ivan Stojmenovic,et al.  Ad hoc Networking , 2004 .

[46]  Vinton G. Cerf,et al.  Delay-tolerant networking: an approach to interplanetary Internet , 2003, IEEE Commun. Mag..

[47]  Giovanni Neglia,et al.  Optimal delay-power tradeoff in sparse delay tolerant networks: a preliminary study , 2006, CHANTS '06.

[48]  Geoffrey M. Voelker,et al.  Access and mobility of wireless PDA users , 2003, MOCO.

[49]  Cauligi S. Raghavendra,et al.  Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility , 2007, Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07).