Finding Optimal Tour Length of Mobile Agent in Wireless Sensor Network
- Abstract
Recently, research interest has increased in the design, development, and deployment of mobile agent systems in a wireless sensor network (WSN). Mobile agent systems employ migrating codes to facilitate flexible application re- tasking, local processing, and collaborative signal and information processing. This provides extra flexibility, as well as new capabilities to WSNs in contrast to the conventional WSN operations based on the client-server computing model. The MA collects data when it is in the proximity of a sensor node. This can be an alternative to multihop forwarding of data when we can utilize node mobility in a sensor network. To be useful, a MA approach needs to minimize data delivery latency. The major part of our work is about how to find out the minimal tour length of Mobile Agent in the Network for collecting the data from the sensor nodes.
- Copyright
- © 2013, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - CONF AU - Anil Kumar Mahto AU - Ajay Prasad AU - Hemkumar D. AU - Prity Kumari PY - 2013/04 DA - 2013/04 TI - Finding Optimal Tour Length of Mobile Agent in Wireless Sensor Network BT - Proceedings of the Conference on Advances in Communication and Control Systems (CAC2S 2013) PB - Atlantis Press SP - 588 EP - 592 SN - 1951-6851 UR - https://www.atlantis-press.com/article/6392 ID - Mahto2013/04 ER -