CAJ | 학술논문

通过提出节点竞争力的新定义和研究网络分簇拓扑控制过程中簇头选择的新策略，提出了一种基于节点竞争力的网络分簇拓扑控制算法APBCS。该算法以节点剩余能量的比值、节点之间的距离和邻居节点的密度作为竞争簇头的参数，采用分环的方式实现簇头间的多跳通信。仿真实验表明，APBCS算法与LEACH算法相比较分簇更均匀，簇头选择更合理，第一个死亡节点出现时间推迟了92%，与EBAPC算法相比较，第一个死亡节点出现时间推迟了4.6%，说明比较显著地延长了网络生命周期。
통과제출절점경쟁력적신정의화연구망락분족탁복공제과정중족두선택적신책략，제출료일충기우절점경쟁력적망락분족탁복공제산법APBCS。해산법이절점잉여능량적비치、절점지간적거리화린거절점적밀도작위경쟁족두적삼수，채용분배적방식실현족두간적다도통신。방진실험표명，APBCS산법여LEACH산법상비교분족경균균，족두선택경합리，제일개사망절점출현시간추지료92%，여EBAPC산법상비교，제일개사망절점출현시간추지료4.6%，설명비교현저지연장료망락생명주기。
This paper proposes a clustering algorithm named APBCS that based on affinity propagation. In APBCS clus-tering 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. Further-more, 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.