Fast Progress-Based Routing in Sensing-Covered Networks
Fast Progress-Based Routing in Sensing-Covered Networks
复制标题
传感覆盖网络中基于快速进度的路由
DOI：
10.1109/glocom.2008.ecp.1023
复制
发表时间：
2008
期刊：
影响因子：
--
通讯作者：
A. Abdallah
中科院分区：
文献类型：
--
作者：
Tarek El Salti;T. Fevens;A. Abdallah
感知覆盖网络是指地理区域中的每一个点都被至少一个传感器节点的感知范围覆盖的无线传感器网络。针对这种2-D感知覆盖的网络拓扑上的路由问题，提出了一种新的基于贪婪转发类型的进度路由协议GC 2，以及一种基于GC 2和Xing等人（2006）的BVGF路由协议的更快简化版本SCL的混合路由算法SCL：GC 2。这两种算法都可以保证在传感覆盖的网络上进行传输，即使平均节点度因自适应Yao子图上的路由而降低。我们通过模拟证明，GC 2提高了贪婪转发的性能，SCL：GC 2发现的路径的平均长度接近BVGF，同时执行显着减少昂贵的计算。
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.