A Comparison of Distributed Range Free Localization Algorithms in Wireless Sensor Networks (original) (raw)

Comparative evaluation of localization range-free algorithms in wireless sensor networks

International Journal of Engineering, Science and Technology &b. Lagos, 2024

Localization in wireless sensor networks is essential not only for determining the location but also for routing, managing density, tracking, and a wide range of other communication network functions. There are two main categories of localization algorithms in wireless sensor networks: range-based algorithms and range-free techniques. Localization based on range-free algorithms has benefits in terms of requiring less hardware and energy, making it cost-efficient. This paper examines the impact of beacon nodes on range-free localization algorithms. The findings indicate that ADLA has intermediate localization errors and the best detecting nodes. It also addresses the effect of the number of locators on the algorithm's efficiency. The findings demonstrate that as the number of locators increased, the number of detected nodes in Centroid also increased. Compared to Centroid, ADLA has the second-best detecting nodes but with better average error. Moreover, it considers the impact of the number of static nodes on range-free localization algorithms, and ADLA achieved the best detection nodes. According to the evaluated results, this paper proposes a hybrid algorithm that combines the Centroid algorithm and Active Distributed Localization Algorithm (ADLA) algorithm. However, combining these two algorithms results in less localization error.

Performance and Accuracy Analysis of Range-free Localization Algorithms in Wireless Sensor Network

2016

Wireless sensor networks (WSN) are widely used in many environments to perform various monitoring tasks. In many such tasks, node location exists as permanent system parameter and to determine the exact position or location of sensor nodes in WSN is a big challenge to achieve. To achieve this challenge, various algorithms have been implemented to provide better accuracy even if anchor node density is less. The first aim of the survey is to explore various proposed techniques second is to compare their performance with their traditional techniques based on the anchor density and third is project which all improvements leads to the low localization error.

Wireless Sensor Network Localization Techniques Performance

Engineering and technology journal, 2023

A large number of inexpensive, small sensors make up a wireless sensor network. The collection and transmission of data is one of the crucial functions of a sensor network. In the greater part of the applications, it is of much interest to figure out the area of the information. Localization methods can be used to obtain this kind of information. Therefore, node localization is very important when using localization algorithms to determine the position of a node. As a result, WSN node localization emerges as one of the primary obstacles. The localization schemes can be broadly divided into two groups based on range measurements, such as: range based and range free plans. Range-based localization techniques cannot be used due to the sensing node's hardware limitations and high cost. Since coarse accuracy is sufficient for most sensor network applications, range-free schemes are being considered an alternative. The performances and accuracy of the range-free algorithms were tested with the application of MATLAB 2017a. The results demonstrated that the amorphous algorithm has the lowest localization error in most cases in comparison to the performance of these four algorithms. Likewise, results demonstrated amorphous, and DV-hop algorithms have 100% coverage rate in every situation that were tested.

Classification and Comparison of Range-Based Localization Techniques in Wireless Sensor Networks

Journal of Communications

For the majority of the applications of WSNs, it is desirable to know the location of sensors. In WSNs, for obtaining this kind of information we need localization schemes. Localization techniques are used to determine the geographical position of sensor nodes. The position parameters of sensor nodes are also useful for many operations for network management, such as routing process, topology control, and security maintenance. So, it is very important that every node should reports its location information very accurately. As we know that GPS is very accurate in location determination but it is expensive in terms of cost and energy of nodes, so it is not useful in WSNs. There are so many localization techniques, including range-based and range-free, have been proposed to calculate positions for randomly deployed sensor nodes. Accuracy of localization techniques is most important before implementing it. With specific hardware, the range-based schemes typically achieve high accuracy based on either nodeto-node distances or angles. In this paper, our main focus is on the range-based localization. Precisely, in order to helps the network designers to find out which techniques/algorithms are suitable for their applications, the most popular range-based localization techniques are classified and compared.

Localization Techniques for Wireless Sensor Networks: A Review

