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

An enhanced DV-Hop localization algorithm in wireless sensor networks with variable velocity strategy and human conception optimization

引用

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

作者： Panda, Subrat Kumar Acharya, Debasis Das, Dushmanta Kumar Rajagopal, R. Kumar Natl Inst Technol Nagaland Dept Elect & Instrumentat Engn Dimapur 797103 India Natl Inst Technol Nagaland Dept Elect & Elect Engn Dimapur 797103 India

Wireless sensor networks (WSNs) are widely used for detecting objects, collecting, analyzing, and communicating information. Optimizing the estimation of sensor node positions is crucial for precise and reliable operations. The standard Distance Vector Hop (DV-Hop) localization method, while simple and practical, lacks sufficient accuracy. This article introduces an Improved Distance Vector Hop (IDV-Hop) algorithm that enhances positioning accuracy using a Variable Velocity Strategy Human Conception Optimization (VVS-HCO). This method refines the velocity update technique to improve convergence and precision without additional hardware costs. The proposed algorithm allows adjustable hop sizes for anchor nodes. Simulation results demonstrate that the IDV-Hop algorithm significantly reduces localization error and variance, improving accuracy under various conditions, outperforming other advanced algorithms.

关键词： Unknown nodes Anchor nodes Accuracy Coverage DV-Hop Error localization algorithm VVS-HCO Wireless sensor network LabView software

来源：评论

学校读者我要写书评

暂无评论

localization algorithm for 3D four-wheel alignment based on monocular vision

Engineering Research Express

引用

Engineering Research Express 2025年第2期7卷

作者： Shao, Mingwei Chen, Jianjun School of Information and Control Engineering Qingdao University of Technology Qingdao266000 China

A novel localization algorithm for a four-wheel alignment is present. As our algorithm is based on monocular vision, the problem that a traditional 3D four-wheel alignment needs to unify the global coordinate system and easy to cause error accumulation is not existing. In accordance with the principle of monocular reconstruction in computer vision, the representation of equivalent reference plane for each wheel in its corresponding camera coordinate system is calculated out. Based on these new definitions, related angle parameters of the vehicle wheel are finally determined. Simulations and analysis show the feasibility and robustness of our algorithm described in this paper. Experiment results show that the proposed algorithm can obtain precise results and the root mean square error is about 0.005 degrees. Compared with the traditional localization algorithm of a 3D four-wheel alignment, the measurement precision of our proposed algorithm is similar, but does not need global coordinate system calibration, so the operation is simple and efficient. Furthermore, as the wheel measurement is relatively independent, it is not easy to cause error accumulation. © 2025 IOP Publishing Ltd. All rights, including for text and data mining, AI training, and similar technologies, are reserved.

关键词： computer vision four-wheel alignment localization algorithm monocular vision

来源：评论

学校读者我要写书评

暂无评论

localization algorithm based on a spring model (LASM) for large scale wireless sensor networks

引用

SENSORS 2008年第3期8卷 1797-1818页

作者： Chen, Wanming Mei, Tao Meng, Max Q. -H. Liang, Huawei Liu, Yumei Li, Yangming Li, Shuai Chinese Acad Sci Inst Intelligent Machines Hefei 230031 Peoples R China Univ Sci & Technol China Dept Automat Hefei 230027 Peoples R China Chinese Univ Hong Kong Dept Elect Engn Sha Tin Hong Kong Peoples R China

A navigation method for a lunar rover based on large scale wireless sensor networks is proposed. To obtain high navigation accuracy and large exploration area, high node localization accuracy and large network scale are required. However, the computational and communication complexity and time consumption are greatly increased with the increase of the network scales. A localization algorithm based on a spring model (LASM) method is proposed to reduce the computational complexity, while maintaining the localization accuracy in large scale sensor networks. The algorithm simulates the dynamics of physical spring system to estimate the positions of nodes. The sensor nodes are set as particles with masses and connected with neighbor nodes by virtual springs. The virtual springs will force the particles move to the original positions, the node positions correspondingly, from the randomly set positions. Therefore, a blind node position can be determined from the LASM algorithm by calculating the related forces with the neighbor nodes. The computational and communication complexity are O( 1) for each node, since the number of the neighbor nodes does not increase proportionally with the network scale size. Three patches are proposed to avoid local optimization, kick out bad nodes and deal with node variation. Simulation results show that the computational and communication complexity are almost constant despite of the increase of the network scale size. The time consumption has also been proven to remain almost constant since the calculation steps are almost unrelated with the network scale size.

关键词： localization algorithm spring model large scale wireless sensor networks robot navigation

来源：评论

学校读者我要写书评

暂无评论

localization algorithm for the PD Source in Substation Based on L-Shaped Antenna Array Signal Processing

