Hybrid contention-based geographie routing in wireless sensor networks

Authors:
Thanh Le Dinh;Dai Tho Nguyen;Ho Thuan
Affiliations:
University of Engineering and Technology, VNU-HN, Xuan Thuy, Cau Giay, Hanoi, Vietnam;University of Engineering and Technology, VNU-HN, Xuan Thuy, Cau Giay, Hanoi, Vietnam;Institute of Information Technology, VAST, Hoang Quoc Viet, Cau Giay, Hanoi, Vietnam
Venue:
Proceedings of the Second Symposium on Information and Communication Technology
Year:
2011

Citing 5
Cited 0

GPSR: greedy perimeter stateless routing for wireless networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Routing with guaranteed delivery in ad hoc wireless networks

Wireless Networks
Locating and bypassing holes in sensor networks

Mobile Networks and Applications
No-Beacon GEDIR: Location-Based Ad-Hoc Routing with Less Communication Overhead

ITNG '07 Proceedings of the International Conference on Information Technology
Pizza Forwarding: A Beaconless Routing Protocol Designed for Realistic Radio Assumptions

SENSORCOMM '10 Proceedings of the 2010 Fourth International Conference on Sensor Technologies and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Beaconless and contention-based geographic routing is an attractive approach to resource-constrained wireless sensor networks. Aggressive contention is the most cost-efficient form of contention-based geographic routing since it uses no control packet. Nevertheless, to avoid duplicated data packets, aggressive contention must set restriction on the contention area. Consequently, its packet delivery rate is limited. On the other hand, non-aggressive contention maximizes packet delivery rate by making use of full contention area. As the compensation, control packets have to be used and additional delay is introduced. In this paper, we propose Hybrid Contention-Based Geographic Routing (HCGR) - a protocol that takes full aggressive contention and uses non-aggressive contention for recovering aggressive contention from failure. If aggressive contention succeeds, nonaggressive contention is suppressed. In cases where aggressive contention fails, non-aggressive contention is taken place to deliver data packets. Thus, HCGR can maximize packet delivery rate while keeping its overheads reasonably low. We implement HCGR and single-form protocols in the network simulator ns-2, conduct extensive simulations and present simulation results.