Wireless sensor networks (WSNs) have recently emerges as promising technology in wireless communication field and gained special attention by research groups. It uses small and cheap gadgets with low energy requirements and limited on board computing resourceswhich communicates with each other's or base stations without any pre-defined infrastructure. The property of being infrastructure less makes it suitable in distinctive application situations including remotemonitoring, disaster management, military applications and biomedical health observing devices. In many of these applications, node localization is unavoidably one of the important system parameters for example in target tracking if the nodes are not able to obtain the accurate location information, the related task cannot be performed.It is also helpful in routing, network coverage and quarry management of sensors. In general the localization techniques are ordered into two general classifications: range based and range free. In this paper, we discussed the various localization algorithms with their applicable areas, requirements and limitations. Moreover, on conclusion we compare these localization algorithms and analyze the future research directions for the localization algorithms in WSNs.

A Review on Localization Algorithms in Wireless Sensor Networks

2014

In wireless sensor networks (WSNs), nodes are deployed in sensor fields for monitoring and controlling the physical environments. Node localization is fundamental challenge in wireless sensor networks as without knowing the location of nodes sensed information will have no value. Therefore, it is vital that nodes must know their location. This paper provides a review of basic techniques for localization. The localization algorithms are classified into GPS based or GPS free, Anchor based or Anchor free, Centralized or Distributed and Range based or range free. Paper further discusses limitations of each of the algorithms.

CP-NR Distributed Range Free Localization Algorithm in WSN

International Journal of Advances in Applied Sciences (IJAAS), 2018

Advancements in wireless communication technology have empowered the researchers to develop large scale wireless networks with huge number of sensor nodes. In these networks localization is very active field of research. Localization is a way to determine the physical position of sensor nodes which is useful in many aspects such as to find the origin of events, routing and network coverage. Locating nodes with GPS systems is expensive, power consuming and not applicable to indoor environments. Localization in three dimensional space and accuracy of the estimated location are two factors of major concern. In this paper, a new three dimensional Distributed range-free algorithm which is known as CP-NR is proposed. This algorithm has high localization accuracy and resolved the problem of existing NR algorithm. CP-NR (Coplanar and Projected Node Reproduction) algorithm makes use of co-planarity and projection of point on plane concepts to reduce the localization error. Results have shown that CP-NR algorithm is superior to NR algorithm and comparison is done for the localization accuracy with respect to variations in range, anchor density and node density.

Localization algorithms of Wireless Sensor Networks: a survey

Telecommunication Systems

In Wireless Sensor Networks (WSNs), localization is one of the most important technologies since it plays a critical role in many applications, e.g., target tracking. If the users cannot obtain the accurate location information, the related applications cannot be accomplished. The main idea in most localization methods is that some deployed nodes (landmarks) with known coordinates (e.g., GPS-equipped nodes) transmit beacons with their coordinates in order to help other nodes localize themselves. In general, the main localization algorithms are classified into two categories: range-based and range-free. In this paper, we reclassify the localization algorithms with a new perspective based on the mobility state of landmarks and unknown nodes, and present a detailed analysis of the representative localization algorithms. Moreover, we compare the existing localization algorithms and analyze the future research directions for the localization algorithms in WSNs.

Localization Techniques for Wireless Sensor Networks

2015

Wireless sensor networks (WSNs) have recently emerges as promising technology in wireless communication field and gained special attention by research groups. It uses small and cheap gadgets with low energy requirements and limited on board computing resourceswhich communicates with each other’s or base stations without any pre-defined infrastructure. The property of being infrastructure less makes it suitable in distinctive application situations including remotemonitoring, disaster management, military applications and biomedical health observing devices. In many of these applications, node localization is unavoidably one of the important system parameters for example in target tracking if the nodes are not able to obtain the accurate location information, the related task cannot be performed.It is also helpful in routing, network coverage and quarry management of sensors. In general the localization techniques are ordered into two general classifications: range based and range fr...

2011 Localization algorithms of Wireless Sensor Networks a survey (TS 2011)

A Comparison of Distributed Range Free Localization Algorithms in Wireless Sensor Networks (original) (raw)

Related papers