论文部分内容阅读
能量高效是无线传感器网络中的关键问题之一.提出一种基于最小跳数的分簇路由算法,算法优化了HEED算法中簇头的选择策略,此外,算法中节点根据其邻节点的广播信息计算最小跳数,在下一跳节点的选择过程中考虑了候选节点到基站的最小跳数、节点的能量以及节点到基站的距离,并在不同情况下令三个因素所起的作用不同,进而提高路由效率.最后将所提出算法与现有路由算法进行了对比,理论分析与Matlab模拟实验结果表明,所提出的最小跳数路由算法适用于大规模的无线传感器网络,在降低节点能量耗费的同时,延长了网络的生存周期.
Energy efficient is one of the key problems in wireless sensor networks.This paper proposes a clustering routing algorithm based on minimum hop count, which optimizes the selection strategy of cluster heads in HEED algorithm. In addition, The minimum hop count is calculated. The minimum number of hops from candidate node to base station, the energy of the node and the distance from the base station to the base station are considered during the selection of the next hop node, and the roles played by the three factors are different in different situations, thereby increasing Finally, the proposed algorithm is compared with the existing routing algorithm. The theoretical analysis and Matlab simulation results show that the proposed minimum hop routing algorithm is suitable for large-scale wireless sensor networks. While reducing the energy consumption of nodes, , Extending the life cycle of the network.