ACM Home Page
Please provide us with feedback. Feedback
Performance analysis of mobility-assisted routing
Full text PdfPdf (340 KB)
Source International Symposium on Mobile Ad Hoc Networking & Computing archive
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing table of contents
Florence, Italy
SESSION: Mobility models table of contents
Pages: 49 - 60  
Year of Publication: 2006
ISBN:1-59593-368-9
Authors
Thrasyvoulos Spyropoulos  University of Southern California, USA
Konstantinos Psounis  University of Southern California, USA
Cauligi S. Raghavendra  University of Southern California, USA
Sponsors
ACM: Association for Computing Machinery
SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 31,   Downloads (12 Months): 238,   Citation Count: 21
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1132905.1132912
What is a DOI?

ABSTRACT

Traditionally, ad hoc networks have been viewed as a connected graph over which end-to-end routing paths had to be established.Mobility was considered a necessary evil that invalidates paths and needs to be overcome in an intelligent way to allow for seamless ommunication between nodes.However, it has recently been recognized that mobility an be turned into a useful ally, by making nodes carry data around the network instead of transmitting them. This model of routing departs from the traditional paradigm and requires new theoretical tools to model its performance. A mobility-assisted protocol forwards data only when appropriate relays encounter each other, and thus the time between such encounters, called hitting or meeting time, is of high importance.In this paper, we derive accurate closed form expressions for the expected encounter time between different nodes, under ommonly used mobility models. We also propose a mobility model that can successfully capture some important real-world mobility haracteristics, often ignored in popular mobility models, and alculate hitting times for this model as well. Finally, we integrate this results with a general theoretical framework that can be used to analyze the performance of mobility-assisted routing schemes. We demonstrate that derivative results oncerning the delay of various routing s hemes are very accurate, under all the mobility models examined. Hence, this work helps in better under-standing the performance of various approaches in different settings, and an facilitate the design of new, improved protocols.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Delay tolerant networking research group. http://www.dtnrg.org
 
2
D. Aldous and J. Fill. Reversible markov chains and random walks on graphs (monograph in preparation). http://stat-www.berkeley.edu/users/aldous/RWG/book.html
 
3
F. Bai, N. Sadagopan, and A. Helmy. The important framework for analyzing the impact of mobility on performance of routing for ad hoc networks. Elsevier Ad Hoc Networks Journal 1, Nov. 2003.
4
5
6
 
7
 
8
J. Y. L. Boudec and M. Vojnovic. Perfect simulation and stationarity of a class of mobility models. In Proceedings of IEEE INFOCOM 2005.
9
 
10
S. Burleigh, A. Hooke, L. Torgerson, K. Fall, V. Cerf, B. Durst, and K. Scott. Delay-tolerant networking: an approach to interplanetary internet. IEEE Communications Magazine 2003.
 
11
T. Camp,J. Boleng, and V. Davies. Mobility models for ad hoc network simulations. 2,2001.
 
12
R. M. de Moraes, H. R. Sadjadpour, and J. Garcia-Luna-Aceves. Throughput-delay analysis of mobile ad-hoc networks with a multi-copy relaying strategy. In Proceedings of IEEE SECON 2004.
 
13
A. Doria, M. Udn, and D. P. Pandey. Providing connectivity to the saami nomadic community. In Proc. 2nd Int. Conf. on Open Collaborative Design for Sustainable Innovation 2002.
 
14
A. Gamal, J. Mammen, B. Prabhakar, and D. Shah. Throughput-delay tradeoffs in wireless networks. In Proceedings of IEEE INFOCOM 2004.
 
15
 
16
P. Gupta and P. Kumar. Capacity of wireless networks. Transactions on Information Theory 46(2), 2000.
 
17
P. Gupta and P. R. Kumar. Critical poeer for asymptotic connectivity in wireless networks.In in Stochastic Analysis, Control, Optimization and Applications Birkhauser, Boston, 1998.
18
 
19
W. Hsu and A. Helmy. Impact: Investigation of mobile-user patterns across university campuses using lan trace analysis. Technical Report 2005,University of Southern California.
20
21
22
23
24
25
 
26
M. Neely and E. Modiano. Capacity and delay tradeoffs for ad-hoc mobile networks. IEEE Transactions on Information Theory 51, 2005.
 
27
 
28
E. Perevalov and R. Blum. Delay limited capacity of ad hoc networks: asymptotically optimal transmission and relaying strategy. In Proceedings of IEEE INFOCOM 2003.
29
 
30
R.C. Shah, S. Roy, S. Jain, and W. Brunette. Data mules: Modeling and analysis of a three-tier architecture for sparse sensor networks. Elsevier Ad Hoc Networks Journal 2003.
 
31
G. Sharma and R. Mazumdar. On achievable delay/capacity tradeoffs in mobile ad hoc networks. In Workshop on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (Wi'Opt), 2004.
 
32
G. Sharma and R. R. Mazumdar. Delay and capacity trade-off in wireless ad hoc networks with random way-point mobility. preprint, 2005.
33
 
34
T. Spyropoulos, K. Psounis, and C. S. Raghavendra. Multiple-copy routing in intermittently connected mobile networks. Technical Report CENG-2004-12, USC, 2004.
 
35
T. Spyropoulos, K. Psounis, and C. S. Raghavendra. Single-copy routing in intermittently connected mobile networks. In Proceedings of IEEE SECON 2004.
36
 
37
C. Tuduce and T. Gross. A mobility model based on lan traces and its validation. In Proceedings of IEEE INFOCOM 2005.
 
38
A. Vahdat and D. Becker. Epidemic routing for partially connected ad hoc networks. Technical Report CS-200006, Duke University, Apr.2000.
39
40
 
41
J. Yoon, M. Liu, and B. Noble. Random waypoint considered harmful. In Proceedings of IEEE INFOCOM 2003.
 
42
X. Zhang, G. Neglia, J. Kurose, and D. Towsley. Performance modeling of epidemic routing.Technical Report CMPSCI 05-44, UMass, 2005.
43

CITED BY  21

Collaborative Colleagues:
Thrasyvoulos Spyropoulos: colleagues
Konstantinos Psounis: colleagues
Cauligi S. Raghavendra: colleagues