基于概率机制的涌现分簇算法  

Probabilistic Emergent Algorithm for Cluster Establishment

作　　者：冯涛[1] 瞿竞杰[1] 郭显[1] 

机构地区：[1]兰州理工大学计算机与通信学院,兰州730050

出　　处：《电子科技大学学报》2012年第4期574-579,共6页Journal of University of Electronic Science and Technology of China

基　　金：国家863项目(2007AA01Z429);国家自然科学基金(60972078);甘肃省高等学校基本科研业务费(0914ZTB186);甘肃省自然科学基金(2007GS04823);福建省高校重点实验室开放课题(09A006)

摘　　要：涌现分簇算法ACE是一类基于群体智能的移动Ad hoc网络分簇算法。针对ACE算法迭代中存在的问题,该文引入概率机制,提出了基于概率机制的涌现分簇算法(PACE)。该算法根据节点竞争簇头概率最高的局部信息,创建全局分簇网络,在概率相同的情况下,根据节点标识符来仲裁簇头选举,同时实现了单节点簇合并和失效恢复。理论分析和仿真结果表明,该算法收敛时间短,能够创建稳定且更优化的分簇结构,具备失效恢复能力。Emergent clustering algorithm ACE is one type of clustering algorithms based on swarm intelligence for mobile ad hoe networks. Aiming at the problems that exist during iterations in ACE, this paper introduces a probability mechanism and proposes a novel probability-based clustering algorithm named PACE. With the local information that the cluster head probability of nodes candidate is the highest, PACE can create a global clustering network. In the case of the same probability, the node identifier is used to arbitrate the elections of cluster heads. Meanwhile, the mergence of single node clusters and failure recovery can also be achieved by the strategies above. The theoretical analysis and simulation results show that PACE has a short convergence time, can fred a stable and more optimized clustering structure, and provides a capability of failure recovery.

关 键 词：分簇算法 涌现算法 移动AD HOC网络 概率涌现分簇算法 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]