ACM Home Page
Please provide us with feedback. Feedback
A message ferrying approach for data delivery in sparse mobile ad hoc networks
Full text PdfPdf (152 KB)
Source International Symposium on Mobile Ad Hoc Networking & Computing archive
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing table of contents
Roppongi Hills, Tokyo, Japan
SESSION: New directions table of contents
Pages: 187 - 198  
Year of Publication: 2004
ISBN:1-58113-849-0
Authors
W. Zhao  Georgia Institute of Technology, Atlanta, GA
M. Ammar  Georgia Institute of Technology, Atlanta, GA
E. Zegura  Georgia Institute of Technology, Atlanta, GA
Sponsors
SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 27,   Downloads (12 Months): 295,   Citation Count: 69
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/989459.989483
What is a DOI?

ABSTRACT

Mobile Ad Hoc Networks (MANETs) provide rapidly deployable and self-configuring network capacity required in many critical applications, e.g., battlefields, disaster relief and wide area sensing. In this paper we study the problem of efficient data delivery in sparse MANETs where network partitions can last for a significant period. Previous approaches rely on the use of either long range communication which leads to rapid draining of nodes' limited batteries, or existing node mobility which results in low data delivery rates and large delays. In this paper, we describe a Message Ferrying (MF) approach to address the problem. MF is a mobility-assisted approach which utilizes a set of special mobile nodes called message ferries (or ferries for short) to provide communication service for nodes in the deployment area. The main idea behind the MF approach is to introduce non-randomness in the movement of nodes and exploit such non-randomness to help deliver data. We study two variations of MF, depending on whether ferries or nodes initiate proactive movement. The MF design exploits mobility to improve data delivery performance and reduce energy consumption in nodes. We evaluate the performance of MF via extensive ns simulations which confirm the MF approach is efficient in both data delivery and energy consumption under a variety of network 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
DakNet project. http://web.media.mit.edu/char126 amir/daknet/.
 
2
 
3
N. Bansal and Z. Liu. Capacity, delay and mobility in wireless ad-hoc networks. In IEEE INFOCOM'2003, April 2003.
4
 
5
J. Bentley. Fast algorithms for geometric traveling salesman problems. ORSA Journal on Computing, 4:387--411, 1992.
6
7
8
 
9
10
11
 
12
D. Goodman, J. Borras, N. Mandayam, and R. Yates. INFOSTATIONS: A new system model for data and messaging services. In IEEE VTC'97, volume 2, pages 969--973, May 1997.
 
13
M. Grossglauser and D. Tse. Mobility increases the capacity of ad-hoc wireless networks. In IEEE INFOCOM 2001, April 2001.
 
14
M. Grossglauser and M. Vetterli. Locating nodes with EASE: Mobility diffusion of last encounters in ad hoc networks. In IEEE INFOCOM'2003, April 2003.
 
15
P. Gupta and P. R. Kumar. The capacity of wireless networks. IEEE Transactions on Information Theory, 46:388--404, March 2000.
16
 
17
D. Johnson and D. Maltz. Dynamic source routing in ad-hoc wireless networks. In ACM SIGCOMM, August 1996.
18
19
20
21
22
 
23
D. Nain, N. Petigara, and H. Balakrishnan. Integrated routing and storage for messaging applications in mobile ad hoc networks. In WiOpt 2003, March 2003.
 
24
E. Perevalov and R. Blum. Delay limited capacity of ad hoc networks: Asymptotically optimal transmission and relaying strategy. In IEEE INFOCOM'2003, April 2003.
25
 
26
 
27
R. Ramanathan and R. Hain. Topology control of multihop wireless networks using transmit power adjustment. In IEEE INFOCOM, 2000.
 
28
 
29
R. Shah, S. Roy, S. Jain, and W. Brunette. Data MULEs: Modeling a three-tier architecture for sparse sensor networks. In IEEE SNPA Workshop, 2003.
 
30
R. Sivakumar, P. Sinha, and V. Bharghavan. CEDAR: a core-extraction distributed ad hoc routing algorithm. IEEE Journal on Selected Areas in Communications, 17:1454--1465, August 1999.
31
 
32
 
33
A. Vahdat and D. Becker. Epidemic routing for partially-connected ad hoc networks. Technical report, Duke University, 2000.
 
34
R. Wattenhofer, L. Li, P. Bahl, and Y. Wang. Distributed topology control for power efficient operation in multihop wireless ad hoc networks. In IEEE INFOCOM 2001, April 2001.
 
35

CITED BY  69