期刊文献+

基于HD分簇算法的仿真设计

The Simulation and Design of Clustering Algorithm Based on HD Clustering
下载PDF
导出
摘要 针对最大连接度分簇算法的几个缺点,在成簇阶段引入新的簇分裂方案以及合并方案,采用样本统计地方法验证了分裂方案的收敛性;在簇维护阶段,运用加权的思想,根据场景不同,动态调整权重值,选举符合要求的节点作为备选簇首。根据上述改进,设计了一种新的分簇算法。仿真实验结果表明,新算法在网络拓扑稳定性及生命周期方面具有优势。 In this paper,considering several shortcomings of the maximum link degree clustering algorithm,in forming cluster stage,the technical of division and merger of clustering was used.The convergence of the division was proofed by sample statistics methods.During the clustering maintenance stage,considering the concept of weighing,the author selected the appropriate node as spare cluster-head.Based on above-mentioned improvement,a new clustering algorithm was designed.Simulation results show that the new algorithm has advantages in maintaining the network topology and extending the network life cycle.
出处 《微处理机》 2010年第2期68-70,74,共4页 Microprocessors
关键词 AD HOC网络 最大连接度分簇算法 簇分裂与簇合并 备选簇首 Ad Hoc network Maximum link degree clustering algorithm Division and merger of clustering Spare cluster-head
  • 引文网络
  • 相关文献

参考文献5

  • 1A Ephremides,J E Wieselthier,D J Baker.A Design Concept for Reliable Mobile Radio networks with frequency hopping signaling[A].Proceedings of IEEE[C],1987,75(1):56-73.
  • 2M Gerla,J.T.C.Tsai.Multicluster,mobile,multimedia radio network[J].Wireless Network,1995,1(3):255-265.
  • 3S Basagni.Distributed and Mobility-Adaptive Clustering for Multimedia Support in Multi-Hop Wireless Networks.Proceedings of Vehicular Technology Conference[J].VTC,1999:889-893.
  • 4T Ohta,et al.An Adaptive Multihop Clustering Scheme for Highly Mobile Ad Hoc Networks[J].Proc.7th IEEE International Symposium,On Autonomous Decentralized Systems (ISADS 2003),2003:293-300.
  • 5N Murakami,et al.Effective Division and Merger of the Autonomous Clustering Scheme for Highly Mobile Large Ad Hoc Networks[J].IEEE International Symposium,On Circuits and Systems (ISCAS 2005),2005(3):2967-2970.
;
使用帮助 返回顶部