Fast Progress-Based Routing in Sensing-Covered Networks
Tarek El Salti, Thomas Fevens, Alaa Eddien Abdallah · 2008
A sensing-covered network is a wireless sensor network where every single point in the geographic area is covered by the sensing range of at least one sensor node. For routing on such a 2-Dsensing-covered network topology, we propose a new greedy forwarding-type progress-based routing protocolGC2, as well as a hybrid routing algorithmSCL:GC2which is based onGC2and a faster simplified version of theBVGFrouting protocol of Xing et al (2006), called SCL. Both these algorithms guarantee delivery on sensing-covered networks, even when the average node degree is reduced by routing on an Adaptive Yao subgraph. We demonstrate through simulations thatGC2improves on the performance of greedy forwarding, and thatSCL:GC2finds paths with average lengths that are close to those forBVGFwhile performing significantly fewer expensive calculations.