A Comparative Study of Range-Free and Range-Based Localization Protocols for Wireless Sensor Network

2020 ◽  
pp. 1522-1537 ◽  
Author(s):  
Essa Qasem Shahra ◽  
Tarek Rahil Sheltami ◽  
Elhadi M. Shakshuki
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Average Distance ◽  
Mobile Node ◽  
Wireless Sensor ◽  
Military Operations ◽  
Localization Algorithms ◽  
Anchor Nodes ◽  
Routing Tables ◽  
Range Free

Wireless Sensor Network is deployed in many fields including military operations, mechanical applications, human services, smart homes, etc. However, deploying WSN encounters many challenges. One of the challenges is localizing the node position, especially mobile targets in critical situations. In this paper, the authors compare two types from range-free localization algorithms and one type from range-based algorithms, namely: Received Signal Strength (RSS), Centroid, and Distance Vector Hop (DV-Hops) protocols, using Cooja simulator. RSS localization algorithms require determining values of the RSS from the anchor nodes around the mobile node, to calculate the distance between the unknown mobile and the first three anchor nodes in the mobile range. The centroid localization requires only three anchors to compute the location of the mobile sensor without the need for distance measuring. Lastly, the DV-Hop algorithm uses routing tables of each anchor in the network topology to compute the Average Distance of Hops. The results show that rang-based algorithms are more accurate than range-free.

A Comparative Study of Range-Free and Range-Based Localization Protocols for Wireless Sensor Network

2017 ◽  
Vol 8 (1) ◽  
pp. 1-16 ◽  
Author(s):  
Essa Qasem Shahra ◽  
Tarek Rahil Sheltami ◽  
Elhadi M. Shakshuki
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Average Distance ◽  
Mobile Node ◽  
Wireless Sensor ◽  
Military Operations ◽  
Localization Algorithms ◽  
Anchor Nodes ◽  
Routing Tables ◽  
Range Free

Wireless Sensor Network is deployed in many fields including military operations, mechanical applications, human services, smart homes, etc. However, deploying WSN encounters many challenges. One of the challenges is localizing the node position, especially mobile targets in critical situations. In this paper, the authors compare two types from range-free localization algorithms and one type from range-based algorithms, namely: Received Signal Strength (RSS), Centroid, and Distance Vector Hop (DV-Hops) protocols, using Cooja simulator. RSS localization algorithms require determining values of the RSS from the anchor nodes around the mobile node, to calculate the distance between the unknown mobile and the first three anchor nodes in the mobile range. The centroid localization requires only three anchors to compute the location of the mobile sensor without the need for distance measuring. Lastly, the DV-Hop algorithm uses routing tables of each anchor in the network topology to compute the Average Distance of Hops. The results show that rang-based algorithms are more accurate than range-free.

Range-Free Localization Algorithm in Wireless Sensor Networks with Asymmetric Links

2013 ◽  
Vol 446-447 ◽  
pp. 1591-1595
Author(s):  
Hong Gang Zhao ◽  
Hao Shan Shi ◽  
Yong Hui Zhao
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Wireless Sensor ◽  
Neighbor Discovery ◽  
Localization Algorithm ◽  
Positioning Accuracy ◽  
Localization Algorithms ◽  
Anchor Nodes ◽  
Asymmetric Links ◽  
Range Free

Good positioning accuracy and coverage are important evaluation criterion for Wireless Sensor Network localization algorithm. DV-HOP is one of the classical range-free localization algorithms, which has good adaptivity and flexibility when node density (ND) and anchor density (AD) are both smaller. However, DV-HOP doesn't consider asymmetric links' influence in heterogeneous network, which is analyzed and proved as the main reason for poor positioning accuracy in DV-HOP. Then a Range-Free Localization Algorithm in Wireless Sensor Network with Asymmetric Links (RLAAL) is proposed, whose kernel mechanisms are Neighbor Discovery Algorithm (NDA) and Least Hops Acquiring Mechanism (LHAM). Every Node uses NDA to find all neighbors and uses LHAM to find least hops to Anchor nodes. Simulation results show that RLAAL can reduce asymmetric links' influence and have better positioning accuracy and coverage than DV-HOP.

Three-Dimensional Wireless Sensor Network Localization Algorithm Based on DV-Hop

2012 ◽  
Vol 155-156 ◽  
pp. 445-449
Author(s):  
Fu Cai Wan ◽  
Yu Ji Shen
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Dimensional Space ◽  
Average Distance ◽  
Three Dimensional ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
External Anchor ◽  
Anchor Nodes ◽  
Improved Algorithm

Node positioning technology in wireless sensor network plays an important role in the whole network, and a lot of scholars engage in this field. According to the background that wireless sensor network is applied in Three-Dimensional space, an improved algorithm is proposed in this paper. The algorithm makes the average distance of each hop more rational through choosing the external anchor nodes. After the achievement of the unknown nodes positioning, initial positioning location would be corrected in order to get a higher positioning accuracy. Simulation results show that the accuracy of the improved algorithm is 13% higher than the traditional DV-Hop algorithm.

