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

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

来源：评论

学校读者我要写书评

暂无评论

An Advanced dv-hop Localization algorithm for Wireless Sensor Networks

引用

WIRELESS PERSONAL COMMUNICATIONS 2013年第2期71卷 1365-1385页

作者： Kumar, Shrawan Lobiyal, D. K. Jawaharlal Nehru Univ Sch Comp & Syst Sci New Delhi 110067 India

In emerging sensor network applications, localization in wireless sensor network is a recent area of research. Requirement of its applications and availability of resources need feasible localization algorithm with lower cost and higher accuracy. In this paper, we propose an Advanced dv-hop localization algorithm that reduces the localization error without requiring additional hardware and computational costs. The proposed algorithm uses the hop-size of the anchor (which knows its location) node, from which unknown node measures the distance. In the third step of Advanced dv-hop algorithm, inherent error in the estimated distance between anchor and unknown node is reduced. To improve the localization accuracy, we use weighted least square algorithm. Furthermore, location of unknown nodes is refined by using extraneous information obtained by solving the equations. By mathematical analysis, we prove that Advanced dv-hop algorithm has lesser correction factor in the distance between anchor and the unknown node compared with dv-hop algorithm, improved dv-hop algorithm (Chen et al. 2008) and improved dv-hop algorithm (Chen et al. in IEICE Trans Fundam E91-A(8), 2008), which is cause of better location accuracy. Simulation results show that the performance of our proposed algorithm is superior to dv-hop algorithm and improved dv-hop algorithms in all considered scenarios.

关键词： Wireless sensor network Localization Weighted least square dv-hop algorithm Correction factor Random distribution

来源：评论

学校读者我要写书评

暂无评论

An improvement of dv-hop localization algorithm for wireless sensor networks

引用

TELECOMMUNICATION SYSTEMS 2013年第1期53卷 13-18页

作者： Hu, Yu Li, Xuemei Taiyuan Univ Technol Measuring & Controlling Technol Inst Taiyuan 030024 Peoples R China

An improved dv-hop localization algorithm is proposed based on the traditional dv-hop localization algorithm in the paper. There will be a big error that using the nearest anchor node's average hop distance instead of the average hop distance of all the anchor nodes that involved in the localizing in the traditional dv-hop localization algorithm. Therefore, the improved algorithm introduces threshold M, it uses the weighted average hop distances of anchor nodes within M hops to calculate the average hop distance of unknown nodes. In addition, the positioning results are corrected in the improved algorithm. The simulation results show that the new localization algorithm effectively improves the positioning accuracy compared with the traditional dv-hop localization algorithm, it is an effective localization algorithm in the wireless sensor networks.

关键词： Wireless sensor networks Localization dv-hop algorithm Optimization of the average hop distance Position correction

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Study of Positioning Technology in Sonobuoy Networks Based on dv-hop algorithm

Study of Positioning Technology in Sonobuoy Networks Based o...

引用

2013 2nd International Conference on Manufacture Engineering,Quality and Production System(ICMEQP 2013)

作者： Hu Jinhui Hu Dabin Xiao Jianbo Naval University of Engineering

On the basis of analysis of sonobuoy using situation in the modern anti-warship warfare, wireless sensor networks with multiple sonobuoys are studied for detecting mission. The unknown nodes in the network are positioned by using of dv-hop algorithm. The research results show that this method is practical and makes the network be self-organized and extensible.

关键词： dv-hop algorithm Sonobuoy Wireless sensor networks Beacon node

来源：评论

学校读者我要写书评

暂无评论

An Improved dv-hop algorithm for Indoor Positioning Based on Bacterial Foraging Optimization

An Improved DV-HOP Algorithm for Indoor Positioning Based on...

引用

International Conference on Wireless Communications and Signal Processing

作者： Hongji Huang Hongli Chen Shuoya Cheng Fei Li College of Telecommunication and Information Engineering Nanjing University of Posts and Telecommunications

ISBN: (纸本)9781509028610

