The Research On Routing Algorithms Based On Position Information For Wireless Sensor Networks

Wireless integrated sensor networks, which include collecting, managing data and communication, are used more and more widely for its low cost and convenient deployment. Nowadays the research concerning each aspect of sensor networks is fairly active. Routing is one of the key problems in sensor networks and this thesis mainly focuses on the routing algorithms based on position information.Sensor networks differ from traditional networks in several ways: sensor networks have severe energy constraints, redundant low-rate data, and many-to-one flows. Based on these characteristics, this thesis firstly analyzes some typical routing protocols in wireless sensor networks, and then puts forward a new routing algorithm which takes advantage of both data aggregation and routing angle based multi-path routings. In the algorithm, the source nodes only send data monitored to some aggregate source node, and then the aggregate node concentrates the information it received and sends a convergent packet to the Sink by multi-path. Theoretic analysis and simulation results show that the new algorithm helps saving nodes energy efficiently and has good routing performances. Considering that the current routing algorithms in sensor networks are designed to resolve how to save energy when all nodes are working, however, energy of nodes are wasted enormously, So a new routing algorithm combining the structure of grid with density-control is proposed in this thesis. The new algorithm just selects some nodes to work and others to sleep which will be wakened to replace dead nodes at appropriate time. Analysis and simulation results demonstrate that the new algorithm prolongs the time to live in some measure. Finally, this thesis proposes a new algorithm which combines the structure of grid with Trajectory-Based Forwarding algorithm. The algorithm constructs the suitable grid at first, then controls the number of working node to be only one, and the other nodes will stop working and sleep until the right time to wake up to replace the died working node, working nodes forward data with TBF subsequently. Theoretic analysis and simulation results indicate that the new algorithm achieves load balancing and provides better network performance.