Node localization in wireless sensor networks using a hyper-heuristic DEEC-Gaussian gradient distance algorithm

Abstract

In the recent age of technological advancements, wireless sensor networks are an important application for smart modernized environments. In WSNs, node localization has been an issue for over a decade in the research community. One of the goals of localization in a wireless sensor network is to localize sensor nodes in a two-dimensional plane. Localization in wireless sensor networks helps to supply information to aid decision-making from the aggregated data that are sent from packets to base stations. Internet of Things with the use of Global Positioning Systems for tracking sensor zones is not a cost-effective means of solution. In the extant literature, there have been a variety of algorithms to identify unknown sensor locations in wireless sensor networks. This research paper aims to address the problem of determining the location of the sensor node at the base station with minimum localization error when the data between the nodes is transmitted wirelessly. To detect the location of an unknown sensor node packets sent to the destinations, the total number of anchor nodes, location error and distance estimation error were considered. The DEEC-Gauss Gradient Distance Algorithm has a lower localization error than the Weighted Centroid Localizations algorithm, Compensation Coefficient algorithm, DV-Hop algorithm, Weighted Hyperbolic algorithm and Weighted Centroid algorithm for the same ratio of anchor nodes and WSN configuration. According to the study's findings, the DGGDEA has an average localization error of 11% for anchor nodes (20-80), and an average localization error of 11.3% for anchor nodes 200-450. Hence, the DEEC-Gaussian Gradient Distance Elimination Algorithm (DGGDEA) showed higher accuracy with comparison to the modern-day approaches.