scholarly journals IMPERTINENT TRILATERATION: SECURE LOCALIZATION OF WIRELESS SENSOR NETWORK USING GREEDY TECHNIQUE

2013 ◽  
pp. 45-50
Author(s):  
NAYANA NAYANA ◽  
M.B. NIRMALA ◽  
A.S MANJUNATH
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Security Protocol ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Secure Localization ◽  
Localization Algorithms ◽  
Significant Research ◽  
Anchor Nodes ◽  
A New Technique

Wireless sensor network localization is an important area that attracts significant research interest. Current localization algorithms mainly focus to localize as many nodes as possible for a given static set of anchor nodes and distance measurement. In this paper, we discuss a new technique that aims to localize all the sensor nodes in the network using trilateration with greedy technique, and a security protocol is used for providing confidentiality and authentication between anchor nodes and sensor nodes.

scholarly journals An Improvement of Centroid Algorithm Based on Distance in Wireless Sensor Network

2011 ◽  
pp. 28-32
Author(s):  
Mehak Khurana ◽  
Ashishl payal
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Research Problem ◽  
Wireless Sensor ◽  
High Position ◽  
Centroid Algorithm ◽  
Localization Algorithms ◽  
Anchor Nodes ◽  
Exact Position ◽  
Important Research Problem

In Wireless sensor network (WSN), estimating the exact position of sensor node is an important research problem and its location accuracy impacts the efficiency of localization algorithms. In this paper improved centroid range free localization method is proposed and comparison with conventional centroid is done by varying different parameters such as anchor nodes, communication range and node density. The simulation results show the performance of proposed algorithm is superior to that of the conventional centroid algorithm i.e. proposed centroid algorithm has high position accuracy.

scholarly journals Monte Carlo Node Localization Based on Improved QUARTE Optimization

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Ling Song ◽  
Xiaoyu Jiang ◽  
Liying Wang ◽  
Xiaochun Hu
Keyword(s):  
Monte Carlo ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Mobile Node ◽  
Wireless Sensor ◽  
Sampling Area ◽  
Node Localization ◽  
Positioning Accuracy ◽  
Anchor Nodes ◽  
The Impact

Wireless sensor network (WSN) is a research hot spot of scholars in recent years, in which node localization technology is one of the key technologies in the field of wireless sensor network. At present, there are more researches on static node localization, but relatively few on mobile node localization. The Monte Carlo mobile node localization algorithm utilizes the mobility of nodes to overcome the impact of node velocity on positioning accuracy. However, there are still several problems: first, the demand for anchor nodes is large, which makes the positioning cost too high; second, the sampling efficiency is low, and it is easy to fall into the infinite loop of sampling and filtering; and third, the positioning accuracy and positioning coverage are not high. In order to solve the above three problems, this paper proposes a Monte Carlo node location algorithm based on improved QUasi-Affine TRansformation Evolutionary (QUATRE) optimization. The algorithm firstly selects the high-quality common nodes in the range of one hop of unknown nodes as temporary anchor nodes, and takes the temporary anchor nodes and anchor nodes as the reference nodes for positioning, so as to construct a more accurate sampling area; then, the improved QUATRE optimization algorithm is used to obtain the estimated location of unknown nodes in the sampling area. Simulation experiments show that the Monte Carlo node positioning algorithm based on the improved QUATRE optimization has higher positioning accuracy and positioning coverage, especially when the number of anchor nodes is relatively small.

scholarly journals Overcoming Localization Errors due to Node Power Drooping in a Wireless Sensor Network

2011 ◽  
Vol 57 (3) ◽  
pp. 341-346 ◽  
Author(s):  
Safdar Khan ◽  
Boubaker Daachi ◽  
Karim Djouani
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Vital Role ◽  
Position Estimation ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Battery Voltage ◽  
Localization Errors ◽  
Anchor Nodes ◽  
Received Signal Strength Indication

Overcoming Localization Errors due to Node Power Drooping in a Wireless Sensor NetworkReceived Signal Strength Indication (RSSI) plays a vital role in the range-free localization of sensor nodes in a wireless sensor network and a good amount of research has been made in this regard. One important factor is the battery voltage of the nodes (i.e., the MICAz sensors) which is not taken into account in the existing literature. As battery voltage level performs an indispensable role for the position estimation of sensor nodes through anchor nodes therefore, in this paper, we take into a account this crucial factor and propose an algorithm that overcomes the problem of decaying battery. We show the results, in terms of more precise localization of sensor nodes through simulation. This work is an extension to [1] and now we also use neural network to overcome the localization errors generated due to gradual battery voltage drooping.

Sign in / Sign up

Export Citation Format

Share Document