On Computing Multi-Agent Itinerary Planning In Distributed Wireless Sensor Networks

The agent technology has been widely used in wireless sensor networks to perform data fusion and energy balancing. Existing multi-agent itinerary algorithms are either time-consuming, or too complicated to realize in reality. In this paper, we design a routing itinerary planning scheme for the multi-agent itinerary problem by constructing the spanning tree of WSN nodes. First, we build a multi-agent based distributed WSN (DWSN) model. Second, we present a novel routing itinerary algorithm named DMAIP, which can group all the sensor nodes into multiple itineraries for agents. We also extend DMAIP and design DMAIP-E, which can avoid long distance transmission in DMAIP. Our evaluation results demonstrate that our algorithms are better in the aspect of life cycle and energy consumption than the existing DWSN data collecting schemes.