A genetic algorithm approach to multi-agent itinerary planning in wireless sensor networks

  • Authors:
  • Wei Cai;Min Chen;Takahiro Hara;Lei Shu;Taekyoung Kwon

  • Affiliations:
  • School of Computer Science and Engineering, Seoul National University, Seoul, Korea;School of Computer Science and Engineering, Seoul National University, Seoul, Korea;Department of Multimedia Engineering, Osaka University, Osaka, Japan;Department of Multimedia Engineering, Osaka University, Osaka, Japan;School of Computer Science and Engineering, Seoul National University, Seoul, Korea

  • Venue:
  • Mobile Networks and Applications - Special issue on Wireless and Personal Communications
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

It has been shown recently that using Mobile Agents (MAs) in wireless sensor networks (WSNs) can help to achieve the flexibility of over-the-air software deployment on demand. In MA-based WSNs, it is crucial to find out an optimal itinerary for an MA to perform data collection from multiple distributed sensors. However, using a single MA brings up the shortcomings such as large latency, inefficient route, and unbalanced resource (e.g. energy) consumption. Then a novel genetic algorithm based multi-agent itinerary planning (GA-MIP) scheme is proposed to address these drawbacks. The extensive simulation experiments show that GA-MIP performs better than the prior single agent algorithms in terms of the product of delay and energy consumption.