| 摘要: |
| 鉴于当前无线自组织网络路由算法未充分考虑移动通信节点所处环境的地形地物与电波传播损耗之间的关系，提出基于场强等值线滑动窗的方法对节点自动分簇并建立分层树状路由的算法。场强等值线滑动窗考虑了移动节点的电波传播损耗对信号强度与节点能耗的影响。算法通过等场强窗口确定各簇的节点群，并依据节点群中各节点的综合通信参数的加权和选举簇头继而建立分层树状路由。所提出的路由算法具有自适应分簇、分层树状路由的特点。群内节点为对等关系，任何节点根据选举规则均可被选为簇头，并在此基础上建立分层树状路由。仿真对比实验显示，算法的端到端平均延迟比贪婪蚁群优化算法、按需距离向量路由协议和动态源路由协议方法分别提高了18.35%、50.80%和49.59%，与无中心多代理路由协议相比平均能耗下降4.78%，与贪婪蚁群算法相比吞吐量提高了31.63%。该算法可用于无中心通信网络、应急通信和战术通信网等节点位置快速变化的组网环境。 |
| 关键词: 移动通信 无线自组织网 路由协议 滑动窗 |
| DOI：10.20079/j.issn.1001-893x.240923001 |
|
| 基金项目:广东省教育厅新一代信息技术重点领域专项（2020ZDZX3036） |
|
| A Multilayer Clustering Equal Field Strength Sliding Window Routing Algorithm for Wireless Mobile Networks |
| DING Zuchun |
| (School of Industry，Guangzhou College of Technology and Business，Guangzhou 510850，China) |
| Abstract: |
| In view of the insufficient consideration of the relationship between terrain,land cover,and propagation loss in the current wireless ad hoc network routing algorithms,an algorithm based on electronic field strength contour sliding window is proposed to cluster communication nodes automatically and establish hierarchical treelike routing.The field strength contour sliding window considers the influence of propagation loss of mobile communication nodes on signal strength and node energy consumption.The node cluster is determined through the equal field strength window,and the cluster head is selected according to the weighted sum of the comprehensive communication parameters of each node in the node cluster,and then a hierarchical treelike routing is established.The proposed algorithm owns the characteristics of adaptive clustering and hierarchical treelike routing.The nodes within the cluster are in a peer-to-peer relationship,and any node can be voted as the cluster head according to the election principle,and then the hierarchical treelike routing is established.Comparative simulation experiments show that compared with that of the Greedy Ant Colony Optimization Algorithm,Ad Hoc On-Demand Distance Vector Routing(AODV) protocol,and Dynamic Source Routing(DSR) method，the end-to-end average delay of the proposed algorithm is improved by 18.35%,50.80% and 49.59% respectively,and the proposed method owns an average energy consumption decrease of 4.78% compared with the non-central multi-agent routing protocol,and a throughput increase of 31.63% compared with the Greedy Ant Optimization Algorithm.This algorithm can be applied in network with rapidly changing node position,such as decentralized communication network,emergency communication,and tactical communication network. |
| Key words: mobile communication wireless self-organization network routing protocol sliding window |