引用

IEEE TRANSACTIONS ON POWER DELIVERY 2015年第1期30卷 472-479页

作者： Hou, Huijuan Sheng, Gehao Jiang, Xiuchen Shanghai Jiao Tong Univ Dept Elect Engn Shanghai 200240 Peoples R China

A novel algorithm based on L-shaped antenna array signal processing is proposed in this paper for the localization of partial-discharge (PD) sources in substations. The principle of estimation of signal parameter via rotational invariance techniques has been used for finding the direction of arrival (DOA) of signals. Third-order cumulants of signals are used in this algorithm, by which Gaussian white noises and periodic narrowband interference mixed in observed signals can be efficiently suppressed. Planar location of PD sources can be obtained by solving the intersecting point of two lines in DOAs. Therefore, solving nonlinear equations can be avoided. Besides, it is convenient to replace the observed signals with their envelopes in this algorithm. The proposed algorithm is used to process mixed signals with simulated ultrahigh frequency (UHF) signals by electromagnetic-wave simulation software, Gaussian white noises of different signal-to-noise ratios, and fixed-frequency noises. The planar location of PD sources is obtained approximately. UHF signals collected in substations and their envelopes have proven to be suitable to locate PD sources effectively by the proposed algorithm as well. Therefore, the accuracy and feasibility of the proposed algorithm are proved.

关键词： Array signal processing directions of arrival estimation estimation of signal parameter via rotational invariance techniques localization algorithm partial discharge (PD) thirdorder cumulants ultra-high frequency (UHF)

来源：评论

学校读者我要写书评

暂无评论

localization algorithm for GSM Mobiles Based on RSSI and Pearson's Correlation Coefficient

Localization Algorithm for GSM Mobiles Based on RSSI and Pea...

引用

IEEE International Conference on Consumer Electronics (ICCE)

作者： Zhang, Yunzhou Liu, Huiyu Fu, Wenyan Zhou, Aichun Mi, Liang Northeastern Univ Shenyang Liaoning Peoples R China Worcester Polytech Inst Worcester MA 01609 USA

ISBN: (纸本)9781479912919

For GSM localization, an algorithm is developed with received signal strength indication(RSSI) and Pearson's correlation coefficient. Based on Cell-Id method. Redundant information from seven base stations is fully utilized to strengthen the localization accuracy. Our method does not need additional device or prior statistical knowledge. Simulation and field experiment are implemented for performance verification. Compared with typical algorithms such as Cell-Id and the Minimum Variance localization, our proposed algorithm can achieve better accuracy.

关键词： cellular radio correlation methods statistical analysis GSM localization GSM mobiles Pearson correlation coefficient RSSI cell-Id method localization algorithm received signal strength indication redundant information statistical knowledge variance localization Accuracy Base stations GSM Hidden Markov models Interference Mobile communication Performance evaluation

来源：评论

学校读者我要写书评

暂无评论

Point In Triangle Testing Based Trilateration localization algorithm In Wireless Sensor Networks

引用

KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS 2012年第10期6卷 2567-2586页

作者： Zhang, Aiqing Ye, Xinrong Hu, Haifeng Anhui Normal Univ Coll Phys & Elect Informat Wuhu 241000 Anhui Peoples R China Nanjing Univ Posts & Telecommun Coll Telecommun & Informat Engn Nanjing 210003 Jiangsu Peoples R China

localization of sensor nodes is a key technology in Wireless Sensor Networks(WSNs). Trilateration is an important position determination strategy. To further improve the localization accuracy, a novel Trilateration based on Point In Triangle testing localization (TPITL) algorithm is proposed in the paper. Unlike the traditional trilateration localization algorithm which randomly selects three neighbor anchors, the proposed TPITL algorithm selects three special neighbor anchors of the unknown node for trilateration. The three anchors construct the smallest anchor triangle which encloses the unknown node. To choose the optimized anchors, we propose Point In Triangle testing based on Distance(PITD) method, which applies the estimated distances for trilateration to reduce the PIT testing errors. Simulation results show that the PIT testing errors of PITD are much lower than Approximation PIT(APIT) method and the proposed TPITL algorithm significantly improves the localization accuracy.

关键词： wireless sensor networks localization algorithm localization accuracy trilateration point in triangle testing

来源：评论

学校读者我要写书评

暂无评论

A DETECTION AND localization algorithm FOR MOVING TARGETS BEHIND WALLS BASED ON ONE TRANSMITTER-TWO RECEIVER CONFIGURATION

引用

MICROWAVE AND OPTICAL TECHNOLOGY LETTERS 2017年第6期59卷 1252-1259页

