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

Abstract

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.