Skip to Main Content
Geographic routing has been studied as an attractive approach due to its simplicity and scalability properties in routing for wireless sensor networks. The most influential geographic routing protocol is GPSR (Greedy Perimeter Stateless Routing) and many geographic routing protocols are based on greedy forwarding routing. However, large routing protocol overhead, less reliability for long link and long average end-to-end delay are still the problems for this type of geographic routing protocol. In this paper, we start with another perspective of geographic information and propose a novel geographic routing protocol, RGRP (Reactive Geographic Routing Protocol), which combines reactive routing mechanism and geographic routing. In our algorithm, reactive routing mechanism is used to reduce the packets for routing discovery and end-to-end delay. Furthermore, geographic routing is used to find the optimal path in multitudinous paths. Finally, we make experiments and comparison between RGRP and GPSR. Simulation results exhibit superior performance of our protocol.