针对现有无线传感器网络(WSNs)生命最大化算法能耗较高,迭代次数较多且多基于理想链路等问题,提出了高效的链路质量感知的分布式算法,将链路质量纳入节点负载的计算。对于待转换节点如何选择新父节点,提出了两种方法:不考虑跳数的方法和考虑跳数的方法。另外,提出了一种预测策略,预算待转换节点转换后新父节点的路径负载,若超过转换之前当前父节点的路径负载,则不转换到新父节点。该预测策略保证了节点的每次转换均使网络负载更均衡,从而有利于算法快速收敛。实验结果表明,所提算法在网络生命、能耗及收敛速度方面优于现有算法。
To solve the problems of high energy consumption, large number of iterations and unrealistic assumption of ideal link in the existing lifetime maximization algorithms in wireless sensor networks(WSNs), the efficient distributed link quality- aware algorithms were proposed, which took the link quality into account when calculated the load of a node. Two methods were proposed for a switching node to choose a new parent. One considered the hop count, and the other ignored the hop count. Furthermore, a prediction strategy was developed to predict the path load of the new parent assuming the switching node had switched to the new parent. If the predicted path load was greater than the path load of the current parent before switc- hing, then the switching node would not switch to the new parent. This prediction strategy made sure that each switching of node made the network more load-balanced, which results in faster convergence of the algorithm. The simulation results dem- onstrate that our algorithms outperform the existing algorithms in terms of network lifetime, energy consumption, and rate of convergence.