Issue No. 02 - February (2009 vol. 8)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TMC.2008.98
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.
Routing protocols, Algorithm/protocol design and analysis
K. Psounis and A. Jindal, "Contention-Aware Performance Analysis of Mobility-Assisted Routing," in IEEE Transactions on Mobile Computing, vol. 8, no. , pp. 145-161, 2008.