P2P cache-and-forward mechanisms for mobile ad hoc networks

We investigate the problem of spreading information contents in a wireless ad hoc network. In our vision, information dissemination should satisfy the following requirements: (i) it should result in a desirable distribution of information replicas in the network and (ii) the information should be evenly and fairly carried by all nodes in their turn. In this paper, we show that these goals can be achieved by simple cache-and-forward mechanisms inspired by well-known node mobility models, provided that a sufficient number of information replicas are injected into the network. The proposed approach works under different network scenarios, is fully distributed and comes at a very low cost in terms of protocol overhead.

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

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

[3]  Tarek F. Abdelzaher,et al.  Energy-conserving data cache placement in sensor networks , 2005, TOSN.

[4]  Vijay V. Vazirani,et al.  Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation , 2001, JACM.

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

[6]  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..

[7]  Yu-Chee Tseng,et al.  The Broadcast Storm Problem in a Mobile Ad Hoc Network , 1999, Wirel. Networks.

[8]  Michael Trott,et al.  The mathematica guidebook , 2004 .

[9]  Divyakant Agrawal,et al.  Epidemic Algorithms for Replicated Databases , 2003, IEEE Trans. Knowl. Data Eng..

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

[11]  Azzedine Boukerche.  Handbook of Algorithms for Wireless Networking and Mobile Computing , 2005 .

[12]  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..

[13]  Jean-Yves Le Boudec,et al.  The Random Trip Model: Stability, Stationary Regime, and Perfect Simulation , 2006, IEEE/ACM Transactions on Networking.

[14]  E. Coyle,et al.  Stochastic Properties of Mobility Models in Mobile Ad Hoc Networks , 2006 .

[15]  Shahram Ghandeharizadeh,et al.  Near Optimal Number of Replicas for Continuous Media in Ad-hoc Networks of Wireless Devices , 2004, Multimedia Information Systems.

[16]  Ahmed Helmy,et al.  Active query forwarding in sensor networks , 2005, Ad Hoc Networks.

[17]  Azzedine Boukerche,et al.  Algorithms and Protocols for Wireless, Mobile Ad Hoc Networks , 2008 .

[18]  Donald F. Towsley,et al.  Properties of random direction models , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[19]  Azzedine Boukerche,et al.  Algorithms and Protocols for Wireless and Mobile Ad Hoc Networks: Boukerche/Mobile , 2008 .

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