loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Second IEEE Annual Conference on Pervasive Computing and Communications Workshops
A Dynamic Adaptive Replica Allocation Algorithm in Mobile Ad Hoc Networks
Orlando, Florida
March 14-March 17
ISBN: 0-7695-2106-1
Zheng Jing, National University of Defense Technology, Changsha, China
Wang Yijie, National University of Defense Technology, Changsha, China
Lu Xicheng, National University of Defense Technology, Changsha, China
Yang Kan, National University of Defense Technology, Changsha, China
In mobile ad hoc networks (MANET), nodes move freely and the distribution of access requests changes dynamically. Replica allocation in such a dynamic environment is a significant challenge. In this paper, a dynamic adaptive replica allocation algorithm that can adapt to the nodes motion is proposed to minimize the communication cost of object access. When changes occur in the access requests of the object or the network topology, each replica node collects access requests from its neighbors and makes decisions locally to expand replica to neighbors or to relinquish the replica. The algorithm dynamically adapts the replica allocation scheme to a local optimal one. Simulation results show that our algorithms efficiently reduce the communication cost of object access in MANET environment.
Citation:
Zheng Jing, Wang Yijie, Lu Xicheng, Yang Kan, "A Dynamic Adaptive Replica Allocation Algorithm in Mobile Ad Hoc Networks," percomw, pp.65, Second IEEE Annual Conference on Pervasive Computing and Communications Workshops, 2004
Usage of this product signifies your acceptance of the Terms of Use.