Balancing the Trade-Offs between Query Delay and Data Availability in MANETs

In mobile ad hoc networks (MANETs), nodes move freely and link/node failures are common, which leads to frequent network partitions. When a network partition occurs, mobile nodes in one partition are not able to access data hosted by nodes in other partitions, and hence significantly degrade the performance of data access. To deal with this problem, we apply data replication techniques. Existing data replication solutions in both wired or wireless networks aim at either reducing the query delay or improving the data availability, but not both. As both metrics are important for mobile nodes, we propose schemes to balance the trade-offs between data availability and query delay under different system settings and requirements. Extensive simulation results show that the proposed schemes can achieve a balance between these two metrics and provide satisfying system performance.

[1]  Baochun Li,et al.  Efficient and guaranteed service coverage in partitionable mobile ad-hoc networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[2]  Françoise Sailhan,et al.  Scalable Service Discovery for MANET , 2005, Third IEEE International Conference on Pervasive Computing and Communications.

[3]  Chita R. Das,et al.  Cooperative Caching in Wireless P2P Networks: Design, Implementation, and Evaluation , 2010, IEEE Transactions on Parallel and Distributed Systems.

[4]  Sandeep K. S. Gupta,et al.  Improving on-demand data access efficiency in MANETs with cooperative caching , 2009, Ad Hoc Networks.

[5]  Jiannong Cao,et al.  Data Consistency for Cooperative Caching in Mobile Environments , 2007, Computer.

[6]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[7]  Takahiro Hara,et al.  Effective replica allocation in ad hoc networks for improving data accessibility , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[8]  Lili Qiu,et al.  On the placement of Web server replicas , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[9]  George Kingsley Zipf,et al.  Human behavior and the principle of least effort , 1949 .

[10]  Herb Schwetman,et al.  CSIM19: a powerful tool for building system models , 2001, Proceeding of the 2001 Winter Simulation Conference (Cat. No.01CH37304).

[11]  Guohong Cao,et al.  Supporting cooperative caching in ad hoc networks , 2004, IEEE Transactions on Mobile Computing.

[12]  Peter Bertók,et al.  Replication of location-dependent data in mobile ad hoc networks , 2008, MobiDE '08.

[13]  Rajmohan Rajaraman,et al.  Approximation algorithms for data placement in arbitrary networks , 2001, SODA '01.

[14]  Vijay Kumar,et al.  Semantic Caching and Query Processing , 2003, IEEE Trans. Knowl. Data Eng..

[15]  Le Gruenwald,et al.  A survey of data replication techniques for mobile ad hoc network databases , 2008, The VLDB Journal.

[16]  Li Fan,et al.  Web caching and Zipf-like distributions: evidence and implications , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[17]  David A. Maltz,et al.  A performance comparison of multi-hop wireless ad hoc network routing protocols , 1998, MobiCom '98.

[18]  Amin Vahdat,et al.  Minimal replication cost for availability , 2002, PODC '02.

[19]  Valérie Issarny,et al.  A Middleware Service for Mobile Ad Hoc Data Sharing, Enhancing Data Availability , 2003, Middleware.

[20]  Robin Kravets,et al.  Power management techniques for mobile communication , 1998, MobiCom '98.

[21]  Marco Fiore,et al.  To Cache or Not To Cache? , 2009, IEEE INFOCOM 2009.

[22]  Ahmed Helmy,et al.  IMPORTANT: a framework to systematically analyze the Impact of Mobility on Performance of Routing Protocols for Adhoc Networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[23]  Thomas F. La Porta,et al.  Data Dissemination with Ring-Based Index for Wireless Sensor Networks , 2007, IEEE Transactions on Mobile Computing.

[24]  Srinivasa Rao,et al.  Cooperative Caching in Wireless P2P Networks: Design, Implementation and Evaluation , 2013 .

[25]  Ivan Stojmenovic,et al.  Localized Algorithms for Detection of Critical Nodes and Links for Connectivity in Ad hoc Networks , 2004 .

[26]  Lei Gao,et al.  Application specific data replication for edge services , 2003, WWW '03.

[27]  Ming-Syan Chen,et al.  On the effect of group mobility to data replication in ad hoc networks , 2006, IEEE Transactions on Mobile Computing.

[28]  Takahiro Hara,et al.  Replica allocation in ad hoc networks with periodic data update , 2002, Proceedings Third International Conference on Mobile Data Management MDM 2002.

[29]  KARL PEARSON,et al.  The Problem of the Random Walk , 1905, Nature.

[30]  Takahiro Hara.  Quantifying Impact of Mobility on Data Availability in Mobile Ad Hoc Networks , 2010, IEEE Transactions on Mobile Computing.

[31]  Thomas F. La Porta,et al.  Movement-Assisted Sensor Deployment , 2006, IEEE Trans. Mob. Comput..

[32]  Bin Tang,et al.  Benefit-based Data Caching in Ad Hoc Networks , 2006, Proceedings of the 2006 IEEE International Conference on Network Protocols.

[33]  Bo Sheng,et al.  Data storage placement in sensor networks , 2006, MobiHoc '06.

[34]  Xiaoyan Hong,et al.  A group mobility model for ad hoc wireless networks , 1999, MSWiM '99.