Mobile anchor nodes path planning algorithms using network-density-based clustering in wireless sensor networks

2017 ◽  
Vol 85 ◽  
pp. 64-75 ◽  
Author(s):  
Guangjie Han ◽  
Chenyu Zhang ◽  
Jinfang Jiang ◽  
Xuan Yang ◽  
Mohsen Guizani
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Path Planning ◽  
Wireless Sensor ◽  
Network Density ◽  
Density Based Clustering ◽  
Mobile Anchor ◽  
Anchor Nodes ◽  
Planning Algorithms

Path planning for multiple mobile anchor nodes assisted localization in wireless sensor networks

Measurement ◽  
2019 ◽  
Vol 141 ◽  
pp. 124-136 ◽  
Author(s):  
Supeng Sun ◽  
Jianping Zhao ◽  
Xiaochuan Tian ◽  
Jing Zhang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Path Planning ◽  
Wireless Sensor ◽  
Mobile Anchor ◽  
Anchor Nodes

A Novel Static Path Planning Method for Mobile Anchor-Assisted Localization in Wireless Sensor Networks

2020 ◽  
Vol 10 ◽  
Author(s):  
Abdelhady M. Naguib ◽  
Shahzad Ali
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Path Planning ◽  
Sensor Node ◽  
Large Scale ◽  
Performance Metrics ◽  
Wireless Sensor ◽  
Anchor Node ◽  
Mobile Anchor ◽  
Planning Methods

Background: Many applications of Wireless Sensor Networks (WSNs) require awareness of sensor node’s location but not every sensor node can be equipped with a GPS receiver for localization, due to cost and energy constraints especially for large-scale networks. For localization, many algorithms have been proposed to enable a sensor node to be able to determine its location by utilizing a small number of special nodes called anchors that are equipped with GPS receivers. In recent years a promising method that significantly reduces the cost is to replace the set of statically deployed GPS anchors with one mobile anchor node equipped with a GPS unit that moves to cover the entire network. Objectives: This paper proposes a novel static path planning mechanism that enables a single anchor node to follow a predefined static path while periodically broadcasting its current location coordinates to the nearby sensors. This new path type is called SQUARE_SPIRAL and it is specifically designed to reduce the collinearity during localization. Results: Simulation results show that the performance of SQUARE_SPIRAL mechanism is better than other static path planning methods with respect to multiple performance metrics. Conclusion: This work includes an extensive comparative study of the existing static path planning methods then presents a comparison of the proposed mechanism with existing solutions by doing extensive simulations in NS-2.

scholarly journals Path planning using a mobile anchor node based on trilateration in wireless sensor networks

2011 ◽  
Vol 13 (14) ◽  
pp. 1324-1336 ◽  
Author(s):  
Guangjie Han ◽  
Huihui Xu ◽  
Jinfang Jiang ◽  
Lei Shu ◽  
Takahiro Hara ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Path Planning ◽  
Wireless Sensor ◽  
Anchor Node ◽  
Mobile Anchor ◽  
Mobile Anchor Node

scholarly journals Trilateration based localization method using mobile anchor in wireless sensor networks

2020 ◽  
Vol 9 (1) ◽  
pp. 34
Author(s):  
M.G. Kavitha ◽  
Vinoth Kumar Kalimuthu ◽  
T. Jayasankar
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Future Research ◽  
Localization Algorithm ◽  
Localization Method ◽  
Coverage Ratio ◽  
Movement Trajectories ◽  
Mobile Anchor ◽  
Anchor Nodes

<p><span>Localization in wireless sensor networks (WSNs) is essential in many applications like target tracking, military applications and environmental monitoring. Anchors which are equipped with global positioning system (GPS) facility are useful for finding the location information of nodes. These anchor nodes may be static or dynamic in nature. In this paper, we propose mobile anchors assisted localization algorithm based on regular hexagons in two-dimensional WSNs. We draw a conclusion that the number of anchor nodes greatly affect the performance of localization in a WSN. An optimal number of anchor nodes significantly reduces the localization error of unknown nodes and also guarantees that unknown nodes can obtain high localization accuracy. Because of the mobility of anchor nodes high volume of sensing region is covered with less period of time and hence the coverage ratio of the proposed algorithm increases. Number of communications also decreases for the reason that the system contains log<sub>e</sub> (n) number of anchor nodes which leads to less energy consumption at nodes. Simulation results show that our LUMAT algorithm significantly outperforms the localization method containing single anchor node in the network. Movement trajectories of mobile anchors should be designed dynamically or partially according to the observable environment or deployment situations to make full use of real-time information during localization. This is the future research issue in the area of mobile anchor assisted localization algorithm.</span></p>

Sign in / Sign up

Export Citation Format

Share Document