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. © IFIP International Federation for Information Processing 2005.
CITATION STYLE
Wang, Y., & Kan, Y. (2005). Research of survival-time-based dynamic adaptive replica allocation algorithm in mobile ad hoc networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3779 LNCS, pp. 503–510). Springer Verlag. https://doi.org/10.1007/11577188_71
Mendeley helps you to discover research relevant for your work.