학술논문

Customizing GPSR for wireless sensor networks
Document Type
Conference
Source
2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975) Mobile ad-hoc and sensor systems Mobile Ad-hoc and Sensor Systems, 2004 IEEE International Conference on. :549-551 2004
Subject
Communication, Networking and Broadcast Technologies
Computing and Processing
Components, Circuits, Devices and Systems
Signal Processing and Analysis
Wireless sensor networks
Routing protocols
Computer science
Information retrieval
Energy efficiency
Computer networks
Wireless application protocol
Costs
Delay
Network topology
Language
Abstract
Several problems are required to be fixed in order to apply the geographical routing protocol greedy perimeter stateless routing (GPSR) in wireless sensor networks. First, GPSR is designed under the assumption of symmetric links (i.e., bidirectional reachability) which is not realistic for many practical sensor networks. Second, in sensor networks, packet destinations are often marked with locations instead of identifiers like IP address and therefore packets are routed to the home node which is the node geographically closest to the destined location. GPSR is not efficient in identifying the home node when the target location is outside the exterior perimeter of the sensor network. Third, due to the dynamic nature of sensor networks, maintaining data consistency, that is, data retrieved from the home node for a location should be consistent with the data sent to the same location, becomes a challenge when home nodes change. We propose on-demand GPSR (OD-GPSR), a data driven geographical routing protocol customized for sensor networks with solutions to the above three problems. Simulation results show that OD-GPSR performs well in terms of energy efficiency and packet delivery rate at the cost of a little more packet delivery delay.