基于K中心的无线传感器网络路由协议

A Routing Protocol of Wireless Sensor Networks Based on K-Center

摘要: WSN分簇路由协议具有可扩展的特点，适合于大规模的WSN应用。由于簇首负担较重，簇首分布是影响无线传感器网络性能的关键因素。在随机型的簇首选择算法中，簇首的分布和簇内节点到簇首的距离难以有效控制，不平衡的能耗导致节点过早退出，缩短网络的生命周期。针对簇首的优化选择问题，本文通过K中心的近似算法来挑选簇头，使簇内节点到簇首的距离接近最优。K中心的算法运行时需要一个K值，本文借鉴LEACH协议动态轮转簇头的思路，实现了K中心数量自适应的动态生成。仿真结果表明提出的基于K中心的传感器网络路由协议能有效地延长网络的生命周期。

Abstract: WSN clustering routing protocol has the advantage of good scalability, and is suitable for large-scale applications. As cluster heads are heavy-loaded, their distribution has a great impact on network performance. For randomized clustering algorithm, it is difficult to control cluster heads’ distribution and distance between nodes and cluster heads. Unbalanced energy consumption leads to unavailable nodes and shortens network life cycle. In view of cluster heads selection problem, this pa-per presents a cluster head selection scheme based on the K-center, which controls distance be-tween nodes and cluster heads approximate optimally. K-center algorithm takes as input a parameter K. We use the cluster head rotation mechanism to generate a K value. The final simulation result shows that the proposed WSN routing protocol based on K-center can effectively extend net-work life cycle.