自组网络的分簇算法  

Clustering Algorithms in Ad Hoc Networks

作　　者：孙雨耕[1] 王瑞丰[1] 杨挺[1] 

机构地区：[1]天津大学电气与自动化工程学院,天津300072

出　　处：《天津大学学报（自然科学与工程技术版）》2005年第8期711-716,共6页Journal of Tianjin University：Science and Technology

基　　金：教育部博士学科点基金资助项目(20030056007).

摘　　要：当自组网络(ad hoc)的规模增大时,控制分组在网络中的传输急剧增多,这大大降低了路由和转发的性能.分簇是提高ad hoc网络可扩展性的重要手段.针对已有分簇算法的缺陷以及静态和动态ad hoc网络的特性,分别提出了新的静态分簇算法SACA和动态分簇算法DACA.其中SACA算法将分簇数量减小到已有算法的大约一半,但不增加簇成员数量,提高了分簇效率,减少了分簇时间;DACA算法将簇间的公共节点数目大大降低,从而有效降低了分簇结构的维护开销,提高了网络运行的效率、路由和转发性能.As the scale of ad hoc network enlarges, control packets will sharply increase, thus routing/forwarding performance will be greatly decreased. Clustering is an efficient way to raise the extensibility of ad hoc networks. Two clustering algorithms, SACA for static ad hoc networks and DACA for dynamic networks, were proposed. SACA reduced the number of clusters by half without increasing the number of cluster members, so clustering efficiency was improved and clustering time was saved. DACA evidently decreased the number of common neighbor clusters, thus effectively lowering maintenance cost and improving routing and transferring performance.

关 键 词：自组网络 分簇 簇头 扩展性 算法 

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