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

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 Qingdao Univ Technol Sch Informat & Control Engn Qingdao 266000 Peoples R 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.

关键词： localization algorithm four-wheel alignment monocular vision computer 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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

ALWadHA localization algorithm Yet More Energy Efficient

引用

IEEE ACCESS 2017年 5卷 6661-6667页

作者： Abu-Mahfouz, Adnan M. Hancke, Gerhard P. CSIR Meraka Inst ZA-0184 Pretoria South Africa City Univ Hong Kong Dept Comp Sci Hong Kong Hong Kong Peoples R China Univ Pretoria Dept Elect Elect & Comp Engn ZA-0002 Pretoria South Africa

Many wireless sensor networks (WSNs) applications, techniques, and algorithms require the position of the sensor nodes. Sensor nodes mainly rely on localization algorithms to determine their own physical location. Usually, these sensor nodes are equipped with a limited power source. Therefore, a localization algorithm used by a WSN should be an energy-aware algorithm. One of the energy efficient localization algorithms that has been proposed recently is an efficient localization algorithm for wireless ad hoc sensor networks with high accuracy (ALWadHA). In this paper, we investigate the impact of using three techniques by ALWadHA in improving the energy efficiency of ALWadHA: first, a single-estimation approach whereby a node estimates its position only once;second, dynamic power control whereby reference nodes reduce their transmission power based on their distance to the node that broadcasts the location request;and third an incremental and exponential requesting rate approach, which controls the frequency rate of sending the location request. Simulation results show that the final approach reduces the energy consumption of ALWadHA by 51.5%, without compromising the accuracy of the position estimation.

关键词： localization algorithm energy efficiency WSN ALWadHA position estimation dynamic power control successive-refinement localization algorithm

来源：评论

学校读者我要写书评

暂无评论

A new Monte Carlo mobile node localization algorithm based on Newton interpolation

引用

EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING 2018年第1期2018卷 1-8页

作者： Lu, Jian-Yin Wang, Chao Chao Hu Univ Coll Informat Engn Hefei Anhui Peoples R China Anhui Xinhua Univ Coll Informat Engn Hefei Anhui Peoples R China

There are some deficiencies in the Monte Carlo localization algorithm based on rangefinder, which like location probability distribution of the k moment in the prediction phase only related to the localization of the k - 1 moment and the maximum and minimum velocity. And the influences of the motion condition on the movement of the mobile node at k moment are also not considered before the k - 1 moment. What is more is the process of selecting the effective particles is slow in the algorithm. Considering the situations above, this paper presented a Monte Carlo mobile node localization algorithm based on Newton interpolation, which uses the inheritedness of Newton interpolation, inheriting the historical trajectory prediction mechanism of the moving node to estimate the current moment's movement speed and movement direction of the moving node, and optimized the moving node motion model, and used particle filter that is optimized by weight of importance to prevent particle collection depletion. The inference and simulation results show that the algorithm has improved the accuracy of the forecast using Newton interpolation. And this algorithm has effectively avoided the degradation of particles and improved the localization accuracy.

关键词： Newton interpolation Monte Carlo localization algorithm

来源：评论

学校读者我要写书评

暂无评论

Inertial optimization MCL deep mine localization algorithm based on grey prediction and artificial bee colony

引用

WIRELESS NETWORKS 2021年第4期27卷 3053-3072页

作者： Yu Xiuwu Li Ying Liu Yong Yu Hao Univ South China Sch Resource & Environm & Safety Engn Hengyang Peoples R China Univ South China Hengyang Peoples R China

To solve the problem that the existing Monte Carlo localization (MCL) algorithm has long localization time and large localization error in the real-time localization of downhole personnel and mobile equipment, an inertial optimization MCL deep mine localization algorithm based on gray prediction and artificial bee colony (IMCL-GABC) is proposed. Firstly, the movement speed and direction of the personnel or equipment to be located at the current moment are estimated by the grey prediction model, and the sampling area is determined by combining with the structural characteristics of the deep mine roadway. Secondly, the artificial bee colony algorithm is introduced to optimize the filtering to eliminate the less likely position points and obtain the approximate optimal estimated position sampling set. Finally, the weight of the sample is optimized by motion inertia, so as to complete the localization of the personnel or mobile equipment to be located. The simulation results show that the average localization error of the IMCL-GABC algorithm is 0.46 m and the average localization time required for the node to move one step is 0.21 s. Compared with the other two mobile node localization algorithms MCL and Monte Carlo localization Boxed, the localization error of IMCL-GABC algorithm is reduced by 50% and 37.84% respectively, and the localization time is reduced by 4.6 s and 0.93 s respectively, which proves that IMCL-GABC algorithm effectively improves the localization accuracy and efficiency of downhole personnel and mobile equipment.

关键词： Wireless sensor network localization algorithm Deep mine Grey prediction Artificial bee colony (ABC) Motion inertia

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：