An Intelligent Agent Routing over Wireless Sensor Networks

This paper studies the routing problem in wireless sensor networks. Since the energy of a wireless sensor node is limited and recharging is difficult, while designing the routing protocol, saving energy is a primary concern. This paper proposes a routing scheme, denoted as intelligent agent routing for wireless sensor networks, which adopts the basic structure of agent routing mainly, to set up an abstract tree structure, where the data center is the root. When an event happens, the information can be passed back to the data center through the tree structure. Multiple agents´ concept is also proposed to shorten the setup time of routing structure. Since multiple agents develop many ways of routes, they can shorten the length of routes, save the cost of message passing. In addition, a flexible-agent, capable of dynamically determining the number of agents according to the sensors´ distribution, is also proposed. A shortcut mechanism is also designed for the intelligent agent routing to further reduce the routing length. The simulation results show that the intelligence agent routing obtains better performance in terms of the completing time, average length of route, and coverage rate. Among multiple agent schemes, the flexible-agent obtains the best performance