Geographic Routing Algorithms In Wireless Sensor Networks

In the architecture of Wireless Sensor Networks (WSN), routing technology is a very important issue. Geographic Routing is becoming a hot issue in WSN because of its scalability, and there are many algorithms proposed in recent years. In this paper, we classify the geographic routing algorithms into three classes according existing algorithms: planarizing based algorithm, characteristic nodes based algorithm and topology based algorithms. We discuss concrete algorithms and analyze the performance, characters of them. Finally, we summary the current research work and point out the future research direction.Based on the detailed analysis of planarizing based geographic routing algorithms, we proposed a new algorithm. Instead of deleting crossing links to planar the topology as in GPSR, this algorithm complete it through transforming the 2-dimension networks to 3-dimension. Absolutely, this algorithm reduces the routing length comparing with GPSR. The result of the simulation shows that this algorithm guarantees the delivery ratio and reduces the routing length obviously.Then, we propose a new ant geographic routing according to the comparability of WSN and Nerve Network. The ant geographic routing does not need to planarizing the topology in the initial phase, which minimizes the initial cost. In addition, the ant geographic routing can guarantees the delivery ratio and routing length comparing with GPSR.