Fast Progress-Based Routing in Sensing-Covered Networks

Tarek El Salti, Thomas Fevens, Alaa Eddien Abdallah

Abstract: 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-D sensing-covered network topology, we propose a new greedy forwarding-type progress-based routing protocol GC2, as well as a hybrid routing algorithm SCL:GC2 which is based on GC2 and a faster simplified version of the BVGF routing 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 that GC2 improves on the performance of greedy forwarding, and that SCL:GC2 finds paths with average lengths that are close to those for BVGF while performing significantly fewer expensive calculations.