RENA: region-based routing in intermittently connected mobile network

Authors:
Hao Wen;Jia Liu;Chuang Lin;Fengyuan Ren;Pan Li;Yuguang Fang
Affiliations:
Tsinghua University, Beijing, China;Tsinghua University, Beijing, China;Tsinghua University, Beijing, China;Tsinghua University, Beijing, China;Mississippi State University, Starkville, MS, USA;University of Florida, Gainesville, FL, USA
Venue:
Proceedings of the 12th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Year:
2009

Citing 16
Cited 0

Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with ZebraNet

Proceedings of the 10th international conference on Architectural support for programming languages and operating systems
Age matters: efficient route discovery in mobile ad hoc networks using encounter ages

Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Routing in a delay tolerant network

Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Spray and wait: an efficient routing scheme for intermittently connected mobile networks

Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
DTN routing in a mobility pattern space

Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
On profiling mobility and predicting locations of wireless users

REALMAN '06 Proceedings of the 2nd international workshop on Multi-hop ad hoc networks: from theory to reality
Introduction to Probability Models, Ninth Edition

Introduction to Probability Models, Ninth Edition
DTN routing as a resource allocation problem

Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Power law and exponential decay of inter contact times between mobile devices

Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Mining behavioral groups in large wireless LANs

Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Efficient routing in intermittently connected mobile networks: the multiple-copy case

IEEE/ACM Transactions on Networking (TON)
Profile-cast: behavior-aware mobile networking

ACM SIGMOBILE Mobile Computing and Communications Review
Bubble rap: social-based forwarding in delay tolerant networks

Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Working day movement model

Proceedings of the 1st ACM SIGMOBILE workshop on Mobility models
Relays, base stations, and meshes: enhancing mobile networks with infrastructure

Proceedings of the 14th ACM international conference on Mobile computing and networking
Time scales and delay-tolerant routing protocols

Proceedings of the third ACM workshop on Challenged networks

Quantified Score

Hi-index	0.00

Visualization

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.