检索结果-内蒙古大学图书馆

Improved dv-hop based on Squirrel search algorithm for localization in wireless sensor networks

WIRELESS NETWORKS 2021年第4期27卷 2743-2759页

作者： Abd El Ghafour, Mohamed G. Kamel, Sara H. Abouelseoud, Yasmine Alexandria Univ Fac Engn Dept Engn Math & Phys Alexandria 21544 Egypt

The ability to obtain the accurate location of nodes in wireless sensor networks is crucial for practical applications. The sensed data is meaningless if it is not accompanied by its location. Range-free localization techniques are favored to overcome the hardware limitations of sensor nodes and to avoid the costly range-based techniques. dv-hop is a range-free localization algorithm that is well-known for its simplicity. However, it suffers from low accuracy and poor stability. In this paper, an enhanced variant of the dv-hop algorithm is used to estimate the distance between the unknown nodes and anchor nodes, then the position estimation phase is formulated as a minimization problem solved by means of the recently developed squirrel search algorithm (SSA). The SSA is utilized to find the locations of the unknown sensor nodes. Our proposed algorithm is thus called SSIdv-hop algorithm. The performance of our proposed algorithm is compared to that of existing localization algorithms including the dv-hop, PSOdv-hop, GAdv-hop, and DEIdv-hop algorithms. Extensive simulations showed that our proposed algorithm is superior to other existing algorithms as it achieved higher localization accuracy, better stability and faster convergence rate.

关键词： dv-hop algorithm Meta-heuristics Range-free localization Squirrel search algorithm Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

An Improved dv-hop Localization algorithm Based on Bat algorithm

引用

CYBERNETICS AND INFORMATION TECHNOLOGIES 2016年第1期16卷 89-98页

作者： Yang, Xiaoying Zhang, Wanli Suzhou Univ Coll Informat Engn Suzhou 215006 Peoples R China

In the dv-hop algorithm, the average distance per hop is one of the factors that affect the accuracy of the positioning. In this paper, an improved dv-hop localization algorithm based on bat algorithm (BAD-hop) is proposed to solve the error which is brought by the average distance per hop. In BAD-hop algorithm, bat algorithm which is a kind of intelligent optimization algorithm with good performance is introduced into dv-hop localization algorithm to calculate average distance per hop of anchor nodes. Firstly, the average distance per hop of anchor node is calculated by using bat algorithm, which makes it closer to the actual value. Then the average distance per hop of the unknown node is weighted by using the average distance per hop of anchor nodes which hop-count is less than or equal to 3 to reduce errors caused by average distance per hop. Simulation results show that the improved algorithm can effectively reduce the positioning error without additional hardware.

关键词： Wireless sensor networks dv-hop algorithm node localization bat algorithm average distance per hop

来源：评论

学校读者我要写书评

暂无评论

An Improved dv-hop algorithm Based on Shuffled Frog Leaping algorithm

引用

INTERNATIONAL JOURNAL OF ONLINE ENGINEERING 2015年第9期11卷 17-21页

作者： Yang, Xiaoying Zhang, Wanli Song, Qixiang Suzhou Univ Coll Informat Engn Suzhou 215006 Peoples R China

According to that node localization accuracy is not high in the dv hop localization algorithm, shuffled frog leaping algorithm with many advantages such as the convergence speed is fast, easy to realize and excellent performance of global optimization and so on is introduced into the design of dv-hop algorithm. A new dv-hop algorithm based on shuffled frog leaping algorithm ( Shuffled Frog Leaping dv-hop algorithm, SFLAdv-hop) is proposed in this paper. Based on traditional dv-hop algorithm, the new algorithm used distance of nodes and position information of anchor nodes to establish objective optimization function and realize the estimation of unknown node coordinate in the final stage of dv-hop algorithm. The simulation results showed that compared with the traditional dv-hop algorithm, based on not increasing the sensor node hardware overhead, the improved algorithm can effectively reduce the positioning error.

关键词： wireless sensor network dv-hop algorithm shuffled frog leaping algorithm positioning error

来源：评论

学校读者我要写书评

暂无评论

A SECURITY dv-hop Localization algorithm Resist Spoofing Attack

引用

INTERNATIONAL JOURNAL OF SECURITY AND ITS APPLICATIONS 2015年第11期9卷 303-312页

作者： Zhang, Wanli Song, Qixiang Yang, Xiaoying Suzhou Univ Coll Informat Engn Suzhou 215006 Peoples R China

In order to reduce the node position error of dv-hop algorithm in wireless sensor network, the artificial bee colony algorithm is introduced to design the dv-hop algorithm. A new ABCdv-hop (Artificial Bee Colony dv-hop) algorithm is proposed in this paper. Based on the traditional dv-hop algorithm, by using the minimum hops of nodes and position information of anchor nodes, the average distance per hop is solved by artificial bee colony algorithm to make it more close to the actual value. The simulation results show that compared with the traditional dv-hop algorithm, the improved algorithm can effectively reduce the positioning error without increasing the node hardware overhead.