In order to increase the indoor positioning accuracy and reduce the positioning error in wireless sensor network, the Bacterial Foraging Optimization algorithm is introduced to improve the dv-hop algorithm. The conventional dv-hop algorithm is not very accurate in calculating the average distance per-hop, and it greatly affects the positioning accuracy. Hence, a new BFO-dv-hop (Bacterial Foraging Optimization dv-hop) algorithm is proposed in this paper. The conventional dv-hop algorithm calculates the average distance per-hop based on the Euclidean distance and the minimum number of hops directly, and the random distribution of the irregular network topology leads to the low accuracy in average hop distance estimation. In BFO-dv-hop algorithm, the average distance per-hop is calculated by the Bacterial Foraging Optimization algorithm (BFO) by using the minimum hops of nodes and the position information of anchor nodes. Simulation results show that 30% beacon anchors can effectively reduce the positioning error, and 10% beacon anchors can get a better performance compared with conventional algorithms.

关键词： dv-hop algorithm Bacterial foraging optimization model Average distance per-hop

来源：评论

学校读者我要写书评

暂无评论

Improved dv-hop algorithm for high accuracy and low energy consumption

Improved DV-Hop algorithm for high accuracy and low energy c...

引用

2012 IEEE International Conference on Computer Science and Automation Engineering（CSAE 2012）

作者： Liu Shaoqiang, Zheng Yuan, Zhong Zhi, Li Yongzhou, Fan Xiaoping School of Information Science and Engineering Central South University Changsha, China

Most improved dv-hop algorithms focus on the localization accuracy while underemphasize the energy conservation. In order to enhance the energy saving of wireless sensor networks, these algorithms need to be further improved. Upgrading the positioned nodes to be new-born anchors is an economical scheme to expedite unknown nodes localization and reduce total localization rounds, thus favor energy saving. Using the scheme of upgrading positioned nodes, this paper proposes a new algorithm based on dv-hop, which restricts the hop counts between unknown nodes and anchors to reduce the energy consumption in flooding broadcast of anchors information. To decrease the impact of new-born anchors′ location errors on the positioning accuracy of unknown nodes, the upgrading round sequence of a new-born anchor is defined as the generation to distinguish its error influences. Taking the hop counts and the generations as weighting factors, the paper presents a new weighted average one-hop distance processing method to guarantee the localization accuracy. Simulation and analysis results show that the new algorithm can effectively decrease the positioning error and total localization rounds to take account of both the energy consumption and the accuracy of localization.

关键词： dv-hop algorithm weighted average one-hop distance generation of new-born anchor hop counts restricted localization rounds

来源：评论

学校读者我要写书评

暂无评论

Novel dv-hop localization algorithm for wireless sensor networks

引用

TELECOMMUNICATION SYSTEMS 2017年第3期64卷 509-524页

作者： Kumar, Shrawan Lobiyal, D. K. Maharishi Markandeshwar Univ Dept Comp Sci & Engn Ambala 134007 Haryana India Jawaharlal Nehru Univ Sch Comp & Syst Sci New Delhi 110067 India

Many improved dv-hop localization algorithm have been proposed to enhance the localization accuracy of dv-hop algorithm for wireless sensor networks. These proposed improvements of dv-hop also have some drawbacks in terms of time and energy consumption. In this paper, we propose Novel dv-hop localization algorithm that provides efficient localization with lesser communication cost without requiring additional hardware. The proposed algorithm completely eliminates communication from one of the steps by calculating hop-size at unknown nodes. It significantly reduces time and energy consumption, which is an important improvement over dv-hop-based algorithms. The algorithm also uses improvement term to refine the hop-size of anchor nodes. Furthermore, unconstrained optimization is used to achieve better localization accuracy by minimizing the error terms ( ranging error) in the estimated distance between anchor node and unknown node. Log-normal shadowing path loss model is used to simulate the algorithms in a more realistic environment. Simulation results show that the performance of our proposed algorithm is better when compared with dv-hop algorithm and improved dv-hop-based algorithms in all considered scenarios.

关键词： Communication cost dv-hop algorithm Localization Ranging error Unconstrained optimization Wireless sensor network

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：