Abstract
In ad hoc networks, since network division occurs frequently, it is effective to replicate data items. This paper proposes effective replica allocation methods in ad hoc networks where each data item is updated at irregular intervals. The proposed methods allocate replicas based on probability density functions of the update intervals of data items. Also, they invalidate replicas that have been updated with high probability because accesses to old replicas impose extra computational overhead and roll backs. As a result, the proposed methods not only improve data accessibility but also reduce the number of accessing old replicas.
Chapter PDF
Similar content being viewed by others
References
A.V. Aho, J.E. Hopcroft, and J.D. Ullman, “The Design and Analysis of Computer Algorithms,” Addison-Wesley, 1974.
T. Hara, “Effective replica allocation in ad hoc networks for improving data accessibility,” Proc. IEEE Infocom’01, pp. 1568–1576, 2001.
T. Hara, “Replica allocation methods in ad hoc networks with data update,” ACM-Kluwer Journal on Mobile Networks and Applications (MONET), vol. 8, no. 4, pp. 343–354, 2003.
T. Hara, N. Murakami, and S. Nishio, “Replica allocation for correlated data items in ad-hoc sensor networks,” SIGMOD Record, vol. 33, no. 1, pp. 38–43, 2003.
H. Hayashi, T. Hara, and S. Nishio, “Cache invalidation for updated data in ad hoc networks,” Proc. CoopIS’03, pp. 516–535, 2003.
H. Hayashi, T. Hara, and S. Nishio, “Updated data dissemination in ad hoc networks,” Proc. Int’l Workshop on Ubiquitous Mobile Information and Collaboration Systems (UMICS’04), pp. 29–43, 2004.
G. Karumanchi, S. Muralidharan, and R. Prakash, “Information dissemination in partitionable mobile ad hoc networks,” Proc. Symposium on Reliable Distributed Systems (SRDS’99), pp. 4–13, 1999.
S. Lim, W-C. Lee, G. Cao, and C.R. Das, “A novel caching scheme for internet based mobile ad hoc networks,” Proc. ICCCN’03, pp. 38–43, 2003.
J. Luo, J.P. Hubaux, and P. Eugster, “PAN: Providing reliable storage in mobile ad hoc networks with probabilistic quorum systems,” Proc. ACM MobiHoc’03, pp. 1–12, 2003.
K. Rothermel, C. Becker, and J. Hahner, “Consistent update diffusion in mobile ad hoc networks,” Technical Report 2002/04, Computer Science Department, University of Stuttgart, 2002.
F. Sailhan, and V. Issarny, “Cooperative caching in ad hoc networks,” Proc. Int’l Conf. on Mobile Data Management MDM’03, pp. 13–28. 2003.
K. Wang, and B. Li, “Efficient and guaranteed service coverage in partitionable mobile ad-hoc networks,” Proc. IEEE Infocom’02, vol. 2, pp. 1089–1098, 2002.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 International Federation for Information Processing
About this paper
Cite this paper
Hayashi, H., Hara, T., Nishio, S. (2005). Replica Allocation Considering Data Update Intervals in Ad Hoc Networks. In: Belding-Royer, E.M., Al Agha, K., Pujolle, G. (eds) Mobile and Wireless Communication Networks. MWCN 2004. IFIP International Federation for Information Processing, vol 162. Springer, Boston, MA. https://doi.org/10.1007/0-387-23150-1_12
Download citation
DOI: https://doi.org/10.1007/0-387-23150-1_12
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-23148-8
Online ISBN: 978-0-387-23150-1
eBook Packages: Computer ScienceComputer Science (R0)