作者： Yilmaz, Betul Ozdemir, Caner Mersin Univ Dept Elect & Elect Engn TR-33343 Mersin Turkey Emtech IT Technol Engn Corp Mersin Technol Dev Zone 203 TR-33343 Mersin Turkey

In this paper, we introduce a simple;but an effective algorithm to detect and image the precise location of moving targets behind obstacles based on one-transmitter and two-receiver configuration. The problem geometry together with the formulation details of the algorithm are given. The performance of the algorithm is first evaluated by synthesizing a numerical scenario that is simulated by moving ideal scatterers. Then, the success and the validity of the algorithm are being assessed by an error analysis study that calculates the error associated by the approximations. The algorithm is tested with measured data obtained by an experimental set-up for detecting a human movement behind the wall. Resultant two-dimensional consecutive images indicate that this algorithm can be effectively used for pinpointing the moving targets in TWR or similar through-the-obstacle radar applications with good fidelity. (C) 2017 Wiley Periodicals, Inc.

关键词： remote sensing through-the-wall radar moving target detection radar signal processing localization algorithm

来源：评论

学校读者我要写书评

暂无评论

An improved Cuckoo search localization algorithm for UWB sensor networks

引用

WIRELESS NETWORKS 2021年第1期27卷 527-535页

作者： Qin, Xiaofeng Xia, Bin Ding, Tian Zhao, Lei Shandong Univ Technol Sch Comp Sci & Technol Zibo 255000 Shandong Peoples R China

Conventional Cuckoo search (CS) localization method can obtain good positioning results that are highly accurate and robust. However, its positioning performance is constrained by the limited distance information available between the unknown node and the anchor node. In order to further enhance the positioning accuracy of the CS method, an improved CS localization algorithm is proposed that can take advantage of all of the distance information available. In the positioning process, an objective function which contains the distance information among the unknown nodes is given. Firstly, we use this distance information between the anchor node and the unknown node to determine an initial position through the conventional CS method. Then, based on the initial position, all of the distance information available is used to compute a more precise position. The simulation results demonstrate that the proposed algorithm can enhance the positioning accuracy in comparison with the conventional CS algorithm.

关键词： Cuckoo search localization algorithm Non line of sight

来源：评论

学校读者我要写书评

暂无评论

A novel range-free localization algorithm to turn connectivity traces and motion data into localization information

引用

AD HOC NETWORKS 2014年 20卷 36-52页

作者： Maria Caber, Jose Olabarrieta, Ignacio (Inaki) Gil-Lopez, Sergio Del Ser, Javier Luis Martin, Jose Tecnalia Res & Innovat Zamudio 48170 Spain Univ Basque Country Fac Engn Dept Elect & Telecommun Bilbao 48013 Spain

This paper presents a novel range-free localization algorithm that has been originally designed to help in the characterization of human behavior by turning connectivity traces of mobile nodes into localization information. It is based on an error function that uses connectivity between nodes and information about their maximum velocity and that is solved by iterative minimization using unconstrained optimization. The resultant trajectories are evaluated with respect to the localization solution space (LSS), a multi-dimensional space consisting of all solutions that satisfy completely the conditions of the problem. The algorithm is evaluated through extensive simulations in scenarios with different levels of connectivity and under regular and irregular conditions in the communications. The complementarity with other localization algorithms is presented by using their results as initialization stage for this algorithm. Finally, it is applied to a real database that provides information about Bluetooth-based connectivity and motion of people in an office scenario, rendering satisfactory results and hence, validating the practicability of the proposed algorithm as a framework to obtain localization traces. (C) 2014 Elsevier B.V. All rights reserved.

关键词： localization algorithm Error function Unconstrained optimization Bluetooth connectivity Connectivity trace Human behavior

来源：评论

学校读者我要写书评

暂无评论

An Improved PSO localization algorithm for UWB Sensor Networks

引用

WIRELESS PERSONAL COMMUNICATIONS 2021年第3期117卷 2207-2223页

作者： Xia, Bin Liu, Tao Ding, Tian Wang, ZhiQiang Shandong Univ Technol Sch Comp Sci & Technol Zibo 255000 Peoples R China

Traditional particle swarm optimization (PSO) localization method can achieve good localization accuracy with the advantages of fewer parameters and simpler calculations. However, its localization performance is constrained by the limited ranging information available between the anchor node and the unknown node. Thus, an improved PSO localization method is proposed to further improve the localization performance. Firstly, we use the ranging information between the unknown node and the anchor node to make an initial positioning through the traditional PSO method. Then, based on the initial positioning, all ranging information is employed to calculate a more precise location. Compared with the traditional PSO method, the proposed algorithm can reduce the impact of the ranging error and improve localization performance.

关键词： Particle swarm optimization localization algorithm Non line of sight

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：