关键词： dv-hop algorithm Artificial bee colony algorithm The average distance per-hop

来源：评论

学校读者我要写书评

暂无评论

An Improved dv-hop Positioning algorithm for Wireless Sensor Network 3

An Improved DV-Hop Positioning Algorithm for Wireless Sensor...

引用

3rd IEEE International Conference on Progress in Informatcs and Computing (IEEE PIC)

作者： Zheng, Jiuhu Qian, Huanyan Wang, Lie Nanjing Univ Sci & Technol Sch Comp Sci & Engn Nanjing 210094 Jiangsu Peoples R China Jiangsu Inst Commerce Sch Informat Technol Nanjing 211168 Jiangsu Peoples R China Nanjing Univ Posts & Telecommun Minist Educ Key Lab Broadband Wireless Commun & Sensor Networ Nanjing 210003 Jiangsu Peoples R China Southeast Univ Natl Mobile Communicat Esearch Lab Nanjing 210096 Jiangsu Peoples R China

ISBN: (纸本)9781467390880

In the view of the dv-hop positioning algorithm which relies on the distance vector and beacon nodes, several aspects are improved: the average hop distance and hop count are corrected;a method to detect the abnormal distribution of beacon nodes is used to avoid the influence of the abnormal distribution on the positioning performance. The proposed algorithm is simple and effective. Simulation results show that compared with the traditional dv-hop algorithm, the performance of the proposed algorithm is greatly improved. The performance is even even superior to that of the algorithm mentioned in literature [10]

关键词： Wireless sensor network dv-hop algorithm node positioning positioning accuracy

来源：评论

学校读者我要写书评

暂无评论

dv-hop Underground Positioning algorithm Based on Parameter Disturbance WOA

DV-Hop Underground Positioning Algorithm Based on Parameter ...

引用

Chinese Automation Congress (CAC)

作者： Cheng, Xuezhen Wang, Shanpei Liu, Xiaoqing Liu, Xingjun Chen, Kun Li, Jiming Shandong Univ Sci & Technol Coll Elect Engn & Automat Qingdao Peoples R China

ISBN: (纸本)9781728176871

For reducing the error of the Distance Vector-hop (dv-hop) positioning algorithm in the hop-distance and estimation coordinates and enhance the localization accuracy of the underground mine, a novel method that introduces the modified whale optimization algorithm (WOA) to optimize the dv-hop is proposed. Firstly, adopt the average distance per hop is used to amend the hop-distance from the node to be located and each beacon node to minimal the error of the estimation distance. Then, employ the information entropy to disturbance the parameters of WOA, which can make the individual of whales evenly distributed and escape from getting into local optimum when searching the optimal solution. Finally, the simulation shows that the improved means is able to reduce the node location error rate by 15.07% compared to no modified algorithm, and the positioning accuracy of dv-hop algorithm is enhanced without adding other hardware devices.

关键词： Underground positioning dv-hop algorithm node distance error correction disturbance parameters improved WOA

来源：评论

学校读者我要写书评

暂无评论

RESEARCH and IMPROVEMENT of dv_hop LOCALIZATION algorithm in WIRELESS SENSOR NETWORKS 14

RESEARCH and IMPROVEMENT of DV_HOP LOCALIZATION ALGORITHM in...

引用

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： Cui, Hui-Min Wang, Ya-Fang Liu, Jin-Xing Liu, Li-Na Hebei Univ Sci & Technol Coll Informat Sci & Engn Shijiazhuang 050018 Peoples R China Hebei Coll Ind & Technol Dept Basic Educ Shijiazhuang Peoples R China

ISBN: (纸本)9781467372206

dv_hop algorithm is a distributed localization algorithm based on hop count information with low cost, simple implementation. But because of the hop distance error which is large, it will result in a lower positioning accuracy. This paper has carried out the analysis to the dv-hop algorithm, and the location technology of dv-hop localization algorithm gets improved. The improved algorithm revised the network average hop distance estimation range and the unknown node coordinates, the original algorithm and the improved algorithm are simulated. The simulation results show that, in the same network environment, the improved algorithm reduces the location error by distance calculation effectively, the localization accuracy is improved obviously.

关键词： Wireless sensor network (WSN) localization dv-hop algorithm MATLAB simulation

来源：评论

学校读者我要写书评

暂无评论

EMGOdv-hop: an efficient range-free-based WSN node localization using an enhanced mountain gazelle optimizer

引用

JOURNAL OF SUPERCOMPUTING 2025年第1期81卷 1-46页

作者： Mostafa, Reham R. Hashim, Fatma A. Khedr, Ahmed M. AL Aghbari, Zaher Afyouni, Imad Kamel, Ibrahim Ahmed, Naveed Univ Sharjah Res Inst Sci & Engn RISE Ctr Data Analyt & Cybersecur CDAC Big Data Min & Multimedia Res Grp Sharjah 27272 U Arab Emirates Mansoura Univ Fac Comp & Informat Sci Dept Informat Syst Mansoura 35516 Egypt Helwan Univ Fac Engn Helwan Egypt Jadara Univ Res Ctr Irbid Jordan Univ Sharjah Dept Comp Sci Sharjah 27272 U Arab Emirates Univ Sharjah Dept Comp Engn Sharjah 27272 U Arab Emirates

