Energy efficient relay node fast selection algorithm for multi-hop wireless sensor networks
|更新时间:2024-10-14
|
Energy efficient relay node fast selection algorithm for multi-hop wireless sensor networks
Vol. 31, Issue 11, Pages: 158-170(2010)
作者机构:
1. 西安电子科技大学综合业务网理论和关键技术国家重点实验室
2. 西安电子科技大学信息科学研究所宽带无线通信实验室
3. 河南科技大学电子信息工程学院
4. 河南科技大学车辆与动力工程学院
作者简介:
基金信息:
DOI:
CLC:TN929.5;TP212.9
Published:2010
稿件说明:
移动端阅览
ZHENG Guo-qiang1, LI Jian-dong1, LI Hong-yan1, et al. Energy efficient relay node fast selection algorithm for multi-hop wireless sensor networks[J]. 2010, 31(11): 158-170.
DOI:
ZHENG Guo-qiang1, LI Jian-dong1, LI Hong-yan1, et al. Energy efficient relay node fast selection algorithm for multi-hop wireless sensor networks[J]. 2010, 31(11): 158-170.DOI:
Energy efficient relay node fast selection algorithm for multi-hop wireless sensor networks
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.