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

localization algorithm Based on a Spring Particle Model (LASPM) for Large-Scale Unmanned Aerial Vehicle Swarm (UAVs)

引用

INTERNATIONAL JOURNAL OF COGNITIVE INFORMATICS AND NATURAL INTELLIGENCE 2023年第1期17卷 1页

作者： Chen, Sanfeng Lin, Guangming Hu, Tao Wang, Hui Lai, Zhouyi Shenzhen Inst Informat Technol Shenzhen Peoples R China Dongguan City Univ Dongguan Peoples R China

A new localization algorithm based on large scale unmanned aerial vehicle swarm (UAVs) is proposed in the paper. The localization algorithm is based on a spring particle model (LASPM). It simulates the dynamic process of physical spring particle system. The UAVs form a special mobile wireless sensor network. Each UAV works as a highly-dynamic mobile sensor node. Only a few mobile sensor nodes are equipped with GPS localization devices, which are anchor nodes, and the other nodes are blind nodes. The mobile sensor nodes are set as particles with masses and connected with neighbor nodes by virtual springs. The virtual springs will force the particles to move to the original positions. The blind nodes' position can be inferred with the LASPM algorithm. The computational and communication complexity doesn't increase with the network scale size. The proposed algorithm can not only reduce the computational complexity, but also maintain the localization accuracy. The simulation results show the algorithm is effective.

关键词： Computation Complexity localization algorithm Mobile Adhoc Network Spring Particle Model Unmanned Aerial Vehicle Swarm

来源：评论

学校读者我要写书评

暂无评论

RESEARCH OF localization algorithm OF INTERNET OF VEHICLES BASED ON INTELLIGENT TRANSPORTATION 15

RESEARCH OF LOCALIZATION ALGORITHM OF INTERNET OF VEHICLES B...

引用

International Conference on Wavelet Analysis and Pattern Recognition (ICWAPR)

作者： Gu, Mu-Song Miao, Fang Gao, Chao-Bang He, Zi-Shu Fan, Wen-Jie Li, Li Chengdu Univ Coll Informat Sci & Technol Chengdu 610106 Peoples R China Univ Elect Sci & Technol China Sch Elect Sci & Engn Chengdu 611731 Peoples R China

ISBN: (纸本)9781538652183

In the Internet of Vehicles, the real-time localization of vehicles is a very significant problem. The relative position between vehicles as well as between vehicle and Road Side Unit (RSU) is the localization data we are in more need of. When compared with the localization algorithm, the non-ranging technology is mainly adopted. In the research of the non-ranging technology, DVHop algorithm is the algorithm studied the most at present but there still exists problems such as major error of localization. Therefore, we have tried to improve it with the chemical reaction optimization and compare it with the original algorithm. Through the simulation experiment, the localization error of the improved algorithm is far lower than that of the original DVHop algorithm, largely enhancing the precision of localization. These information are valuable virtual assets which will provide more reliable basis for post-period data treatment and decision-making analysis.

关键词： localization algorithm Wireless Sensor Network DVHop algorithm Chemical Reaction Optimization Virtual Assets

来源：评论

学校读者我要写书评

暂无评论

Modified DV-Hop localization algorithm Based on Intersecting Circle and Hops Revaluation 18

Modified DV-Hop Localization Algorithm Based on Intersecting...

引用

3rd International Conference on Intelligent Information Processing (ICIIP)

作者： Yu, Xiuwu Xiao, Renrong Liu, Yong Guo, Qian Li, Xiangyang Liang, Beikong Univ South China State Key Lab Safety & Hlth Met Mines Hunan Engn Res Ctr Uranium Tailings Decommiss & T Hengyang 421001 Peoples R China Univ South China Hengyang 421001 Hunan Peoples R China Univ South China Hunan Engn Res Ctr Uranium Tailings Decommiss & T Hengyang 421001 Peoples R China

ISBN: (纸本)9781450364966

Aiming at the problem that classical DV-Hop localization algorithm has large error in actual positioning, a modified DV-Hop localization algorithm based on intersecting circle and hops revaluation (IHDV-Hop) was proposed. intersecting circle was used and the distance between nodes was obtained by geometric method and random point method;then hops classification was adopted to modify the way estimating minimum hops. The simulation results show that the average localization error of IHDV-Hop was less than DV-Hop when setting the proportion of different anchor nodes, communication radius and total number of nodes, which improved the positioning accuracy.

关键词： Wireless sensor network localization algorithm DV-Hop intersecting circle model hops revaluation

来源：评论

学校读者我要写书评

暂无评论

An Anchor-free localization algorithm for Shopping Carts on Supermarket Internet of Things

