Abstract
Replication of data items among different nodes of a wireless infrastructureless network may be an efficient technique to increase data availability and improve data access latency. This paper proposes a novel algorithm to distribute data items among nodes in these networks. The goal of the algorithm is to deploy the replicas of the data items in such a way that they are sufficiently distant from each other to prevent excessive redundancy but, simultaneously, they remain close enough to each participant, such that data retrieval can be achieved using a small number of messages. The paper describes the algorithm and provides its performance evaluation for several different network configurations.
This work was partially supported by the MiNEMA programme of the European Science Foundation and by FCT project MICAS, POSC/EIA/60692/2004 through FCT and FEDER.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Ghose, A., Grossklags, J., Chuang, J.: Resilient data-centric storage in wireless sensor networks. IEEE Distributed Systems Online (2003)
Liu, D., Stojmenovic, I., Jia, X.: A scalable quorum based location service in ad hoc and sensor networks. In: Proc. of the 3rd IEEE Conf. on Mobile Ad-hoc and Sensor Systems, IEEE Computer Society Press, Los Alamitos (2006)
Ratnasamy, S., Karp, B., Shenker, S., Estrin, D., Govindan, R., Yin, L., Yu, F.: Data-centric storage in sensornets with GHT, a geographic hash table. Mobile networks and applications 8(4), 427–442 (2003)
Datta, A., Quarteroni, S., Aberer, K.: Autonomous gossiping: A self-organizing epidemic algorithm for selective information dissemination in mobile ad-hoc networks. In: Bouzeghoub, M., Goble, C.A., Kashyap, V., Spaccapietra, S. (eds.) ICSNW 2004. LNCS, vol. 3226, Springer, Heidelberg (2004)
Hara, T.: Effective replica allocation in ad hoc networks for improving data accessibility. In: INFOCOM 2001. Proc. of the 20th Joint Conf. of the IEEE Computer and Communications Societies, vol. 3, pp. 1568–1576. IEEE Computer Society Press, Los Alamitos (2001)
Yin, L., Cao, G.: Supporting cooperative caching in ad hoc networks. IEEE Transactions on Mobile Computing 5(1), 77–89 (2006)
Leggio, S., Miranda, H., Raatikainen, K., Rodrigues, L.: SIPCache: A distributed SIP location service for mobile ad-hoc networks. In: Proc. of the 3rd Conf. on Mobile and Ubiquitous Systems: Networks and Services (MOBIQUITOUS) (2006)
Miranda, H., Leggio, S., Rodrigues, L., Raatikainen, K.: A stateless neighbour-aware cooperative caching protocol for ad-hoc networks. DI/FCUL TR 05–23, Department of Informatics, University of Lisbon (2005)
Miranda, H., Leggio, S., Rodrigues, L., Raatikainen, K.: A power-aware broadcasting algorithm. In: PIMRC 2006. Proc. of The 17th IEEE Symp. on Personal, Indoor and Mobile Radio Communications, IEEE Computer Society Press, Los Alamitos (2006)
Johnson, D.B., Maltz, D.A.: Dynamic Source Routing in Ad Hoc Wireless Networks. In: Mobile Computing, pp. 153–181. Kluwer Academic Publishers, Dordrecht (1996)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Miranda, H., Leggio, S., Rodrigues, L., Raatikainen, K. (2007). An Algorithm for Dissemination and Retrieval of Information in Wireless Ad Hoc Networks. In: Kermarrec, AM., Bougé, L., Priol, T. (eds) Euro-Par 2007 Parallel Processing. Euro-Par 2007. Lecture Notes in Computer Science, vol 4641. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74466-5_96
Download citation
DOI: https://doi.org/10.1007/978-3-540-74466-5_96
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74465-8
Online ISBN: 978-3-540-74466-5
eBook Packages: Computer ScienceComputer Science (R0)