Based On Target Tracking Mobile Agent Routing Algorithm In WSN

Wireless sensor network is the current international concern, multidisciplinary, highly integrated knowledge of the hot research area. It is a multidisciplinary which integrates sensor technology, embedded computing technology, modern network and wireless communication technology, distributed information processing technology and so on. Routing problem has been the focus of research in this field. Wireless sensor network's the limited energy, the limited communication capacity, multihop routing, dynamic topology, large number of nodes and the dense node distribution, all this characteristics decide that it needs a routing algorithm which could reduce the network energy consumption, prolong the network lifetime, balance the network load and adapt to dynamic changes in network topology.After this paper introduces the related knowledge of the wireless sensor network, detailedly describes and analyzes the process, advantages and disadvantages of the algorithm in several existing sensor network routing protocols. In recent years, because mobile agent technology was applied more widely in the wireless sensor network routing algorithm, this paper analyzes the possibility and advantages of the mobile agent applied in sensor network, a brief introduction of the mobile agent routing algorithm with the existing routing technology, meanwhile introduces a based on information-driven mobile agent routing algorithm. Although this algorithm considers the balance problem between information acquisition and energy consumption, for the movement of the target has not been fully estimated, which maybe lead to the deviation of the routing results. So for this problem, we propose a target tracking based mobile agent routing algorithm.The algorithm fully considers the movement of the target throughout the monitoring process, combining with target tracking and positioning technology to estimate the target in the current moment and the next moment these two locations, and using the estimated location of the next moment as the next hop standards, while also taking into the remaining energy of the sensor nodes and the cost of the mobile agent migration which could effectively achieves the balance between information acquisition and energy consumption. The paper also designs a cost function whose minimum could be a basis of the next hop routing node. Simulation results show that in a certain range of the target speed and the number of nodes, the algorithm's performance in the network energy consumption, network lifetime and node hops these three aspects are better than the original algorithm.Finally, we conclude the full paper's work, prospect the next step's research work and propose the focus and direction of the future research.