hybrid contention-based geographie routing in wireless sensor networks
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.
hybrid contention wireless sensor networks beaconless geographic routing aggressive non-aggressive