Abstract
In ad hoc networks, it is effective that each mobile host creates replicas of data items held by other mobile hosts for improving data accessibility. In our previous work, we assumed an environment where data items are updated and proposed two updated data dissemination methods which efficiently update old replicas. In these methods, the communication traffic is large since every mobile host necessarily requests updated data items when it knows that its own replicas are old. In this paper, we propose an updated data dissemination method exploiting an epidemic model, which is a popular bio-inspired approach, for reducing the communication traffic. In our proposed method, mobile hosts disseminate invalidation reports and discard old replicas when a mobile host updates a data item or when two mobile hosts are connected with each other. Each mobile host which discards an old replica requests the updated data item with a certain probability. We also present simulation results to evaluate the performance of our proposed method.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Broch, J., Maltz, D.A., Johnson, D.B., Hu, Y.C., Jetcheva, J.: A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols. In: Proc. of MobiCom 1998, pp. 85–97 (1998)
Datta, A., Quarteroni, S., Aberer, K.: Autonomous Gossiping: A Self-Organizing Epidemic Algorithm for Selective Information Dissemination in Wireless Mobile Ad-Hoc Networks. In: Bouzeghoub, M., Goble, C.A., Kashyap, V., Spaccapietra, S. (eds.) ICSNW 2004. LNCS, vol. 3226, pp. 126–143. Springer, Heidelberg (2004)
Diekmann, O., Heesterbeek, J.A.P.: Mathematical Epidemiology of Infectious Diseases: Model Building, Analysis and Interpretation. Wiley Series in Mathematical and Computational Biology (2000)
Hara, T.: Effective Replica Allocation in Ad Hoc Networks for Improving Data Accessibility. In: Proc. of IEEE Infocom 2001, pp. 1568–1576 (2001)
Hara, T., Murakami, N., Nishio, S.: Replica Allocation for Correlated Data Items in Ad-Hoc Sensor Networks. ACM SIGMOD Record 33(1), 38–43 (2004)
Hayashi, H., Hara, T., Nishio, S.: Cache Invalidation for Updated Data in Ad Hoc Networks. In: Meersman, R., Tari, Z., Schmidt, D.C. (eds.) CoopIS 2003, DOA 2003, and ODBASE 2003. LNCS, vol. 2888, pp. 516–535. Springer, Heidelberg (2003)
Hayashi, H., Hara, T., Nishio, S.: Updated Data Dissemination in Ad Hoc Networks. In: Baresi, L., Dustdar, S., Gall, H.C., Matera, M. (eds.) UMICS 2004. LNCS, vol. 3272, pp. 29–43. Springer, Heidelberg (2004)
Johnson, D.B.: Routing in Ad Hoc Networks of Mobile Hosts. In: Proc. of Int’l Workshop on Mobile Computing Systems and Applications (WMCSA 1994), pp. 158–163 (1994)
Khelil, A., Becker, C., Tian, J., Rothermel, K.: An Epidemic Model for Information Diffusion in MANETs. In: Proc. of Int’l Workshop on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM 2002), pp. 54–60 (2002)
Lindemann, C., Waldhorst, O.P.: Consistency Mechanisms for A Distributed Lookup Service Supporting Mobile Applications. In: Proc. of ACM Int’l Workshop on Data Engineering for Wireless and Mobile Access (MobiDE 2003), pp. 61–68 (2003)
Perkins, C.E., Royer, E.M.: Ad Hoc on Demand Distance Vector Routing. In: Proc. of IEEE Int’l Workshop on Mobile Computing Systems and Applications (WMCSA 1999), pp. 90–100 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hayashi, H., Hara, T., Nishio, S. (2006). On Updated Data Dissemination Exploiting an Epidemic Model in Ad Hoc Networks. In: Ijspeert, A.J., Masuzawa, T., Kusumoto, S. (eds) Biologically Inspired Approaches to Advanced Information Technology. BioADIT 2006. Lecture Notes in Computer Science, vol 3853. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11613022_25
Download citation
DOI: https://doi.org/10.1007/11613022_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31253-6
Online ISBN: 978-3-540-32438-6
eBook Packages: Computer ScienceComputer Science (R0)