A Lightweight Distributed Solution to Content Replication in Mobile Networks

Performance and reliability of content access in mobile networks is conditioned jointly by the number and location of content replicas deployed at the network nodes. The endeavour of this work is to address such an optimization problem with a distributed, lightweight solution that handles network dynamics. We devise a mechanism that lets nodes share the burden of storing and providing content, so as to achieve load balancing, and decide whether to replicate or drop the information so as to adapt to a dynamic content demand and time-varying topology. Simulation results show that our mechanism, which uses local measurements only, is: (i) extremely precise in approximating an optimal solution to content placement and replication; (ii) robust against network mobility; (iii) flexible in accommodating variation in time and space of the content demand.

[1]  Roger Wattenhofer,et al.  Facility location: distributed approximation , 2005, PODC '05.

[2]  Bin Tang,et al.  Benefit-Based Data Caching in Ad Hoc Networks , 2008, IEEE Trans. Mob. Comput..

[3]  Said Salhi,et al.  Discrete Location Theory , 1991 .

[4]  Michaël Hauspie.  Localized probabilistic and dominating set based algorithm for efficient information dissemination in ad hoc networks , 2004, 2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975).

[5]  Hao Yu,et al.  Cluster-based replication for large-scale mobile ad-hoc networks , 2005, 2005 International Conference on Wireless Networks, Communications and Mobile Computing.

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

[7]  Takahiro Hara,et al.  Data replication methods based on the stability of radio links in ad hoc networks , 2003, 14th International Workshop on Database and Expert Systems Applications, 2003. Proceedings..

[8]  Kamesh Munagala,et al.  Local search heuristic for k-median and facility location problems , 2001, STOC '01.

[9]  Bhaba R. Sarker,et al.  Discrete location theory , 1991 .

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

[11]  Nitin H. Vaidya,et al.  Efficient content location in wireless ad hoc networks , 2004, IEEE International Conference on Mobile Data Management, 2004. Proceedings. 2004.

[12]  S. L. HAKIMIt.  AN ALGORITHMIC APPROACH TO NETWORK LOCATION PROBLEMS. , 1979 .

[13]  C. Chiasserini,et al.  P 2 P Cache-and-Forward Mechanisms for Mobile Ad Hoc Networks , 2009 .

[14]  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).

[15]  Guohong Cao,et al.  Balancing the tradeoffs between data accessibility and query delay in ad hoc networks , 2004, Proceedings of the 23rd IEEE International Symposium on Reliable Distributed Systems, 2004..

[16]  Klara Nahrstedt,et al.  Integrated data lookup and replication scheme in mobile ad hoc networks , 2001, SPIE ITCom.

[17]  Nadjib Badache,et al.  Data replication protocols for mobile ad-hoc networks: a survey and taxonomy , 2009, IEEE Communications Surveys & Tutorials.

[18]  Marco Fiore,et al.  On a selfish caching game , 2009, PODC '09.

[19]  Marco Fiore,et al.  P2P cache-and-forward mechanisms for mobile ad hoc networks , 2009, 2009 IEEE Symposium on Computers and Communications.

[20]  Jean-Yves Le Boudec,et al.  Perfect simulation and stationarity of a class of mobility models , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[21]  Kevin C. Almeroth,et al.  A Lightweight Content Replication Scheme for Mobile Ad Hoc Environments , 2004, NETWORKING.

[22]  Patrick Th. Eugster,et al.  PAN: providing reliable storage in mobile ad hoc networks with probabilistic quorum systems , 2003, MobiHoc '03.

[23]  Guohong Cao,et al.  Supporting Cooperative Caching in Ad Hoc Networks , 2006, IEEE Trans. Mob. Comput..

[24]  C.-F. Chiasserini,et al.  Efficient Cache Placement in Multi-Hop Wireless Networks , 2006, IEEE/ACM Transactions on Networking.

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

[26]  Azer Bestavros,et al.  Distributed Placement of Service Facilities in Large-Scale Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[27]  Takahiro Hara,et al.  On Updated Data Dissemination Exploiting an Epidemic Model in Ad Hoc Networks , 2006, BioADIT.

[28]  Thomas R. Gross,et al.  An evaluation of inter-vehicle ad hoc networks based on realistic vehicular traces , 2006, MobiHoc '06.

[29]  Deborah Estrin,et al.  Rumor Routing Algorithm For Sensor Networks , 2002 .

[30]  O. Kariv,et al.  An Algorithmic Approach to Network Location Problems. II: The p-Medians , 1979 .

[31]  Takahiro Hara,et al.  Replica allocation considering power consumption in mobile ad hoc networks , 2006, Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06).