Localization algorithms research in wireless sensor network based on Multilateration and Trilateration techniques

2014 ◽  
Author(s):  
Labyad Asmaa ◽  
Kharraz Aroussi Hatim ◽  
Mouloudi Abdelaaziz
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Wireless Sensor ◽  
Localization Algorithms

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 Localization Algorithm for Wireless Sensor Network Based on the Weighted Correction in Geometric Measurement

2015 ◽  
Vol 740 ◽  
pp. 823-829
Author(s):  
Meng Long Cao ◽  
Chong Xin Yang
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Signal Strength ◽  
Received Signal Strength ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Received Signal Strength Indicator ◽  
Localization Algorithms ◽  
Weighted Centroid Localization ◽  
Geometric Measurement

Firstly, the characteristics of regular Zigbee localization algorithms-the received signal strength indicator algorithm (RSSI) and the weighted centroid localization algorithm are introduced. Then, the factors of the errors existing in the aforementioned algorithms are analyzed. Based on these above, the improved RSSI algorithm-correction geometric measurement based on weighted is proposed. Finally, utilizing this algorithm to design and implement the localization nodes, which have the CC2431 wireless microcontroller on them. The simulation and experimental results show that the accuracy of this localization algorithm improved about 2%, comparing with the regular algorithms.

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.

scholarly journals A Study on Localization in Wireless Sensor Network Using Neural Network

2018 ◽  
Vol 7 (S1) ◽  
pp. 50-53
Author(s):  
K. Madhumathi . ◽  
T. Suresh .
Keyword(s):  
Neural Network ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Disaster Management ◽  
Low Cost ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Localization Algorithms ◽  
Spatially Distributed ◽  
Pros And Cons

Wireless Sensor Network consists of large number of autonomous, small, low cost sensor nodes that are spatially distributed in areas of investigation like disaster management, Military, environmental monitoring etc. The main purpose of using those nodes is to collect information from source and process it in destination. But the data received in the destination are useless unless the exact location of source is not known. The task of finding physical coordinates of these sensor nodes in WSNs area is known as localization. One solution for the above problem is manual configuration of sensor but it is unfeasible if the area of deployment is large or inaccessible. Therefore, we use localization techniques which help to capture the location of nodes in wireless sensor network. This study analyses localization algorithms with their pros and cons.

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.

Identification and Localization of the Jammer in Wireless Sensor Networks

2019 ◽  
Vol 62 (10) ◽  
pp. 1515-1527
Author(s):  
Jianhua Fan ◽  
Tao Liang ◽  
Tongxiang Wang ◽  
Jianwei Liu
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Mean Value ◽  
Wireless Channel ◽  
Wireless Sensor ◽  
Localization Algorithms ◽  
Straight Line ◽  
Propagation Parameters ◽  
The Mean ◽  
Normal Transmission

Abstract Wireless sensor network can be easily attacked by jammers for its shared character and open access to the wireless channel. Jamming attack could produce a significant threat to the network by interrupting the normal transmission of nodes. To this end, several anti-jamming countermeasures have been proposed to improve the quality of service of the wireless sensor network. As an important building block for anti-jamming countermeasures, the estimation of jammer’s location could provide us a possible way to eliminate jammers artificially. However, existing localization algorithms mainly pay attention to locate the jammers that are equipped with omnidirectional antennas, which usually fail to cope with directional jammers. In order to bridge this gap, an algorithm of antenna identification and localization of the jammer (AILJ) based on the topology information of jamming scenarios is put forward in this paper. At first, a collection protocol is designed to collect the information of boundary nodes and jammed nodes. Then, an identification method based on the classification of the boundary nodes is proposed to derive the type of jammer’s antenna. At last, a range-free method is put forward to locate the jammer without relying on the propagation parameters. The proposed AILJ only depends on the localization of jammed nodes and boundary nodes and employs their geometry knowledge. For the omnidirectional jammer, the mean center of two circumcircles is considered as the jammer’s position. For the directional jammer, the mean value of the intersections between the straight line that represents jammer’s direction and the circumcircles is considered as the directional jammer’s position. Finally, a series of experiments have been conducted to evaluate the identification and localization performance of AILJ.

scholarly journals Survey of Localizations Algorithms in Underwater Wireless Sensor Network

2021 ◽  
pp. 403-409
Author(s):  
Sitanshu Kumar ◽  
Dr. Sunil Rathod
Keyword(s):  
Wireless Sensor Networks ◽  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Sensor Network ◽  
Optimization Algorithm ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Underwater Wireless Sensor Networks ◽  
Sensing Element ◽  
Localization Algorithms

The main objective of this research paper is to review and analyze the different existing localization algorithms techniques that are used to overcome the localization issue in the wireless sensor network. Underwater Wireless sensor networks consists up of small sensor nodes that are placed in huge quantity over a large water surface region to perform several tasks like sensing the data and communicate with other devices. Most of the applications of underwater wireless sensor networks like forest fire detection required the exact position of the sensing element. The main motive of the localization process is to localize the coordinates to the every node with unidentified location in the sensing area of underwater. In this paper, we have discussed various localization algorithms for localizing the sensor nodes like particle swarm optimization; bees optimization algorithm, bat algorithm, cuckoo optimization and butterfly optimization algorithm etc. are reviewed. The detail analysis of these techniques in terms of localization error, computation time and amount of localized nodes has been discussed in this paper.

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.

Sign in / Sign up

Export Citation Format

Share Document