论文部分内容阅读
本文研究m覆盖与连通的无线传感器网络中的节点调度问题,提出了一种两跳簇的概念,并在此基础上提出了一种新的节点调度算法.该算法可在不知道节点位置信息的情况下,将无线传感器网络中的所有节点较为均匀地指派到k(km)个不同的分组{0,1,...,k1}之中,且可同时保证每个分组中的节点具有全局连通性与较高的网络覆盖率.理论分析与实验结果表明,该算法具有比传统随机调度方法更好的节点调度性能,可更加有效地延长无线传感器网络的生命周期.
In this paper, the problem of node scheduling in m-coverage and connected wireless sensor networks is studied, and a concept of two-hop cluster is proposed. Based on this, a new node scheduling algorithm is proposed, , All the nodes in the wireless sensor network are more evenly assigned to k (km) different packets {0,1, ..., k1}, and at the same time, it is guaranteed that the nodes in each group have Global connectivity and high network coverage.Theoretical analysis and experimental results show that this algorithm has better node scheduling performance than traditional stochastic scheduling methods and can extend the life cycle of wireless sensor networks more effectively.