Dynamic mobile agent migration in Wireless Sensor Networks Online publication date: Wed, 06-Dec-2006
by Yingyue Xu, Hairong Qi
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 2, No. 1/2, 2007
Abstract: Computing paradigm plays an important and fundamental role in collaborative processing in Wireless Sensor Networks (WSN). The client/server based paradigm and the mobile agent based paradigm are two popular computing models used to facilitate collaboration among sensor nodes. We study the key problem of determining mobile agent itinerary for collaborative processing and models the Dynamic Mobile Agent Planning (DMAP) problem. We then present two itinerary planning algorithms with the goal of maximising the information extracted while keeping resource usage to a minimum. The ISMAP determines the itinerary before dispatching the mobile agent while the IDMAP algorithm selects the route on the fly. We design three metrics (energy consumption, network lifetime, and the number of hops) and use simulation tools to quantitatively measure the performance of different itinerary planning algorithms. Simulation results show considerable improvement over the ISMAP using the IDMAP itinerary algorithm.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook