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

An LED SAHP-based Planar Projection PTCdv-hop Location algorithm

KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS 2019年第9期13卷 4541-4554页

作者： Zhang, Yuexia Chen, Hang Jin, Jiacheng Beijing Informat Sci & Technol Univ Sch Informat & Commun Engn Inst Beijing 100101 Peoples R China Beijing Informat Sci & Technol Univ Beijing Key Lab High Dynam Nav Technol Beijing 100101 Peoples R China

This paper proposes a planar projection dv-hop location algorithm (PTCdv-hop) based on the LED semi-angle at half power (SAHP, which accounts for LED SAHP characteristics in visible light communication (VLC)) and uses the dv-hop algorithm for range-free localization. Distances between source nodes and nodes positioned in three-dimensional indoor space are projected onto a two-dimensional plane to reduce complexity. Circles are structured by assigning source nodes (projected onto the horizontal plane of the assigned nodes) to be centers and the projection distances as radii. The proposed PTCdv-hop algorithm then determines the position of node location coordinates using the trilateralweighted-centroid algorithm. Simulation results show localization errors of the proposed algorithm are on the order of magnitude of a millimeter when three sources are used. The PTCdv-hop algorithm has higher positioning accuracy and stronger dominance than the traditional dv-hop algorithm.

关键词： dv-hop algorithm indoor positioning semi-angle at half power (SAHP) visible light communication(VLC)

来源：评论

学校读者我要写书评

暂无评论

Improved range-free localization for three-dimensional wireless sensor networks using genetic algorithm

引用

COMPUTERS & ELECTRICAL ENGINEERING 2018年 72卷 808-827页

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

This paper presents a distributed range-free node localization algorithm for three-dimensional (3D) wireless sensor networks (WSNs), named as 3D-GAIdv hop (3D genetic algorithm based Improved Distance Vector hop). In the proposed algorithm, the average hop size of anchor nodes is modified by updating a correction factor and the modified hop size is further optimized by line search algorithm. The concept of coplanarity is introduced to reduce location errors caused by the anchor nodes which are coplanar. The localization accuracy is further improved by applying genetic algorithm (GA). To improve the positioning coverage of the network, those target nodes which have been localized successfully in the first round of the localization process, are upgraded to assistant anchor node. All the processes and calculations are carried out at target node level, which makes the proposed algorithm energy efficient. Simulation results show that our proposed algorithm outperforms the similar kind of existing algorithms. (C) 2017 Elsevier Ltd. All rights reserved.

关键词： dv-hop algorithm Genetic algorithm Localization Optimization Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Enhanced dv-hop Localization algorithm using RSSI

引用

INTERNATIONAL JOURNAL OF FUTURE GENERATION COMMUNICATION AND NETWORKING 2013年第6期6卷 91-98页

作者： Zhang, Jianmin Yang, Rui Li, Jian Henan Inst Engn Coll Comp Zhengzhou 451191 Henan Peoples R China Henan Inst Engn Coll Sci Zhengzhou 451191 Henan Peoples R China

Localization has been identified as a key and challenging topic in Wireless Sensor Networks (WSNs), especially for the applications requiring the accurate position of the sensed information. dv-hop is a typical range-free node localization algorithm in WSNs;the localization cost and hardware requirements are not high and localization accuracy of sensor nodes is still low under certain circumstances. Based on the main reasons of the error dv-hop algorithm, an improved algorithm is proposed in this paper which reduces the location error without requiring additional hardware. The proposed algorithm uses Received Signal Strength Indicator (RSSI) to give the hop count a correction value. In the proposed algorithm the hop count is no longer positive integer number, and can be positive real number. With this new idea, the distance between sensor nodes can be more accurately computed that that of in dv-hop localization algorithm. Since the distance between sensor nodes estimation is a key issue in localization for WSNs, the proposed algorithm achieves better performance as compared with dv-hop algorithm. Simulations are performed and the results show that the enhanced dv-hop algorithm outperforms the dv-hop algorithm in term of localization accuracy.

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Wireless Sensor Node Localization algorithm Based on Particle Swarm Optimization and Quantum Neural Network

引用

INTERNATIONAL JOURNAL OF ONLINE ENGINEERING 2018年第10期14卷 230-240页

作者： Liu, Yulong Yu, Xiaoming Hao, Yuhua Yancheng Inst Technol Sch Math & Phys Yancheng 224051 Peoples R China

Aiming at the problem of node localization in wireless sensor networks, a location algorithm for optimizing distance vector hopping (dv-hop) by constructing a quantum neural network model based on particle swarm optimization (PSO) is proposed. According to the average distance obtained by the traditional dv-hop and the distance from the measured nodes, the quantum neural network model is constructed, and the average distance is trained by the particle swarm optimization algorithm which would shorten the training time of the traditional artificial neural network and accelerate the convergence speed. By using the proposed model, the optimal mean value is obtained, and the optimization of the dv-hop algorithm is realized. The simulation results show that compared with the traditional dv-hop algorithm, the proposed algorithm can reduce the positioning error by about 20%, and the positioning accuracy is significantly improved.

关键词： wireless sensor networks quantum neural network particle swarm optimization dv-hop algorithm

来源：评论

学校读者我要写书评

暂无评论

High-Accuracy Positioning for Indoor Wireless Sensor Networks 9

High-Accuracy Positioning for Indoor Wireless Sensor Network...

引用

2017 9th IEEE International Conference on Communication Software and Networks (ICCSN 2017)

作者： Hongji Huang Jin-Yuan Wang Xingzhou Zhou Tong Xiang Yu Zhang Hao Wu Yongjin Wang College of Telecommunication and Information Engineering Nanjing University of Posts and Telecommunications National Mobile Communications Research Laboratory Southeast University

ISBN: (纸本)9781509038237;9781509038220

In this paper, a new scheme to reduce the positioning error is investigated for wireless sensor networks(WSN). To be specific, conventional Distance Vector-hop(dvhop) algorithm fail to calculate the average distance per-hop with high precision that caused by the random distribution of the irregular network topology, greatly leading to the positioning error in the dv-hop algorithm. To enhance the positioning accuracy, we combine the Quantum Bacterial Foraging Optimization(QBFO) algorithm with the dv-hop algorithm, designing a new QBFO-dv-hop(Quantum Bacterial Foraging Optimization dv-hop) algorithm. In the QBFO-dv-hop algorithm, the average distance per-hop is calculated by the QBFO by using the minimum hops of nodes and the position information of anchor nodes are broadcast. Simulation results illustrate that the positioning error of 30% anchors can be effectively reduced without adding computation complexity, and computer simulation also shows that increasing the number of the unknown nodes or decreasing the communication radius can get better performance compared with other typical dv-hop algorithms.

关键词： dv-hop algorithm quantum bacterial foraging optimization model quantum computing swarm intelligence

来源：评论

学校读者我要写书评

暂无评论

Efficient Localization in WSN Based on Structured Deployment of Anchor Nodes in dv-hop

引用

INTERNATIONAL JOURNAL OF FUTURE GENERATION COMMUNICATION AND NETWORKING 2016年第3期9卷 155-165页

作者： Kaur, Ravneet Malhotra, Jyoteesh GNDU ECE Dept Reg Campus Jalandhar Punjab India

Recent advancements in MEMSs technology, VLSI and Wireless Private Area Networks have contributed in developing enormous interest in wireless sensor networks by both academia and research community. WSN is formed by large number of small, cheap and low energy sensors that work together in monitoring regions. WSN find its application in many areas such as object tracking, disaster relief and smart environments. Most of these applications need location awareness of sensor nodes to estimate the origin of events. Localization has remained a challenge in successful implementation of WSN and so, it is a hotspot of research. Range free localization techniques are given lot of importance in recent research works because they suit well for low cost, low energy and less infrastructure requirements of WSN and also involve lesser computation complexity. dv-hop is one of the range free techniques that have attracted researchers' interest. In this paper, dv-hop algorithm is implemented by deploying anchor nodes in a structured way at various radio ranges. Structured deployment of anchors give more accurate location estimates than random deployment that was followed in basic dv-hop, which has been demonstrated in a detailed manner by the simulation results.

