基于节点竞争力的网络分簇拓扑控制算法

通过提出节点竞争力的新定义和研究网络分簇拓扑控制过程中簇头选择的新策略，提出了一种基于节点竞争力的网络分簇拓扑控制算法APBCS。该算法以节点剩余能量的比值、节点之间的距离和邻居节点的密度作为竞争簇头的参数，采用分环的方式实现簇头间的多跳通信。仿真实验表明，APBCS算法与LEACH算法相比较分簇更均匀，簇头选择更合理，第一个死亡节点出现时间推迟了92%，与EBAPC算法相比较，第一个死亡节点出现时间推迟了4.6%，说明比较显著地延长了网络生命周期。

Affinity propagation clustering algorithm based on node competing strength

This paper proposes a clustering algorithm named APBCS that based on affinity propagation. In APBCS clustering algorithm, a new definition called node competing strength is presented, the three parameters, i.e., the ratio of nodes residual energy, the distance of nodes and the neighbor nodes density, are considered to become the cluster heads. Furthermore, the algorithm uses a ring based multi-hop cluster heads communication. The simulation results show that, compared with LEACH algorithm the cluster head selection is better reasonable in APBCS algorithm, the time of first dead node has been delayed by ninety-two percent, compared with EBAPC algorithm the time of the first dead node has been delayed by four point six percent. As a result, the network lifetime is efficiently prolonged.