Abstract
Power conservation and extending survival time are critical issues in mobile ad hoc networks, as the nodes are powered by battery only. In this paper, according to the mobility of nodes, the survival-time-based adaptive replica allocation algorithm is proposed. In the survival-time-based dynamic adaptive replica allocation algorithm, based on the locality of data access, the replica allocation scheme is adjusted regularly in order to reduce the power consumption, and thus extend the survival time of network. The relation between mobility models and efficiency of survival-time-based dynamic adaptive replica allocation algorithm is studied. The results of performance evaluation show that the survival-time-based dynamic adaptive replica allocation algorithm can reduce the total power consumption of network greatly and extend the survival time of network evidently.
This work is supported by the National Grand Fundamental Research 973 Program of China (No.2002CB312105), A Foundation for the Author of National Excellent Doctoral Dissertation of PR China (No.200141), and the National Natural Science Foundation of China (No.69903011, No.69933030).
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
Gruenwald, L., Javed, M., Gu, M.: Energy-Efficient Data Broadcasting in Mobile Ad-Hoc Networks. In: Proc. International Database Engineering and Applications Symposium (IDEAS 2002) (July 2002)
Hara, T.: Effective Replica Allocation in Ad hoc Networks for Improving Data Accessibility. In: Proceeding of IEEE Infocom 2001, pp. 1568–1576 (2001)
Hara, T.: Replica Allocation in Ad hoc Networks with Periodic Data Update. In: Proceedings of Int’l Conference on Mobile Data Management (MDM 2002), pp. 79–86 (2002)
Hara, T.: Replica Allocation Methods in Ad Hoc Networks with Data Update. Mobile Networks and Applications, MONET 8(4), 343–354 (2003)
Wang, K.H., Li, B.: Efficient and Guaranteed Service Coverage in Partitionable Mobile Ad-hoc Networks. In: IEEE Joint Conference of Computer and Communication Societies (INFOCOM ), pp. 1089–1098 (2002)
Huang, J.-L., Chen, M.-S., Peng, W.-C.: Exploring Group Mobility for Replica Data Allocation in a Mobile Environment. In: Proceedings of the 12th International Conference on Information and Knowledge Management, Database Session 3: Data Management in Mobile Environments, pp. 161–168 (2003)
Chen, K., Nahrstedt, K.: An Integrated Data Lookup and Replication Scheme in Mobile Ad Hoc Networks. In: Proceedings of SPIE International Symposium on the Convergence of Information Technologies and Communications (ITCom 2001), pp. 1–8 (2001)
Wolfson, O., Jajodia, S., Huang, Y.: An Adaptive Data Replication Algorithm. ACM Transactions on Database System 22(4), 255–314 (1997)
Camp, T., Boleng, J., Davies, V.: A Survey of Mobility Models for Ad Hoc Network Research. Wireless Communication & Mobile Computing (WCMC), Special Issue on Mobile Ad Hoc Networking 2(5), 483–502 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 IFIP International Federation for Information Processing
About this paper
Cite this paper
Wang, Y., Yang, K. (2005). Research of Survival-Time-Based Dynamic Adaptive Replica Allocation Algorithm in Mobile Ad Hoc Networks. In: Jin, H., Reed, D., Jiang, W. (eds) Network and Parallel Computing. NPC 2005. Lecture Notes in Computer Science, vol 3779. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11577188_71
Download citation
DOI: https://doi.org/10.1007/11577188_71
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29810-6
Online ISBN: 978-3-540-32246-7
eBook Packages: Computer ScienceComputer Science (R0)