An Anchor-free Localization Algorithm for Shopping Carts on ...

引用

2nd International Conference on Computer Science and Network Technology (ICCSNT)

作者： Pei, Zhongmin Li, Yibin Xu, Shuo Shandong Univ Sch Control Sci & Engn Jinan 250100 Peoples R China

ISBN: (纸本)9781467329644;9781467329637

The function and architecture of smart supermarket was studied based on IoT (Internet of Things) technology. An anchor-free localization algorithm for large scale shopping carts was proposed. Specifically, by introducing the procedure of FastMap algorithm, a fast mapping from pairwise proximity matrix between shopping carts to corresponding coordinates was implemented. In this process, location area was divided into different square sub-regions and anchor nodes were placed on the vertex of square as pivot nodes. The output of FastMap algorithm was sent to initialize MDS in order to make stress converge to global minimum quickly. Simulation experiments with 3600 virtual nodes in 600mx600m location area and 10 real shopping carts tests in a supermarket were carried out. All the results show that our algorithm reduces the complexity comparing with classic MDS and random MDS algorithm, also meets the demand of application in supermarket.

关键词： supermarket localization algorithm Internet of Things

来源：评论

学校读者我要写书评

暂无评论

An Improved localization algorithm in Wireless Sensor Networks 4

An Improved Localization Algorithm in Wireless Sensor Networ...

引用

4th International Conference on Intelligent System and Applied Material (GSAM)

作者： Li, Ranran Li, Lei Li, Xiaohui Anhui Univ Minist Educ Key Lab Intelligent Comp & Signal Proc Hefei 230039 Peoples R China

ISBN: (纸本)9783038353140

Min-Max localization algorithm is usually used to acquire the position of a sensor node in wireless sensor networks by the reason of its simpleness and low complexity. However, Min-Max algorithm provides a coarse position estimation. In order to increase its accuracy, an Extended Min-Max (E-Min-Max) algorithm has been proposed. In this paper we focus on this algorithm and propose an improved E-Min-Max algorithm to enhance its accuracy further. Simulations show that the improved E-Min-Max algorithm outperforms its original version in localization.

关键词： localization algorithm accuracy Extended Min-Max

来源：评论

学校读者我要写书评

暂无评论

Comparison of Proactive and Reactive Methods for IP Fast Restoration using localization algorithm

Comparison of Proactive and Reactive Methods for IP Fast Res...

引用

4th International Conference on Signal Processing and Communication Systems (ICSPCS)/12th International Symposium on DSP and Communication Systems (DSPCS)/9th Workshop on the Internet, Telecommunications and Signal Processing (WTSP)

作者： Suzuki, Kazuya Jibiki, Masahiro Yoshida, Kenichi NEC Corp Ltd Syst Platforms Res Labs Kanagawa Japan Univ Tsukuba Grad Sch Business Sci Tokyo Japan

ISBN: (纸本)9781424479078

To shorten the time taken to restore an IP network after a failures, we previously proposed a proactive method that uses a localization algorithm to reduce the number of alternate routing tables in the past study. Although we showed that it shortened the restoration time from failures by switching the routing tables to alternate ones set up for handling the failures, deployability remained a problem to be solved. In this paper, we propose a reactive method that enables the step-by-step deployment through the use of a tunneling technique. It also uses the localization algorithm to decide the tunnel's end-point. Experimental results show its easy deployability and smaller computing resource requirements, such as the number of alternate routing tables and required CPU time, compared with the proactive method. Since the reactive method does not require routing table updates at intermediate nodes, it can restore packet reachabilities faster than the proactive method.

关键词： IP fast restoration IP network IP networks localization algorithm proactive methods reactive methods routing tables telecommunication network routing

来源：评论

学校读者我要写书评

暂无评论

The Geo-n localization algorithm

The Geo-n Localization Algorithm

引用

International Conference on Indoor Positioning and Indoor Navigation (IPIN)

作者： Will, Heiko Hillebrandt, Thomas Kyas, Marcel Free Univ Berlin AG Comp Syst & Telemat Berlin Germany

ISBN: (纸本)9781467319553;9781467319546

We introduce Geo-n, a highly precise, distance-based, general-purpose localization algorithm for use in cluttered and indoor environments, where the estimated distances between an unlocalized node and anchor nodes may contain large errors due to NLOS signal propagation. Geo-n is very resilient to outliers and to a wide range of geometrical constellations of the nodes. Geo-n uses a two stage filtering technique to obtain the most representative intersection points between every pair of circles induced by anchor coordinates and distance measurements and uses these to estimate the position of unlocalized nodes. If no intersection exists between two circles, Geo-n approximates one to further improve localization accuracy. We compare Geo-n to LLS, NLLS, AML, Min-Max, and ICLA using simulations and real world experiments, and show analysis of the spatial distribution of position errors. Results demonstrate that Geo-n outperforms the other algorithms. Like NLLS, its spatial error distribution is very homogeneous. However, Geo-n is much more robust and achieves lower average position error while retaining reasonable computational complexity.