关键词： Localization dv-hop algorithm Localization Error

来源：评论

学校读者我要写书评

暂无评论

Iterative L-M algorithm in WSN - Utilizing Modifying Average hopping Distances

引用

INTERNATIONAL JOURNAL OF ONLINE ENGINEERING 2017年第10期13卷 4-20页

作者： Qiao, Xin Yang, Han-Sheng Wang, Zheng-Chuang Chaohu Univ Sch Mech & Elect Engn Chaohu 238000 Anhui Peoples R China

Wireless Sensor Networks (WSN) are getting more and more attention for various applications. In addition, localization plays an important role in WSN. This article focus on the large errors of dv-hop (Distance Vector-hop) localization algorithm in net topology of randomly distributed notes. A CLdv-hop (Correct Levenberg Marquardt dv-hop) algorithm in dv-hop based on modifying average hopping distances is proposed. Firstly, hop count threshold is to optimize the anchor node during a data exchange. The weighted average hop distance of unknown nodes nearest the three anchor nodes are selected as its average hop distance according to the minimum mean square criteria. Finally, L-M (Levenberg Marquardt) algorithm is used to optimize the coordinate of unknown node estimated by least squares. The simulation results show that, under the conditions of existing overhead and for a given simulation environment, CLdv-hop algorithm has higher positioning accuracy than existing improved algorithms. The accuracy is improved 33%-41% compared with dv-hop algorithm.

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

来源：评论

学校读者我要写书评

暂无评论

The research and optimization of AD-Hoc network localization algorithm based on the distance-assisted 18

The research and optimization of AD-Hoc network localization...

引用

18th International Conference on Advanced Communication Technology (ICACT)

作者： Wu, Jiawei Tianjin Univ Commerce Sch Informat Engn Tianjin Peoples R China

ISBN: (纸本)9788996865063

In order to enhance the accuracy of AD-Hoc network localization and the autonomy of the range-free localization algorithm, the sensing distance-accumulated value, as a scale, is used to modify accumulated distance and estimate node location information by the way of curve fitting, instead of calculating the coordinate value by the way of maximum likelihood estimation. By means of the mathematical deduction and simulation analysis, this localization algorithm, based on the distance-assisted, could realize the quantitative analysis of dv-hop algorithm, reduce the physical localization difference of the AD-Hoc network due to the multi-hop communication mechanism, modify the accumulated distance in the hop segment, improve the localization accuracy in a network of nodes that are unevenly distributed. In dense or sparse networks, this new improved algorithm could achieve a better localization data of the nodes than the traditional algorithm, and realize the nodes autonomous localization in the AD-Hoc network.

关键词： AD-Hoc network Range-free localization dv-hop algorithm Distance-assited hop count quantitative analysis

来源：评论

学校读者我要写书评

暂无评论

An Improved Hybrid Localization algorithm for Wireless Sensor Networks 8

An Improved Hybrid Localization Algorithm for Wireless Senso...

引用

8th International Conference on Intelligent Human-Machine Systems and Cybernetics (IHMSC)

作者： Liu, Yuan Chen, Junjie Xu, Zhenfeng Zhang, Jingxia Yang, Yan Southeast Univ Nanjing Jiangsu Peoples R China Sch Guangdong Petr & Chem Engn Maoming Guangdong Peoples R China

ISBN: (纸本)9781509007684

Localization technology is the basis of practical applications of wireless sensor networks (WSNs). An improved localization algorithm for wireless sensor networks was proposed to reduce hop distance error and solve the premature convergence problem for the hybrid localization algorithm of dv-hop and Bat (BAdv-hop). Based on the vector routing localization mechanism, an optimization method was designed to enhance the average hop distance accuracy. The linear weight strategy was used to correct searching velocity of bats. In addition, tendentious random disturbance was established to optimize location information. Experimental results showed that the localization accuracy of improved algorithm is 13% greater than that of dv-hop algorithm and 3% greater than that of BAdv-hop algorithm. Moreover, the improved algorithm effectively reduced the maximum iterations and avoided premature convergence without any additional energy consumption compared to BAdv-hop algorithm.

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：