基于相对移动性预测的k跳AdHoc网络分簇算法  

Relative Mobility Prediction Based k-Hop Clustering Algorithm in AdHoc Networks

作　　者：孟洛明[1] 江彦馥 刘彦君 苏汉 徐思雅[1] 亓峰[1] MENG Luoming;JIANG Yanfu;LIU Yanjun;SU Han;XU Siya;QI Feng(State Key Laboratory of Networking and Switching Technology,Beijing University of Posts and Telecommunications,Beijing 100876,China;State Grid Hebei Electric Power Company,Shijiazhuang 050021,China)

机构地区：[1]北京邮电大学网络与交换技术国家重点实验室,北京100876 [2]国网河北省电力有限公司,石家庄050021

出　　处：《电子与信息学报》2018年第12期2954-2961,共8页Journal of Electronics & Information Technology

基　　金：国家自然科学基金(61702048)~~

摘　　要：针对网络节点随机移动造成的AdHoc网络分簇结构变化和路由失效问题,该文提出一种基于相对移动性预测的k跳分簇算法,分析和预测网络节点运动状态,自适应地调整分簇结构,提高簇结构稳定性。首先,使用多普勒频移计算节点间相对移动速度,预测节点移动性,得到节点间链路保持时间。然后,在簇形成阶段,采用面向节点稳定性的MAX-MIN启发式算法,根据节点的平均链路保持时间对簇首进行选择。进而,在簇保持阶段,提出一种基于节点运动状态的网络自适应调整算法,一方面调整节点信息数据发送周期以平衡数据开销和精确度,另一方面通过预测节点间链路通断情况调整分簇结构,以减少链路失效时的链路重建时间,提高网络运行质量。仿真实验表明,所提算法可以有效延长簇首持续时间,提高簇结构在动态环境下的稳定性。To solve the problem of network structure change and route failure caused by random movement of network nodes, a relative mobility prediction based k-hop clustering algorithm is proposed, the movement of nodes are analyzed and predicted, the cluster structure is adjusted adaptively, the stability of cluster structure is improved. First, the Doppler shift is used to calculate the relative moving speed and obtain the link expiration time between nodes. Then, during the cluster formation stage, the MAX-MIN heuristic algorithm is used to select the cluster head according to the average link expiration time of the node. Furthermore, during the cluster maintenance stage, a network adaptive adjustment method is proposed based on node motion. On the one hand, the node information transmission cycle is adjusted to balance the data overhead and accuracy; On the other hand, the cluster structure is adjusted by predicting the link disconnection to reduce link reconstruction time and improve the quality of network operation. Simulation results show that the proposed algorithm can effectively prolong the duration of cluster head and improve the stability of cluster structure in dynamic environment.

关 键 词：ADHOC网络 分簇 移动性预测 多普勒频移 MAX—MIN算法 

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