一种改进的MANET加权分簇算法  

An Improved MANET Weighted Clustering Algorithm

作　　者：许向阳[1] 何鸿祥 XU Xiangyang;HE Hongxiang(School of Infomation Science and Engineering,Hebei University of Science and Technology,Shijiazhuang 050000,China)

机构地区：[1]河北科技大学信息科学与工程学院,河北石家庄050000

出　　处：《长江信息通信》2024年第6期89-91,共3页Changjiang Information & Communications

摘　　要：移动自组网(Mobile Ad Hoc Network, MANET)主要应用于军事活动、灾后救援等大规模的活动中,随着节点数的增加、移动速度的加快,网络拓扑变得更加复杂,网络稳定性和性能也随之下降。频繁的网络拓扑变化会导致簇结构变得不稳定并且控制开销也会增加。为了解决这一问题,提出了一种改进的加权分簇算法,通过仿真表明,该算法可以有效地提高大规模移动自组网的性能。Mobile Ad Hoc Network(MANET)is mainly used in large-scale activities such as military and disaster relief.With the increase in the number of nodes and the acceleration of movement speed,the network topology becomes more complex,and the stability and perform-ancc of the network also decrease.Frcqucnt changes in nctwork topology can lcad to unstable cluster structures and increased control overhead.To address this issue,an improved weighted clustering algorithm is proposed,and simulation results show that this algorithm can effectively improve the performance of large-scale mobile ad hoc networks.

关 键 词：移动自组网 网络拓扑 控制开销 加权分簇算法 

分 类 号：TN929.5[电子电信—通信与信息系统]