用于航空 ad-hoc 网络的分布式多跳聚类算法

IF 4.4 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Ad Hoc Networks Pub Date : 2024-05-23 DOI:10.1016/j.adhoc.2024.103547
Laiwei Jiang , Zheng Chen , Hongyu Yang , Zhenyu Na
{"title":"用于航空 ad-hoc 网络的分布式多跳聚类算法","authors":"Laiwei Jiang ,&nbsp;Zheng Chen ,&nbsp;Hongyu Yang ,&nbsp;Zhenyu Na","doi":"10.1016/j.adhoc.2024.103547","DOIUrl":null,"url":null,"abstract":"<div><p>The aeronautical ad-hoc network (AANET) aims to provide a wider network connection for aircraft by creating links between them. However, the high speed of flight of aircraft leads to poor sustainability of AANET topology. In order to solve the problem of poor network topological stability, this study proposes a clustering method, called distributed multi-hop clustering algorithm (DMCA), for AANET. DMCA is based on the defined node stability weight and the concept of multi-hop clustering, which can effectively ensure the coverage and stability of clustering. In this study, we divided DMCA into three phases: information table generation stage, cluster head selection and cluster formation stage, and cluster maintenance stage. In order to verify the effectiveness of the proposed method, we compare the proposed method with N-hop, DMCNF, and K-means algorithms from four aspects: average cluster head duration, average cluster member duration, number of cluster head changes, and average number of link broken. According to the simulation results, it can be concluded that the proposed method has improved in these four performance indicators.</p></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":null,"pages":null},"PeriodicalIF":4.4000,"publicationDate":"2024-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Distributed multi-hop clustering algorithm for aeronautical ad-hoc network\",\"authors\":\"Laiwei Jiang ,&nbsp;Zheng Chen ,&nbsp;Hongyu Yang ,&nbsp;Zhenyu Na\",\"doi\":\"10.1016/j.adhoc.2024.103547\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>The aeronautical ad-hoc network (AANET) aims to provide a wider network connection for aircraft by creating links between them. However, the high speed of flight of aircraft leads to poor sustainability of AANET topology. In order to solve the problem of poor network topological stability, this study proposes a clustering method, called distributed multi-hop clustering algorithm (DMCA), for AANET. DMCA is based on the defined node stability weight and the concept of multi-hop clustering, which can effectively ensure the coverage and stability of clustering. In this study, we divided DMCA into three phases: information table generation stage, cluster head selection and cluster formation stage, and cluster maintenance stage. In order to verify the effectiveness of the proposed method, we compare the proposed method with N-hop, DMCNF, and K-means algorithms from four aspects: average cluster head duration, average cluster member duration, number of cluster head changes, and average number of link broken. According to the simulation results, it can be concluded that the proposed method has improved in these four performance indicators.</p></div>\",\"PeriodicalId\":55555,\"journal\":{\"name\":\"Ad Hoc Networks\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":4.4000,\"publicationDate\":\"2024-05-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Ad Hoc Networks\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1570870524001586\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Ad Hoc Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1570870524001586","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

航空特设网络(AANET)旨在通过在飞机之间建立链接,为飞机提供更广泛的网络连接。然而,飞机的高速飞行导致 AANET 拓扑的可持续性较差。为了解决网络拓扑稳定性差的问题,本研究提出了一种针对 AANET 的聚类方法,即分布式多跳聚类算法(DMCA)。DMCA 基于定义的节点稳定性权重和多跳聚类概念,能有效保证聚类的覆盖率和稳定性。本研究将 DMCA 分成三个阶段:信息表生成阶段、簇头选择和簇形成阶段以及簇维护阶段。为了验证所提方法的有效性,我们从平均簇头持续时间、平均簇成员持续时间、簇头变化次数和平均链路中断次数四个方面将所提方法与 N-hop、DMCNF 和 K-means 算法进行了比较。根据仿真结果,可以得出结论:本文提出的方法在这四个性能指标上都有所改进。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Distributed multi-hop clustering algorithm for aeronautical ad-hoc network

The aeronautical ad-hoc network (AANET) aims to provide a wider network connection for aircraft by creating links between them. However, the high speed of flight of aircraft leads to poor sustainability of AANET topology. In order to solve the problem of poor network topological stability, this study proposes a clustering method, called distributed multi-hop clustering algorithm (DMCA), for AANET. DMCA is based on the defined node stability weight and the concept of multi-hop clustering, which can effectively ensure the coverage and stability of clustering. In this study, we divided DMCA into three phases: information table generation stage, cluster head selection and cluster formation stage, and cluster maintenance stage. In order to verify the effectiveness of the proposed method, we compare the proposed method with N-hop, DMCNF, and K-means algorithms from four aspects: average cluster head duration, average cluster member duration, number of cluster head changes, and average number of link broken. According to the simulation results, it can be concluded that the proposed method has improved in these four performance indicators.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Ad Hoc Networks
Ad Hoc Networks 工程技术-电信学
CiteScore
10.20
自引率
4.20%
发文量
131
审稿时长
4.8 months
期刊介绍: The Ad Hoc Networks is an international and archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in ad hoc and sensor networking areas. The Ad Hoc Networks considers original, high quality and unpublished contributions addressing all aspects of ad hoc and sensor networks. Specific areas of interest include, but are not limited to: Mobile and Wireless Ad Hoc Networks Sensor Networks Wireless Local and Personal Area Networks Home Networks Ad Hoc Networks of Autonomous Intelligent Systems Novel Architectures for Ad Hoc and Sensor Networks Self-organizing Network Architectures and Protocols Transport Layer Protocols Routing protocols (unicast, multicast, geocast, etc.) Media Access Control Techniques Error Control Schemes Power-Aware, Low-Power and Energy-Efficient Designs Synchronization and Scheduling Issues Mobility Management Mobility-Tolerant Communication Protocols Location Tracking and Location-based Services Resource and Information Management Security and Fault-Tolerance Issues Hardware and Software Platforms, Systems, and Testbeds Experimental and Prototype Results Quality-of-Service Issues Cross-Layer Interactions Scalability Issues Performance Analysis and Simulation of Protocols.
期刊最新文献
TAVA: Traceable anonymity-self-controllable V2X Authentication over dynamic multiple charging-service providers RL-based mobile edge computing scheme for high reliability low latency services in UAV-aided IIoT networks Editorial Board PLLM-CS: Pre-trained Large Language Model (LLM) for cyber threat detection in satellite networks A two-context-aware approach for navigation: A case study for vehicular route recommendation
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1