Optimal itinerary planning for mobile multiple agents in WSN

Multi mobile agents based on data collection and aggregations have proved their effective in wireless sensor networks (WSN). However, the way in which these agents are deployed must be intelligently planned and should be adapted to the characteristics of wireless sensor networks. While most existing studies are based on the algorithms of itinerary planning for multiple agents i.e. determining the number of mobile agents (MAs) to be deployed, how to group source nodes for each MA, attributing the itinerary of each MA for its source nodes. These algorithms determine the efficiency or effectiveness of aggregation. This paper aims at presenting the drawbacks of these approaches in large-scale network, and proposes a method for grouping network nodes to determine the optimal itinerary based on multi agents using a minimum amount of energy with efficiency of aggregation in a minimum time. Our approach is based on the principle of visiting central location (VCL). The simulation experiments show that our approach is more efficient than other approaches in terms of the amount of energy consumed in relation with the efficiency of aggregation in a minimum time.

@article{BENDJIMA2012,
  title     = {Optimal itinerary planning for mobile multiple agents in WSN},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {3},
  number    = {11},
  year      = {2012},
  publisher = {The Science and Information Organization},
  author    = {Mostefa BENDJIMA and Mohamed FEHAM},
  doi       = {10.14569/IJACSA.2012.031103},
  url       = {https://doi.org/10.14569/IJACSA.2012.031103}
}