Towards practical and resilient geometric routing for wireless sensor networks
Nael Abu‐Ghazaleh, Ke Liu · 2008
Stateless routing protocol, based on geometric routing principles, have been proposed for Wireless Sensor Networks (WSNs). Such protocols use node locations to provide geometric navigation between a source and destination. This property is quite attractive to WSNs which are both resource limited and dynamic in nature. However, geometric routing protocols suffer a number of performance and security issues that limit their utility as general protocols. Routing on virtual coordinate systems (VCS) was proposed to overcome the problems of geographic routing. On the surface, VCS appears to overcome the two main problems with geographic routing, physical voids and vulnerability to location errors. But VCS suffers its own set of problems, leading to typical success rates significantly lower than those of geographical routing in a standard VCS implementation. In addition, the standard algorithms for bridging physical voids cannot be used to bridge VCS voids. The primary goal this research is isolating, characterizing and addressing the underlying reasons for the performance and security issues in geometric routing. First, the dissertation analyzes anomalies in VCS, and discovers the reason for them. Based on the analysis of virtual anomalies, we discover that virtual anomalies occur for different reasons (and at different locations) than physical anomalies. We propose HGR and SPGR as complementary routing. SPGR is both stateless and delivery guaranteed. SPGR outperforms all existing complementary routing algorithms such as perimeter routing of GPSR in terms of path quality, and is guaranteed to be successful. Most existing research work on geometric routing concentrates on how to improve the complementary routing. The greedy forwarding as the major part affecting the routing performance was ignored. We propose the aligned virtual ordinate systems (AVCS) to improve the greedy forwarding. The performance of the AGSP is not only better than all other geometric routing protocols on virtual coordinate system, but also outperforms GPSR. Finally, we also propose solution for location based attacks mostly to the geometric routing, as well as solutions to forwarding based attacks. Together, the contributions of this dissertation result in a highly efficient, robust, and secure geometric routing for use in Wireless Sensor Networks.