Ad Hoc网络中一种基于权值的分簇算法  

A Weight-Based Clustering Algorithm for Mobile Ad Hoc Network

作　　者：杨卫东[1] 周杰英[1] 张光昭[1] 

机构地区：[1]中山大学电子与通信工程系

出　　处：《中山大学学报（自然科学版）》2007年第5期5-9,共5页Acta Scientiarum Naturalium Universitatis Sunyatseni

基　　金：广州市科技攻关计划资助项目(2007Z3-D0271)

摘　　要：Ad Hoc网络是一种多跳的自组织网络,网络是由移动的节点组成。Ad Hoc网络的许多应用都依赖层次结构的支持,簇结构是Ad Hoc网络中应用最为广泛的层次结构,而这种层次结构的形成和维护依赖于某种分簇算法。提出了一种新的基于权值的分簇算法(NWBCA),该算法考虑了移动节点的最佳连接度和电池能量两个因素,通过对算法进行分析和仿真测试,证明了该算法的有效性。Ad Hoe network is a kind of multi-hop self-organizing network. The network is dynamic in nature due to the mobility of nodes. Many mobile ad hoe applications depend on the hierarchical structure, and clustering is the most popular method to impose a hierarchical structure in the mobile ad hoe networks. A novel weight-based clustering algorithm （NWBCA） is proposed with taking the ideal connectivity degree and battery power of mobile nodes into consideration. Analysis and simulation of the algorithm have been implemented and validity of the algorithm has been proved.

关 键 词：AD HOC网络 分簇算法 簇和簇头 权值 

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