ACM Home Page
Please provide us with feedback. Feedback
RENA: region-based routing in intermittently connected mobile network
Full text PdfPdf (399 KB)
Source
International Workshop on Modeling Analysis and Simulation of Wireless and Mobile Systems archive
Proceedings of the 12th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems table of contents
Tenerife, Canary Islands, Spain
SESSION: DTNs table of contents
Pages 280-287  
Year of Publication: 2009
ISBN:978-1-60558-616-8
Authors
Hao Wen  Tsinghua University, Beijing, China
Jia Liu  Tsinghua University, Beijing, China
Chuang Lin  Tsinghua University, Beijing, China
Fengyuan Ren  Tsinghua University, Beijing, China
Pan Li  Mississippi State University, Starkville, MS, USA
Yuguang Fang  University of Florida, Gainesville, FL, USA
Sponsor
SIGSIM: ACM Special Interest Group on Simulation and Modeling
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 8,   Citation Count: 0
Additional Information:

abstract   references   index terms  

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/1641804.1641852
What is a DOI?

ABSTRACT

Considering the constraint brought by mobility and resources, it is important for routing protocols to efficiently deliver data in Intermittently Connected Mobile Network (ICMN). Different from previous works that use the knowledge of previous encounters to predict the future contact, we propose a storagefriendly REgioN-bAsed protocol, namely, RENA, in this paper. Instead of using temporal information, RENA builds routing tables based on regional movement history, which avoids excessive storage for tracking encounter history. We validate the generality of RENA through time-variant community mobility model with parameters extracted from the MIT WLAN trace, and the vehicular network based on 8 bus routes of the city of Helsinki. The comprehensive simulation results show that RENA is not only storage-friendly but also more efficient than the epidemic routing, the restricted replication protocol SNW and the encounter-based protocol RAPID under various conditions.


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
A. Balasubramanian, B. N. Levine, and A. Venkataramani. Dtn routing as a resource allocation problem. In ACM Sigcomm, Japan, Jan. 2007.
 
2
N. Banerjee, M. D. Corner, D. F. Towsley, and B. N. Levine. Relays, base stations, and meshes: enhancing mobile networks with infrastructure. In Proc. MOBICOM 2008, pages 81--91, California, Sept. 2008.
 
3
J. Burgess, B. Gallagher, D. Jensen, and B. N. Levine. Maxprop: Routing for vehicle-based disruption-tolerant networks. In Proc. IEEE INFOCOM, Spain, 2006.
 
4
A. Chaintreau, P. Hui, J. Crowcroft, C. Diot, R. Gass, and J. Scott. Impact of human mobility on the design of opportunistic forwarding algorithms. In Proc. IEEE INFOCOM, Spain, Apr. 2006.
 
5
H. Dubois--Ferriere, M. Grossglauser, and M. Vetterli. Age matters: efficient route discovery in mobile ad hoc networks using encounter ages. In Proc. ACM MobiHoc, pages 257--266, MD, USA, June 2003.
 
6
F. Ekman, A. Keranen, J. Karvo, and J. Ott. Working day movement model. In SIGMOBILE Mobility Models, Hong Kong, May 2008.
 
7
J. Ghosh, M. Beal, H. Ngo, and C. Qiao. On profiling mobility and predicting locations of campus-wide wireless network users. In Proc. REALMAN, pages 55--62, Italy, May 2006.
 
8
J. Ghosh, S. J. Philip, and C. Qiao. Sociological orbit aware location approximation and routing (solar) in manet. In Proc. IEEE Broadnets, pages 641--650, Boston, USA, Oct. 2005.
 
9
W. Hsu, D. Dutta, and A. Helmy. Extended abstract: Mining behavioral groups in large wireless lans. In Proc. ACM MOBICOM, pages 338--341, Canada, Sept. 2007.
 
10
W. Hsu, D. Dutta, and A. Helmy. Profile-cast: behavior-aware mobile networking. ACM SIGMOBILE Mobile Computing and Communications Review, 12:52--54, Jan. 2008.
 
11
W. Hsu, A. Spyropoulos, K. Psounis, and A. Helmy. Modeling time-variant user mobility in wireless mobile networks. In Proc. IEEE Infocom, Alaska, May 2007.
 
12
P. Hui, J. Crowcroft, and E. Yoneki. Bubble rap: social-based forwarding in delay tolerant networks. In Proc. ACM MobiHoc, pages 241--250, Hong Kong, China, May 2008.
 
13
S. Jain, K. Fall, and R. Patra. Routing in a delay tolerant networking. In Proc. SIGCOMM, pages 145--158, Portland, USA, Jan. 2004.
 
14
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. In ASPLOS-X, pages 96--107, USA, 2002.
 
15
T. Karagiannis, J. L. Boudec, and M. Vojnovic. Power law and exponential decay of inter contact times between mobile devices. In Proc. ACM MOBICOM, pages 183--194, Canada, Sept. 2007.
 
16
J. Karvo and J. Ott. Time scales and delay-tolerant routing protocols. In Proc. ACM Chants Workshop, pages 33--40, California, USA, Sept. 2008.
 
17
J. Leguay, T. Friedman, and V. Conan. Dtn routing in a mobility pattern space. In Proc. ACM Chants Workshop, pages 276--283, USA, Aug. 2005.
 
18
S. M. Ross. Introduction to Probability Models. Academic Press, Orlando, FL, 2006.
 
19
T. Spyropoulos, K. Psounis, and C. Raghavendra. Spray and wait: An efficient routing scheme for intermittently connected mobile networks. In Proc. ACM WDTN, pages 252--259, USA, Aug. 2005.
 
20
T. Spyropoulos, K. Psounis, and C. Raghavendra. Efficient routing in intermittently connected mobile networks: the multiple-copy case. IEEE/ACM Trans. Netw., 16:77--90, Feb. 2008.
 
21
A. Vahdat and D. Becker. Epidemic routing for partially-connected ad hoc networks. Technical report, Duke, 2000.
 
22
W. Zhao, Y. Chen, M. Ammar, M. D. Corner, B. N. Levine, and E. Zegura. Capacity enhancement using throwboxes in dtns. In Proc. IEEE MASS, pages 31--40, Vancouver, Canada, Oct. 2006.