摘要： 在分簇的无线传感器网络中，当簇头以多跳通信方式将数据传输至sink点时，越接近sink点的簇头过路数据负担越重，可能过早耗尽能量而导致传输失效，造成网络分割。该文提出一种不等规模节能分簇路由算法，通过限制成簇范围使接近sink节点的区域产生更多更小规模的簇。在分簇时形成源于sink节点的簇间跳数场，使数据经过最少的中间簇到达sink节点，并通过动态调整对下一跳簇的选择来平衡簇间负载。仿真结果表明，该算法延长了网络生命周期，有效降低了网络整体耗能。

关键词: 无线传感器网络, 不等规模分簇, 节能, 路由算法

Abstract: In clustered Wireless Sensor Networks(WSN), when cluster headers send data to sink node in multi-hop communication mode, the nearer to the sink node, the more routing data will be put on the headers. As a result, headers near the sink node will quickly lose their energy and lead to network-partitioning. Considering this problem, this paper proposes an unequal scaled energy-efficient clustering routing algorithm. In areas nearer to the sink node, more less scaled clusters is formed by limiting the cluster radius. At the same time, a gradient of hops of clusters from the sink node is formed. Data travels through least number of clusters before they get to sink node. It balances the loading among clusters by dynamically changing data’s next routing cluster. According to the simulation results, this algorithm can prolong the network’s lifetime and save the network’s energy.

Key words: Wireless Sensor Networks(WSN), unequal scaled clustering, energy-efficient, routing algorithm

中图分类号: 

• TP393