Itinerary Planning for Energy-Efficient Agent Communications in Wireless Sensor Networks
Compared with conventional Wireless Sensor Networks (WSNs) operating based on the client - server computing model, Mobile Agent (MA)-based WSNs can facilitate agent-based data aggregation and energy-efficient data collection. In MA systems, it has been known that finding the optimal itinerary of an MA is Non-deterministic Polynomial-time hard (NP-hard) and is still an open area of research. In this paper, the authors consider the impact of both data aggregation and energy efficiency in itinerary selection. They first propose the Itinerary Energy Minimum for First-source-selection (IEMF) algorithm. Then, the Itinerary Energy Minimum Algorithm (IEMA), which is the iterative version of IEMF, is described.