关键词： Indoor localization localization algorithm Radio Runtime Measurement Distance Measurement Wireless Sensor Networks

来源：评论

学校读者我要写书评

暂无评论

A Novel Environment Self-adaptive localization algorithm Based on RSSI for Wireless Sensor Networks

A Novel Environment Self-adaptive Localization Algorithm Bas...

引用

IEEE International Conference on Wireless Communications, Networking and Information Security (WCNIS)

作者： Yi, Xiao Liu, Yu Deng, Lu Naval Aeronaut & Astronaut Univ Res Inst Informat Fus Yantai 264001 Peoples R China

ISBN: (纸本)9781424458516

localization is one of the supporting technologies in wireless sensor networks, and accuracy is a significant criterion to evaluate the practical utility of localization algorithm. The effect of environment parameters like path loss exponent to measurement accuracy in received signal strength indicator (RSSI) is considered in this paper. According to the relationship between distance and received signal power among beacon nodes, least squares method (LSM) is introduced to acquire current environment parameters. Then the estimated distance is converted to an appropriate weight. Finally, the location information of nodes can be calculated out by weighted Centroid localization algorithm (WCLA). Simulation results in MATLAB show that our algorithm (LS-WCLA) has good self-adaptability and robustness.

关键词： Wireless Sensor Networks LSM Self-adaptability localization algorithm

来源：评论

学校读者我要写书评

暂无评论

An Energy Efficient localization algorithm for Wireless Sensor Networks Using a Mobile Anchor Node

An Energy Efficient Localization Algorithm for Wireless Sens...

引用

IEEE International Conference on Information and Automation

作者： Zhang, Baoli Yu, Fengqi Chinese Acad Sci Shenzhen Inst Adv Technol Dept Integrated Elect Shenzhen 518067 Guangdong Peoples R China

ISBN: (纸本)9781424421831

In this paper, we present an energy efficient localization algorithm for wireless sensor networks using a mobile anchor node. It is based on the distance measurement with extra hardware. The mobile node is equipped with a GPS receiver, RF (radio frequency) and ultrasonic transmitter. Each stationary sensor node is equipped with a RF and ultrasonic receiver. The mobile node periodically broadcasts its location information, and stationary sensor nodes take the positions as virtual anchor points. A sensor node's location is computed by measuring the distance to the virtual anchor point using TDOA (time difference of arrival) method. After the first round localization is done, the un-localized sensor nodes can compute their locations with the help of localized stationary sensor nodes. Simulation results show that our proposed localization scheme outperforms the other localization schemes using mobile anchor nodes in energy efficiency and cost.

关键词： localization algorithm mobile anchor node wireless channel sensor network

来源：评论

学校读者我要写书评

暂无评论

Novel Reliable Range-free Geo-localization algorithm in Wireless Networks: Centre of the Smallest Communication Overlap Polygon (CSCOP) 3

Novel Reliable Range-free Geo-localization Algorithm in Wire...

引用

IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)

作者： Demilew, Samuel Asferaw Ejigu, Dejene Da-Costa, Georges Pierson, Jean-Marc Univ Addis Ababa IT Doctoral Program Addis Ababa Ethiopia Univ Toulouse 3 Lab IRIT UMR 5505 Toulouse France

ISBN: (纸本)9781479985050

This paper presents a novel range-free geo-localization algorithm in wireless networks. The algorithm does not require ranging devices. It uses node connectivity to estimate the location of unknown (location unaware) nodes based on two or more anchor (location aware) nodes. The algorithm works in two steps. In the first step, the True Intersection Points (TIPs) that constitute the vertices of the smallest communication overlap polygon (SCOP) of the anchor nodes' communication ranges are found. The second step estimates the location of the unknown node at the center of the SCOP which is formed from these TIPs. The performance is evaluated through MatLab simulation and compares favorably to state-of-the-art algorithms: Centroid, improved version of CPE and Mid-perpendicular localization algorithms. The results show that the proposed algorithm outperforms state-of-the-art algorithms in location accuracy which is a serious drawback of range-free localization methods when compared to range-based.

关键词： range-free localization algorithm anchor nodes true intersection points communication overlap polygon

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：