{"title":"基于无线传感器网络可变通信半径的改进 DV-Hop 定位算法","authors":"Yuxiao Cao, Xiaobin Wu, Jinbao Xu","doi":"10.1007/s11277-024-11571-9","DOIUrl":null,"url":null,"abstract":"<p>In the field of wireless sensor networks, node localization is a key research issue. As a classical range-free localization scheme, the localization accuracy of distance vector-hop (DV-Hop) algorithm needs to be further improved. Therefore, an improved DV-Hop location algorithm based on variable communication radius (VCR IDV-Hop) is proposed in this paper. Firstly, by changing the communication radius of the anchor nodes, hop counts between nodes are refined from integer to decimal, which improves the accuracy of estimated distance between nodes. Secondly, the calculation of the average hop size of anchor nodes is abstracted into a combinatorial optimization problem, and the binary bat algorithm (BBA) is applied to solve it. Finally, when the unknown node is located, only part of anchor nodes with smaller hop counts from the unknown node are selected to participate in the localization. Simulation results show that VCR IDV-Hop greatly improves the localization accuracy of nodes compared with other excellent localization algorithms.</p>","PeriodicalId":23827,"journal":{"name":"Wireless Personal Communications","volume":null,"pages":null},"PeriodicalIF":1.9000,"publicationDate":"2024-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Improved DV-Hop Localization Algorithm Based on Variable Communication Radius for Wireless Sensor Networks\",\"authors\":\"Yuxiao Cao, Xiaobin Wu, Jinbao Xu\",\"doi\":\"10.1007/s11277-024-11571-9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>In the field of wireless sensor networks, node localization is a key research issue. As a classical range-free localization scheme, the localization accuracy of distance vector-hop (DV-Hop) algorithm needs to be further improved. Therefore, an improved DV-Hop location algorithm based on variable communication radius (VCR IDV-Hop) is proposed in this paper. Firstly, by changing the communication radius of the anchor nodes, hop counts between nodes are refined from integer to decimal, which improves the accuracy of estimated distance between nodes. Secondly, the calculation of the average hop size of anchor nodes is abstracted into a combinatorial optimization problem, and the binary bat algorithm (BBA) is applied to solve it. Finally, when the unknown node is located, only part of anchor nodes with smaller hop counts from the unknown node are selected to participate in the localization. Simulation results show that VCR IDV-Hop greatly improves the localization accuracy of nodes compared with other excellent localization algorithms.</p>\",\"PeriodicalId\":23827,\"journal\":{\"name\":\"Wireless Personal Communications\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.9000,\"publicationDate\":\"2024-09-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Wireless Personal Communications\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1007/s11277-024-11571-9\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"TELECOMMUNICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Wireless Personal Communications","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s11277-024-11571-9","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"TELECOMMUNICATIONS","Score":null,"Total":0}
Improved DV-Hop Localization Algorithm Based on Variable Communication Radius for Wireless Sensor Networks
In the field of wireless sensor networks, node localization is a key research issue. As a classical range-free localization scheme, the localization accuracy of distance vector-hop (DV-Hop) algorithm needs to be further improved. Therefore, an improved DV-Hop location algorithm based on variable communication radius (VCR IDV-Hop) is proposed in this paper. Firstly, by changing the communication radius of the anchor nodes, hop counts between nodes are refined from integer to decimal, which improves the accuracy of estimated distance between nodes. Secondly, the calculation of the average hop size of anchor nodes is abstracted into a combinatorial optimization problem, and the binary bat algorithm (BBA) is applied to solve it. Finally, when the unknown node is located, only part of anchor nodes with smaller hop counts from the unknown node are selected to participate in the localization. Simulation results show that VCR IDV-Hop greatly improves the localization accuracy of nodes compared with other excellent localization algorithms.
期刊介绍：
The Journal on Mobile Communication and Computing ...
Publishes tutorial, survey, and original research papers addressing mobile communications and computing;
Investigates theoretical, engineering, and experimental aspects of radio communications, voice, data, images, and multimedia;
Explores propagation, system models, speech and image coding, multiple access techniques, protocols, performance evaluation, radio local area networks, and networking and architectures, etc.;
98% of authors who answered a survey reported that they would definitely publish or probably publish in the journal again.
Wireless Personal Communications is an archival, peer reviewed, scientific and technical journal addressing mobile communications and computing. It investigates theoretical, engineering, and experimental aspects of radio communications, voice, data, images, and multimedia. A partial list of topics included in the journal is: propagation, system models, speech and image coding, multiple access techniques, protocols performance evaluation, radio local area networks, and networking and architectures.
In addition to the above mentioned areas, the journal also accepts papers that deal with interdisciplinary aspects of wireless communications along with: big data and analytics, business and economy, society, and the environment.
The journal features five principal types of papers: full technical papers, short papers, technical aspects of policy and standardization, letters offering new research thoughts and experimental ideas, and invited papers on important and emerging topics authored by renowned experts.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
