Research On Routing Algorithms In Wireless Sensor Networks

In Wireless sensor network, the design of its routing algorithms faces many challenges due to limitations in nodes' energy, processing ability and transmission ability. The main objective of an excellent routing algorithm is to reduce the energy consumption of all nodes as much as possible to maximize the lifetime of the whole network. Also, the energy consumption among nodes should be distributed evenly to improve network's stability. In this paper, we studied the unique characteristics of Wireless Sensor Network and many existing routing algorithms. Then we abstracted the integrated model of the network, as well as the main aim of a routing algorithm in wireless sensor networks, that is, the energy status of all nodes and quality of the corresponding links between nodes can be described by a symmetry matrix, the most ideal routing algorithm will maximize nodes' mean lifetime and minimize their deviation. We have brought out an algorithm of network topology detection. Then, based on this network topology, we proposed two routing algorithms with fixed transmitting power and with adaptive transmitting power respectively. We have also brought out a concept of sensing intensity to describe the node distribution density in its sensing area. Then combined with nodes' energy status, a distributing routing algorithm called priority-based and coverage aware routing algorithm is proposed and analyzed particularly. In this routing algorithm, energy consumption is more evenly distributed among nodes. Also, the deviation of the number of cluster-head nodes is reduced. Simulations on these proposed algorithms as well as some existing algorithms were completed with C++ programming language under Visual C++ 6.0 environment to verify their validity. Based on the analysis of the simulation results, we got many constructive suggestions on routing mechanisms in wireless sensor network.