Accurate node localization is essential in wireless sensor networks (WSNs) for effective data analysis and the successful operation of applications like environmental monitoring and disaster management. Range-free methods like the distance vector-hop (dv-hop) algorithm are often used due to hardware and cost constraints, but they face challenges in accuracy and stability. The NP-hard nature of the localization problem has led to the integration of metaheuristic algorithms in previous studies to enhance performance. This paper presents EMGOdv-hop, a novel approach for node localization in multi-hop networks that combines the dv-hop algorithm with the mountain gazelle optimization (MGO) algorithm to enhance localization precision. The EMGOdv-hop method operates in two phases: First, it uses an improved variant of the dv-hop algorithm to more accurately estimate distances between unknown and anchor nodes by incorporating a correction factor. Next, it employs an enhanced version of MGO algorithm, referred to as EMGO, to determine the positions of WSN nodes. The improved dv-hop version enhances accuracy by incorporating a correction factor for better estimation of hop distances, while the EMGO algorithm addresses the limitations of the original MGO algorithm and improves its search capabilities. Extensive simulations assessed the effectiveness of the proposed method across various factors, including anchor node ratios, total node count, and communication ranges. The results demonstrate significant accuracy improvements with the proposed algorithm, showing enhancements of 48.69%, 26.22%, 19.33%, 28.21%, and 40.47% compared to dv-hop, MGOdv-hop, PSOdv-hop, WSOdv-hop, and SSAdv-hop, respectively.

关键词： Wireless sensor networks (WSNs) Node localization Metaheuristics dv-hop algorithm Mountain gazelle optimizer (MGO)

来源：评论

学校读者我要写书评

暂无评论

Optimized Distance Vector hop Localization Based on Pelican Optimization algorithm in Underwater Wireless Sensor Networks

引用

INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS 2025年第1期38卷

作者： Nanthakumar, Sathish Jothilakshmi, P. Sri Venkateswara Coll Engn Dept Elect & Commun Engn Sriperumbudur India Amrita Vishwa Vidyapeetham Amrita Sch Engn Dept Elect & Commun Engn Chennai India

In recent days, underwater exploration has emerged as one of the most predominant technologies for enhancing surveillance and early warning systems. Finding the location of the nodes placed in underwater is a difficult task owing to its harsh underwater environment. In large underwater wireless sensor networks (UWSNs), pinpointing the exact coordinates of sensor nodes may not be feasible or be incredibly expensive. In most of the applications, the coarse coordinate of the node is adequate. The primary technique used in UWSNs to determine the location of sensor nodes, based on the average distance between hops, is referred to as distance vector-hop (dv-hop) localization. Nevertheless, the positioning accuracy in the classic dv-hop technique is influenced by the average hop distance. To reduce the localization error, it is possible to create a distinct and optimized dv-hop approach. To improve the effectiveness of the localization process, the average distance between hops is primarily used as an objective function. The optimization of this objective function is achieved by employing the Pelican Optimization algorithm (POA). There is a noticeable decrease in the localization discrepancy if the optimized average hop distance is used to precisely determine the unidentified node to the anchor node distance among them. The factors used to evaluate the ability of the proposed methodology are the ratio of anchor, transmission range, and the density of the node. Compared to other localization procedures, the obtained outcomes demonstrate that the optimized approach that has been suggested achieves a low localization error of 0.3.

关键词： dv-hop algorithm hop size Pelican Optimization algorithm range-free localization underwater wireless sensor network

来源：评论

学校读者我要写书评

暂无评论

Multi-Source Information Fusion-Based Localization in Wireless Sensor Networks

引用

JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS 2025年第2期34卷

作者： Dang, Yuanyi Li, Jiaxin Shenyang Inst Engn Sch Automat Shenyang 110136 Liaoning Peoples R China

In wireless sensor networks, accurate node localization is essential for ensuring the precision of data collection. The dv-hop algorithm, a popular range-free localization method, estimates distances between nodes by multiplying hop counts with average hop distances obtained through distance vector routing. However, this algorithm often experiences localization errors in randomly distributed network environments due to considerable inaccuracies in average hop distance calculations and the approximation of actual paths by straight-line paths. This paper introduces an enhanced dv-hop localization algorithm, which constructs a mathematical model to optimize the mean square error of the average hop distance for any anchor node. This optimization corrects the average hop distance across the network, bringing it closer to the actual value, thus reducing errors and enhancing accuracy. Simulation results indicate that with 150 nodes, a 30% beacon node ratio and a 100-m communication range, the localization error of the improved Funcdv-hop model decreased from 0.3916 to 0.1705, and the Root Mean Square Error (RMSE) decreased from 24.78m to 14.39m, thereby improving localization accuracy by 56.46%.

关键词： Wireless sensor networks node localization dv-hop algorithm multi-source information fusion

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：