Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Computer Engineering and Design》 2010-01
Add to Favorite Get Latest Update

Variable degree clustering algorithm based on neighbor table changing

GUO Hong,JIN Xin,LIU Luo-kun(Department of Communication Engineering,Institute of Information Engineering,PLA Information Engineering University,Zhengzhou 450002,China)  
Ad Hoc networks’scalability issue has drawn a significant amount of research interests at present.When the size of network is bigger,the hierarchical architecture is introduced.How to keep rationally clustering is the key work of bigger mobile Ad Hoc network,it can help Ad Hoc network to carry out hierarchical network structure and clustering algorithm.According to the core work,a variable degree clustering algorithm is proposed based on a neighbor table changing on the basis of analyzing the changed times of link via average speed.The simulation result shows that the cluster deduced by this algorithm is better than the classical clustering algorithm in the aspects of stability and load-balancing.
【Fund】: 国家863高技术研究发展计划基金项目(2007AA01Z2a1)
【CateGory Index】: TN929.5
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved