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

Improved dv-hop algorithm based on geometric Brownian motion model under communication interference

MEASUREMENT SCIENCE AND TECHNOLOGY 2025年第1期36卷

作者： Zhang, Lieping Huang, Zichen Yin, Yameng Tan, Mingyang Zhang, Cui Guilin Univ Technol Educ Dept Guangxi Zhuang Autonomous Reg Key Lab Adv Mfg & Automat Technol Guilin Peoples R China Guilin Univ Aerosp Technol Guangxi Key Lab Special Engn Equipment & Control Guilin Peoples R China Nanning Coll Technol Sch Informat Engn Guilin Peoples R China

In a mobile sensor network, a traditional positioning algorithm is unable to locate unknown nodes when losing anchor positions caused by communication interference. To solve this problem, an improved dv-hop algorithm based on a geometric Brownian motion (GBM) model was proposed including two main stages: location of sink node (LSN) and location of blind node (LBN). In the LSN stage, if the signal transmission of anchors is normal, the GBM model records the moving positions of the anchors. If not, the GBM model predicts the estimated average positions of the anchors using recorded data. Then, the trial count of the GBM model is optimized to further improve the prediction accuracy and computational overhead. In the LBN stage, the unknown nodes' positions are obtained by the dv-hop algorithm. In a traditional dv-hop algorithm, the approximate minimum hop number and average hop distance may lead to huge deviation between true position and estimated position. To improve the positioning accuracy in the LBN stage, the strategies of multi-communication radius and hop distance weighting were adopted. The simulation results demonstrated that the proposed algorithm has the capability to resist communication interference and adaptability at different node speeds , maintaining a relatively high accuracy in locating unknown nodes.

关键词： mobile sensor network geometric Brownian motion model multi-communication radius hop distance weighting dv-hop algorithm

来源：评论

学校读者我要写书评

暂无评论

Improved dv-hop algorithm combining chaotic map and Gray Wolf algorithm 6

Improved DV-Hop algorithm combining chaotic map and Gray Wol...

引用

6th IEEE Advanced Information Technology, Electronic and Automation Control Conference (IEEE IAEAC)

作者： Fang Xianbao Yong, Lin Su Yian Zhong Letian Hefei Univ Technol Sch Elect Engn & Automat Hefei 230009 Peoples R China

ISBN: (数字)9781665458641

ISBN: (纸本)9781665458641

In view of the low precision of dv-hop positioning algorithm in wireless sensor network, an improved dv-hop localization algorithm that fuses chaotic sequences and Grey Wolf Optimization (GWO) algorithms is proposed. Firstly, in order to reduce the average jump distance error, the algorithm introduces the correction factor, and secondly, for the cumulative calculation error brought about by the least squares method, the improved gray wolf optimization algorithm is used as an alternative, in order to further improve the positioning accuracy and convergence speed, the chaotic sequence is introduced to initialize the gray wolf population, adaptive adjustment strategy is applied to control parameter a, and the algorithm global search ability is improved by using random walking strategy. The simulation results show that compared with the traditional dv-hop algorithm, GA-dvhop algorithm and PSO-dvhop algorithm, the average positioning accuracy is improved by 90%, 86% and 78%.

关键词： wireless sensor networks dv-hop algorithm gray wolf optimization algorithm chaotic sequence adaptive policies

来源：评论

学校读者我要写书评

暂无评论

Improved dv-hop localization algorithm based on social learning class topper optimization for wireless sensor network

引用

TELECOMMUNICATION SYSTEMS 2022年第4期80卷 529-543页

作者： Mohanta, Tapan Kumar Das, Dushmanta Kumar ICFAI Univ Dept ECE Agartala 799210 India Natl Inst Technol Nagaland Dept Elect & Elect Engn Dimapur 797103 India

The process of locating nodes is really a challenging problem in the field of wireless sensor networks. Wireless sensor network localization is commonly followed by the distance vector algorithm. All beacon nodes are currently using dv-hop algorithms to locate the dumb node. On the other hand, the approximate distance from the dumb node to certain beacon nodes contains a significant error, resulting in a large finished dumb node localization problem. To improve localization error an efficient dv-hop method on social learning class topper optimization for wireless sensor networks is implemented in this paper. The proposed algorithm reduces communication between unknown or dumb and beacon nodes by measuring the dimensions of all the beacons at dumb nodes. The network imbalance model is frequently used to show the applicability of the proposed approach in anisotropic networks. Simulations are performed on LabVIEW 2015 platform. The results show that our proposed method outperforms some existing algorithms in terms of computing time (2%), localization error (6.6%), and localization error variance (8.3%).

关键词： Dumb nodes SL-CTO algorithm Beacon nodes dv-hop algorithm

来源：评论

学校读者我要写书评

暂无评论

dv-hop algorithm for adaptive hop-count improvement and average hop distance optimization

引用

JOURNAL OF HIGH SPEED NETWORKS 2019年第2期25卷 127-137页

作者： Ren, Keqiang Wu, Mingkang Jiangxi Univ Sci & Technol Sch Informat Engn Ganzhou 341000 Jiangxi Peoples R China

In order to improve the localization accuracy of unknown nodes in dv-hop algorithm, an improved dv-hop algorithm combined with adaptive hop count and optimized hop distance was proposed. Our proposed algorithm firstly introduced the concept of the adaptive value for the number of communication radii. It was used to adaptively select the number of communication radii for beacon nodes and could realize the subdivision of the minimum hop count. Secondly, sensor nodes adaptively set the hop threshold to reduce the calculation. Finally, the calculation method of the average hop distance of beacon nodes was optimized and the error was corrected. The average hop distance of unknown nodes was obtained by the weighted normalization used for the average hop distance of beacon nodes. Simulation results in both random deployment environment of sensor nodes and nonrandom deployment environment of beacon nodes demonstrate that the localization accuracy of our proposed algorithm is significantly better than the dv-hop algorithm and furthermore has better robustness and adaptability.

关键词： Wireless sensor networks dv-hop algorithm adaptive average hop distance weighted average

来源：评论

学校读者我要写书评

暂无评论

A Review of dv-hop localization algorithm 31

A Review of DV-Hop localization algorithm

引用

31st International Telecommunication Networks and Applications Conference (ITNAC)

作者： Ghribi, Halima Khelifa, Fakhreddine Jemai, Abderrazak Ben Salah, M. Bassem Carthage Univ Tunisia Polytech Sch Dept SERCOM Lab BP 743 Marsa 2078 Tunisia Res & Studies Telecommun Ctr Dept Technol Survey El Ghazala Technol Pk Ariana 2088 Tunisia Carthage Univ Tunisia Polytech Sch INSAT Dept SERCOM Lab Tunis 1080 Tunisia

ISBN: (纸本)9781665427845

In recent years, the wireless sensor network has become a fundamental research area in smart farm and smart irrigation applications. In smart farming applications, the sensors can be scattered randomly via an aircraft, or an airplane,to detect and collect a set of climatic and environmental parameters. The data collected by the sensor nodes don't matter if their locations are unknown. Therefore, it is necessary to determine the location of sensor nodes for correctly interpreting the detected information of communication between nodes. In this case, the location of the sensor nodes is carried out by the use of a set of localization systems such as GPS, GSM, and UWB. These last ones produce a major drawback in terms of huge energy consumption, high cost, and low accuracy in some zone. To resolve these problems, extensive research is being carried out to integrate the range-based or range-free localization algorithm into nodes sensors to improve the localization accuracy. In this paper, we present the performance evaluation of some improved versions of the dv-hop localization algorithm existing in the literature. Thus, we study the impact of variation in the number of anchor nodes, the number of unknown nodes, and the communication range on the minimum mean square error(MMSE) of these algorithms. In order to make a comparison between the dv hop algorithm and these versions, we extract a more practical, innovative version.

关键词： wireless sensor networks dv-hop algorithm localization MMSE

来源：评论

学校读者我要写书评

暂无评论

dv-hop Localization algorithm Based on Minimum Mean Square Error in Internet of Things 7

DV-Hop Localization Algorithm Based on Minimum Mean Square E...

引用

7th International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)

作者： Li, Guangshun Zhao, Shuaishuai Wu, Junhua Li, Chenglong Liu, Yuncui Qufu Normal Univ Sch Informat Sci & Engn Rizhao 276826 Peoples R China

In the practical application of node positioning in the Internet of Things (TOT), the distribution of beacon nodes is generally nonuniform, so there is a certain error in positioning accuracy. In order to make the positioning more accurate, The MMSdv-hop localization algorithm which improved dv-hop localization algorithm is proposed in this paper. At first, this algorithm needs to determine the valid beacon nodes in a local range by selecting threshold value, and after using minimization criterion of mean square error and correcting to obtain the final average hop distance. The dynamic weight is added with the hop number and the number of valid nodes as weights to determine the distance between the unknown nodes and the beacon nodes. A Weighted centroid localization algorithm and a weighted least square method are used to obtain an estimated position separately and the final position is determined by the arithmetic mean value of the two estimated positions. The Matlab simulation experiment shows that compared with the dv-hop localization algorithm, the improved MMSdv-hop localization algorithm has increased significantly in the positioning accuracy. (C) 2019 The Authors. Published by Elsevier B.V.

关键词： Node Positioning dv-hop algorithm Minimum Mean-square Error Least Square Method

来源：评论

学校读者我要写书评

暂无评论

Improvement of dv-hop algorithm Based on RSSI Ratio Correction

引用

INTERNATIONAL JOURNAL OF ONLINE ENGINEERING 2018年第5期14卷 159-171页

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

