Improved Round Routing Algorithm Based on Area Covering of Wireless Sensor Network

Abstract

An optimization model is set up for the area covering and routing problem of Wireless Sensor Network(WSN). Two quasi-physical and quasi-sociological methods are designed for the problem, They are quasi-gravitation model and quasi-coulomb force model. Based on the Area Covering, Round Routing Method is proposed, which transfers into TSP problem. Restriction of window ant colony algorithm carry out the optimum route plan, Optimum touring route are obtained based on two-dimensional interpolation location estimation of point heat source. The simulation result shows that WSN can achieve an optimizing routing by a random initial covering and self-organized solution in regard to a target area with complex boundary.