This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Contention-Aware Performance Analysis of Mobility-Assisted Routing
February 2009 (vol. 8 no. 2)
pp. 145-161
Apoorva Jindal, University of Southern California, Los Angeles
Konstantinos Psounis, University of Southern California, Los Angeles
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] P. Juang, H. Oki, Y. Wang, M. Martonosi, L.S. Peh, and D. Rubenstein, “Energy-Efficient Computing for Wildlife Tracking: Design Tradeoffs and Early Experiences with Zebranet,” Proc. 10th Int'l Conf. Architectural Support for Programming Languages and Operating Systems (ASPLOS), 2002.
[2] Disruption Tolerant Networking, http://www.darpa.mil/ato/solicitDTN/, 2008.
[3] S. Burleigh, A. Hooke, L. Torgerson, K. Fall, V. Cerf, B. Durst, and K. Scott, “Delay-Tolerant Networking: An Approach to Interplanetary Internet,” IEEE Comm. Magazine, vol. 41, 2003.
[4] A. Doria, M. Udén, and D.P. Pandey, “Providing Connectivity to the Saami Nomadic Community,” Proc. Second Int'l Conf. Open Collaborative Design for Sustainable Innovation, Dec. 2002.
[5] A.F. Winfield, “Distributed Sensing and Data Collection via Broken Ad Hoc Wireless Connected Networks of Mobile Robots,” Distributed Autonomous Robotic Systems, pp. 273-282, 2000.
[6] H. Wu, R. Fujimoto, R. Guensler, and M. Hunter, “MDDV: Mobility-Centric Data Dissemination Algorithm for Vehicular Networks,” Proc. ACM SIGCOMM Workshop Vehicular Ad Hoc Networks (VANET), 2004.
[7] C. Perkins, Ad Hoc Networking, first ed. Addison-Wesley, 2001.
[8] A. Vahdat and D. Becker, “Epidemic Routing for Partially Connected Ad Hoc Networks,” Technical Report CS-200006, Duke Univ., Apr. 2000.
[9] S. Jain, K. Fall, and R. Patra, “Routing in a Delay Tolerant Network,” Proc. ACM SIGCOMM '04, Aug. 2004.
[10] W. Zhao, M. Ammar, and E. Zegura, “A Message Ferrying Approach for Data Delivery in Sparse Mobile Ad Hoc Networks,” Proc. ACM MobiHoc, 2004.
[11] A. Lindgren, A. Doria, and O. Schelen, “Probabilistic Routing in Intermittently Connected Networks,” SIGMOBILE Mobile Computing and Comm. Rev., vol. 7, no. 3, 2003.
[12] T. Spyropoulos, K. Psounis, and C.S. Raghavendra, “Spray and Wait: Efficient Routing in Intermittently Connected Mobile Networks,” Proc. ACM SIGCOMM Workshop Delay Tolerant Networking (WDTN), 2005.
[13] Y. Wang, S. Jain, M. Martonosi, and K. Fall, “Erasure Coding Based Routing for Opportunistic Networks,” Proc. ACM SIGCOMM Workshop on Delay Tolerant Networking (WDTN), 2005.
[14] E. Jones, L. Li, and P. Ward, “Practical Routing in Delay-Tolerant Networks,” Proc. ACM SIGCOMM Workshop Delay Tolerant Networking (WDTN), 2005.
[15] T. Spyropoulos, K. Psounis, and C.S. Raghavendra, “Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility,” Proc. IEEE PerCom Workshop Intermittently Connected Mobile Ad Hoc Networks, 2007.
[16] T. Spyropoulos, K. Psounis, and C.S. Raghavendra, “Efficient Routing in Intermittently Connected Mobile Networks: The Single-Copy Case,” IEEE/ACM Trans. Networking, 2008.
[17] T. Spyropoulos, K. Psounis, and C.S. Raghavendra, “Efficient Routing in Intermittently Connected Mobile Networks: The Multi-Copy Case,” IEEE/ACM Trans. Networking, 2008.
[18] P. Hui and J. Crowcroft, “How Small Labels Create Big Improvements,” Proc. IEEE PerCom Workshop Intermittently Connected Mobile Ad Hoc Networks, 2007.
[19] A. Balasubramanian, B. Levine, and A. Venkataramani, “DTN Routing as a Resource Allocation Problem,” Proc. ACM SIGCOMM, 2007.
[20] R. Groenevelt, P. Nain, and G. Koole, “The Message Delay in Mobile Ad Hoc Network,” Performance, 2005.
[21] T. Spyropoulos, K. Psounis, and C.S. Raghavendra, “Performance Analysis of Mobility-Assisted Routing,” Proc. ACM MobiHoc, 2006.
[22] X. Zhang, G. Neglia, J. Kurose, and D. Towsley, “Performance Modeling of Epidemic Routing,” Networking, 2005.
[23] G. Neglia and X. Zhang, “Optimal Delay-Power Tradeoff in Sparse Delay Tolerant Networks: A Preliminary Study,” Proc. ACM SIGCOMM Workshop Challenged Networks (CHANTS), 2006.
[24] T. Small and Z. Haas, “Resource and Performance Tradeoffs in Delay-Tolerant Wireless Networks,” Proc. ACM SIGCOMM Workshop Delay Tolerant Networking (WDTN), 2005.
[25] A. Jindal and K. Psounis, “Performance Analysis of Epidemic Routing under Contention,” Proc. Workshop Delay Tolerant Mobile Networking (DTMN), 2006.
[26] H. Zhu and K. Lu, “Resilient Opportunistic Forwarding: Issues and Challenges,” Proc. Military Comm. Conf. (MILCOM), 2007.
[27] Y.-C. Tseng, S.-Y. Ni, Y.-S. Chen, and J.-P. Sheu, “The Broadcast Storm Problem in a Mobile Ad Hoc Network,” Wireless Networks, vol. 8, nos. 2/3, 2002.
[28] D. Aguuayo, J. Bicket, S. Biswas, G. Judd, and R. Morris, “Link-Level Measurements from an 802.11b Mesh Network,” Proc. ACM SIGCOMM, 2004.
[29] P. Gupta and P. Kumar, “Capacity of Wireless Networks,” IEEE Trans. Information Theory, vol. 46, no. 2, 2000.
[30] A. Gamal, J. Mammen, B. Prabhakar, and D. Shah, “Throughput-Delay Tradeoff in Wireless Networks,” Proc. IEEE INFOCOM, 2004.
[31] G. Sharma, R.R. Mazumdar, and N.B. Shroff, “Delay and Capacity Trade-Offs in Mobile Ad Hoc Networks: A Global Perspective,” Proc. IEEE INFOCOM, 2006.
[32] T. Henderson, D. Kotz, and I. Abyzov, “The Changing Usage of a Mature Campus-Wide Wireless Network,” Proc. ACM MobiCom, 2004.
[33] M. McNett and G. Voelker, “Access and Mobility of Wireless PDA Users,” ACM Mobile Computing and Comm. Rev., 2003.
[34] A. Jindal and K. Psounis, “Contention-Aware Analysis of Routing Schemes for Mobile Opportunistic Networks,” Proc. ACM MOBISYS Workshop Mobile Opportunistic Networks, 2007.
[35] T. Camp, J. Boleng, and V. Davies, “A Survey of Mobility Models for Ad Hoc Network Research,” Wireless Communications & Mobile Computing (WCMC), special issue on mobile ad hoc networking: research, trends, and applications, 2002.
[36] W. Hsu, T. Spyropoulos, K. Psounis, and A. Helmy, “Modeling Time-Variant User Mobility in Wireless Mobile Networks,” Proc. IEEE INFOCOM, 2008.
[37] T. Spyropoulos, A. Jindal, and K. Psounis, “An Analytical Study of Fundamental Mobility Properties for Encounter-Based Protocols (Extended Version),” Technical Report CENG-2007-8, University of Southern California, 2007.
[38] T. Spyropoulos, A. Jindal, and K. Psounis, “An Analytical Study of Fundamental Mobility Properties for Encounter-Based Protocols,” Int'l J. Autonomous and Adaptive Comm. Systems, 2008.
[39] J.Y.L. Boudec and M. Vojnovic, “Perfect Simulation and Stationarity of a Class of Mobility Models,” Proc. IEEE INFOCOM, 2005.
[40] A. Jindal and K. Psounis, “Contention-Aware Performance Analysis of Mobility-Assisted Routing,” Technical Report CENG-2007-9, University of Southern California, http://ee.usc. edu/research/netpd/assets/ 00159762.pdf, 2007.
[41] S. Kandukuri and S. Boyd, “Optimal Power Control in Interference-Limited Fading Wireless Channels with Outage-Probability Specifications,” IEEE Trans. Wireless Comm., vol. 1, Jan. 2002.
[42] Y.-D. Yao and A. Sheikh, “Outage Probability Analysis for Microcell Mobile Radio Systems with Cochannel Interferers in Rician/Rayleigh Fading Environment,” IEEE Electronics Letters, vol. 26, June 1990.
[43] A. Williamson and J. Parsons, “Outage Probability in a Mobile Radio System Subject to Fading and Shadowing,” IEEE Electronics Letters, vol. 21, pp. 622-623, 1985.
[44] M. Garetto, J. Shi, and E. Knightly, “Modeling Media Access in Embedded Two-Flow Topologies of Multi-Hop Wireless Networks,” Proc. ACM MobiHoc, 2005.
[45] M. Garetto, T. Salonidis, and E. Knightly, “Modeling Per-Flow Throughput and Capturing Starvation in CSMA Multi-Hop Wireless Networks,” Proc. IEEE INFOCOM, 2006.
[46] A. Jindal and K. Psounis, “Optimizing Multi-Copy Routing Schemes for Resource Constrained Intermittently Connected Mobile Networks,” Proc. IEEE Asilomar Conf. Signals, Systems and Computers, 2006.

Index Terms:
Routing protocols, Algorithm/protocol design and analysis
Citation:
Apoorva Jindal, Konstantinos Psounis, "Contention-Aware Performance Analysis of Mobility-Assisted Routing," IEEE Transactions on Mobile Computing, vol. 8, no. 2, pp. 145-161, Feb. 2009, doi:10.1109/TMC.2008.98
Usage of this product signifies your acceptance of the Terms of Use.