多跳无线传感器网络的高效中继节点快速选择算法

Energy efficient relay node fast selection algorithm for multi-hop wireless sensor networks

针对多跳无线传感器网络数据收集协议中继转发节点选择算法效率不高的问题,提出了一种能量有效的中继节点快速选择(EERNFS)算法。EERNFS算法利用分时共享信道的方法维护网络同步和更新节点的邻居信息,使节点在每个网络侦听/睡眠周期依赖一定的概率同步激活唤醒,确保了网络节点瞬时连通度的稳定和一致;基于网络节点的地理优先级、节点价值和链路质量的分布式估计,EERNFS算法采用竞争的方法选择中继转发节点,使用乘性增加时间窗口的方法,分解候选中继节点间的竞争。理论分析和模拟实验结果表明,EERNFS算法在能效、数据传递的平均时延、分组到达率等网络性能指标上显著优于FFS和GeRaF算法,极大地延长了网络的寿命。

Aiming at the inefficiency of the relay selection of data gathering protocol for multi-hop wireless sensor networks（WSN）,an energy efficient relay node fast selection（EERNFS） algorithm was proposed.In EERNFS,time-sharing channel was adopted to maintain time synchronization of WSN and periodically update the information of the neighbor network node.The network nodes could be activated synchronously in any network listening/sleeping cycle according to a certain probability,thus the real-time consistency and the stability of the nodes’ connectivity degree in WSN were guaranteed.Based on the geographic priority,the value of the nodes and the distribution estimation of the route-link quality,the relay node was selected through the competition method and the competing between the candidate relay nodes was reduced through gradually multiplying time window method.Theoretical analysis and simulation results show that EERNFS outperforms FFS（forwarder fast selection） and GeRaF in terms of energy efficiency,delay of data delivery,and data delivery rate so that the network lifetime is greatly prolonged.