ELPMA: Efficient Localization Algorithm Based Path Planning for Mobile Anchor in Wireless Sensor Network

2018 ◽  
Vol 100 (3) ◽  
pp. 721-744 ◽  
Author(s):  
Bassam Faiz Gumaida ◽  
Juan Luo
Keyword(s):  
Wireless Sensor Network ◽  
Path Planning ◽  
Sensor Network ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Mobile Anchor

scholarly journals V2X-Based Mobile Localization in 3D Wireless Sensor Network

2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Iram Javed ◽  
Xianlun Tang ◽  
Kamran Shaukat ◽  
Muhammed Umer Sarwar ◽  
Talha Mahboob Alam ◽  
...  
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Three Dimensional ◽  
Link Quality ◽  
Wireless Sensor ◽  
Localization Error ◽  
Localization Algorithm ◽  
Position Information ◽  
Mobile Anchor ◽  
Anchor Nodes

In a wireless sensor network (WSN), node localization is a key requirement for many applications. The concept of mobile anchor-based localization is not a new concept; however, the localization of mobile anchor nodes gains much attention with the advancement in the Internet of Things (IoT) and electronic industry. In this paper, we present a range-free localization algorithm for sensors in a three-dimensional (3D) wireless sensor networks based on flying anchors. The nature of the algorithm is also suitable for vehicle localization as we are using the setup much similar to vehicle-to-infrastructure- (V2I-) based positioning algorithm. A multilayer C-shaped trajectory is chosen for the random walk of mobile anchor nodes equipped with a Global Positioning System (GPS) and broadcasts its location information over the sensing space. The mobile anchor nodes keep transmitting the beacon along with their position information to unknown nodes and select three further anchor nodes to form a triangle. The distance is then computed by the link quality induction against each anchor node that uses the centroid-based formula to compute the localization error. The simulation shows that the average localization error of our proposed system is 1.4 m with a standard deviation of 1.21 m. The geometrical computation of localization eliminated the use of extra hardware that avoids any direct communication between the sensors and is applicable for all types of network topologies.

scholarly journals Anchor Movement Strategy for Conjecture Geometry Based Localization Scheme in Wireless Sensor Network

2016 ◽  
Vol 5 (4) ◽  
pp. 255
Author(s):  
Niraj Bhupal Kapase ◽  
Santosh P Salgar ◽  
Mahesh K Patil ◽  
Prashant P Zirmite
Keyword(s):  
Wireless Sensor Network ◽  
Path Planning ◽  
Sensor Network ◽  
Sensor Node ◽  
Wireless Sensor ◽  
Localization Error ◽  
Anchor Node ◽  
Mobile Anchor ◽  
Movement Strategy ◽  
Mobile Anchor Node

<p class="Abstract"><em>Abstract</em>—Localization of sensor node with least error is one of the major concern in wireless sensor network as some of the application require sensor node to know their location with high degree of precision. For mobile anchor based localization many of the path planning schemes already developed which includes scan, double scan, Circles &amp; S- Curves. These path planning schemes have some limitations like localization error, Number of sensor nodes covered in the network, Trajectory length of mobile anchor node.  This paper represents anchor movement strategy which is based on Scan path, with modifications are made in such a way that it satisfies the requirements of localization scheme.  This movement strategy ensures that trajectory of mobile anchor node will minimize localization error and also will cover majority of sensor node in the environment. The localization error yielded by Modified Scan algorithm is in the range of 0.2 to 0.4m which is quite lower than the other existing mentioned path planning strategies producing localization error in the range 0.6 to 1.8m</p><p class="keywords">Keywords—Localization; Mobile anchor node; Wireless sensor network; Modified Scan algorithm</p>

Sign in / Sign up

Export Citation Format

Share Document