In this paper, we propose an improvement of our previous protocol for geographic routing in wireless sensor networks. The original protocol uses a combination of greedy forwarding and recovery strategies for route discovery. At the same time, shortcut paths are created and then each of these paths is gradually made shorter than the one preceding. | JOURNAL OF SCIENCE OF HNUE FIT. 2013 Vol. 58 pp. 150-156 This paper is available online at http MORE EFFICIENT PATH OPTIMIZATION FOR GREEDY GEOGRAPHIC ROUTING IN WIRELESS SENSOR NETWORKS Le Dinh Thanh1 Ho Thuan2 Nguyen Dai Tho1 1 VNU University of Engineering and Technology 2 VAST Institute of Information Technology 1 E-mail thanhld@. Abstract. In this paper we propose an improvement of our previous protocol for geographic routing in wireless sensor networks. The original protocol uses a combination of greedy forwarding and recovery strategies for route discovery. At the same time shortcut paths are created and then each of these paths is gradually made shorter than the one preceding. The scope of destinations is extended from a point to an area. The current work further enlarges the destination areas specified in the routing tables. Extensive simulation results show that the upgraded protocol is more efficient than the previous one. Keywords Path optimization geographic routing wireless sensor networks. 1. Introduction Geographic routing a combination of greedy forwarding 1 and recovery routing 2 7 is particularly suitable to resource-constrained wireless sensor networks. Both greedy forwarding and recovery routing can be lightweight in the sense that only information on the position of neighboring nodes is maintained at each node. Although existing geographic routing protocols can be very efficient and scalable in dense networks they generally do not perform well in the presence of holes that represent obstacles to communication. Recently we proposed GPOR a greedy with path optimization protocol for geographic routing in wireless sensor networks 11 . GPOR deals with the problem of nearly optimal path discovery by using a novel shortcut creation mechanism for early detection and avoidance of obstacles. The scope of destinations in the routing tables refers to an area instead of a point as usually the case in traditional routing. The .