This paper aims to improve the positioning accuracy of the traditional dv-hop algorithm in networks of uneven node distribution. For this purpose, an improved algorithm was proposed that reduces the errors in terms of the hop count, the mean single-hop distance of anchor nodes and the mean single-hop distance of unknown nodes. Specifically, the hop count was modified based on the RSSI value of the node and the critical RSSI ratio;the mean single-hop distance of anchor nodes was corrected based on the ratio of the single-hop RSSI path length between two nodes to the mean single-hop RSSI path length (i.e. the correction factor);the mean single-hop distance of unknown nodes was divided into two sections to achieve better estimation of the distance between anchor nodes and unknown nodes. The simulation results indicate that the improved algorithm boasts better positioning accuracy and stability than the contrastive algorithms, with the addition of a few computing and communication overhead. The research findings shed new light on the accurate positioning of nodes in wireless sensor networks (WSNs).

关键词： dv-hop algorithm received signal intensity indication (RSSI) hop count mean single-hop distance

来源：评论

学校读者我要写书评

暂无评论

Improved dv-hop localization algorithm using teaching learning based optimization for wireless sensor networks

引用

TELECOMMUNICATION SYSTEMS 2018年第2期67卷 163-178页

作者： Sharma, Gaurav Kumar, Ashok Natl Inst Technol Dept Elect & Commun Engn Hamirpur 177005 Himachal Prades India

Node localization is one of the most critical issues for wireless sensor networks, as many applications depend on the precise location of the sensor nodes. To attain precise location of nodes, an improved distance vector hop (Idv-hop) algorithm using teaching learning based optimization (TLBO) has been proposed in this paper. In the proposed algorithm, hop sizes of the anchor nodes are modified by adding correction factor. The concept of collinearity is introduced to reduce location errors caused by anchor nodes which are collinear. For better positioning coverage, up-gradation of target nodes to assistant anchor nodes has been used in such a way that those target nodes are upgraded to assistant anchor nodes which have been localized in the first round of localization. For further improvement in localization accuracy, location of target nodes has been formulated as optimization problem and an efficient parameter free optimization technique viz. TLBO has been used. Simulation results show that the proposed algorithm is overall 47, 30 and 22% more accurate than dv-hop, dv-hop based on genetic algorithm (GAdv-hop) and Idv-hop using particle swarm optimization algorithms respectively and achieves high positioning coverage with fast convergence.

关键词： Correction factor dv-hop algorithm Localization Optimization Teaching learning based optimization Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

An Advanced dv-hop algorithm 1

An Advanced DV-Hop Algorithm

引用

1st International Conference on Electronics Instrumentation & Information Systems (EIIS)

作者： Hu, Ya-jing Liu, San-yang Zhang, Zhao-hui Xidian Univ Sch Math & Stat Xian 710126 Shaanxi Peoples R China

ISBN: (纸本)9781538608432

The basic dv-hop algorithm can be simply implemented in real Wireless Sensor Networks without any range measurement tools, but it has bad localization accuracy. In this paper we present an advanced dv-hop algorithm. We tried to reduce the ranging error of dv-hop algorithm by two ways. Firstly, when the distance between two nodes is less than or equal to its communication radius, corresponding hops remember as 1 in basic dv-hop algorithm, the hop doesn't reflect distance between two nodes. So, hops are defined as continuous hops, and the paper names the continuous hops between beacon nodes by Euclidean distance. The paper define the continuous hops between others nodes by distance, which is measured by Shadowing model. Secondly, the average hop-size of the unknown nodes comes from a beacon node, but the nodes distribution is uneven in WSNs. We should fully use the information originated from more beacon nodes. The paper use trust degree of each beacon nodes to define the corresponding weighted value, after normalized weighted handing, the estimated hop-length of the unknown node is calculated. By simulation, we prove that advanced dv-hop algorithm performs a better localization accuracy compared with dv-hop algorithm, improved dv-hop algorithm (Chen et al. 2008) and improved dv-hop algorithm (Su Bing al. 2013), which is cause of better location accuracy.

关键词： continuous dv-hop algorithm trust degree Shadowing Model

来源：评论

学校读者我要写书评

暂无评论

An RSSI Based dv-hop algorithm for Wireless Sensor Networks

An RSSI Based DV-Hop Algorithm for Wireless Sensor Networks

引用

IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)

作者： Xiao, Han Zhang, Hao Wang, Zengfeng Gulliver, T. Aaron Ocean Univ China Dept Elect Engn Qingdao Peoples R China Univ Victoria Dept Elect & Comp Engn Victoria BC Canada

ISBN: (纸本)9781538607008

Node localization plays a fundamental role in wireless sensor networks (WSNs). The distance vector hop (dv-hop) algorithm is one of the best localization algorithms because of its low complexity, low cost, and simplicity. However, the localization accuracy can be poor when the number of anchor nodes is low. To improve this accuracy, a weighted dv-hop algorithm based on the received signal strength indicator (RSSI) is proposed. First, the RSSI is used to determine the fractional hops between nodes. Then a corrected average hop distance is obtained. Finally, unconstrained optimization is used to improve the localization accuracy. Performance results are presented for a log-normal shadowing channel which shows that the proposed algorithm is superior to the dv-hop and weighted dv-hop (Wdv-hop) algorithms.

关键词： node localization dv-hop algorithm RSSI unconstrained optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：