首页 | 本学科首页   官方微博 | 高级检索  
     检索      

Ad hoe网络按需加权分簇算法及其性能分析
引用本文:王钢,单琦,贾世楼,赵洪林.Ad hoe网络按需加权分簇算法及其性能分析[J].南京理工大学学报(自然科学版),2006,30(5):599-602.
作者姓名:王钢  单琦  贾世楼  赵洪林
作者单位:哈尔滨工业大学通信技术研究所,黑龙江哈尔滨150001
摘    要:该文在分析Ad hoc网络两种典型的分簇算法的基础上,综合考虑节点度,节点的能量和移动性等多方面因素,提出了1种适用于Ad hoc网络的按需加权分簇算法。采用按需策略作为簇结构的维护策略,提高了网络体系结构的稳定性,减少了计算和通信开销。仿真结果验证了此种分簇算法的优越性。

关 键 词:Ad  hoc网络  网络体系结构  分簇算法  稳定性
文章编号:1005-9830(2006)05-0599-04
收稿时间:2005-06-02
修稿时间:2006-06-18

On-demand Weighted Clustering Algorithm for Ad hoc Network and Its Performance Analysis
WANG Gang, SHAN Qi, JIA Shi-lou, ZHAO Hong-lin.On-demand Weighted Clustering Algorithm for Ad hoc Network and Its Performance Analysis[J].Journal of Nanjing University of Science and Technology(Nature Science),2006,30(5):599-602.
Authors:WANG Gang  SHAN Qi  JIA Shi-lou  ZHAO Hong-lin
Abstract:Two representative clustering algorithms for Ad hoc network is studied. Based on the consideration of several aspects including node degree, battery power and mobility, a novel on-demand weighted clustering algorithm for Ad hoc network is presented. The adoption of the on-demand strategy improves the stability of the network architecture and lowers the computing and communication costs. The simulation experiment verifies the better performance of this clustering algorithm.
Keywords:Ad hoc networks  network architecture  clustering algorithm  stability
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号