An effective hotspot mitigation system for Wireless Sensor Networks using hybridized prairie dog with Genetic Algorithm

Wireless Sensor Networks (WSNs) consist of small, multifunctional nodes distributed across various locations to monitor and record parameters. These nodes store data and transmit signals for further processing, forming a crucial topic of study. Monitoring the network's status in WSN applications using clustering systems is essential. Collaboration among sensors from various domains enhances the precision of localised information reporting. However, nodes closer to the data sink consume more energy, leading to hotspot challenges. To address these challenges, this research employs clustering and optimised routing techniques. The aggregation of information involves creating clusters, further divided into sub-clusters. Each cluster includes a Cluster Head (CH) or Sensor Nodes (SN) without a CH. Clustering inherently optimises CHs' capabilities, enhances network activity, and establishes a systematic network topology. This model accommodates both multi-hop and single-hop systems. This research focuses on selecting CHs using a Genetic Algorithm (GA), considering various factors. While GA possesses strong exploration capabilities, it requires effective management. This research uses Prairie Dog Optimization (PDO) to overcome this challenge. The proposed Hotspot Mitigated Prairie with Genetic Algorithm (HM-PGA) significantly improves WSN performance, particularly in hotspot avoidance. With HM-PGA, it achieves a network lifetime of 20913 milliseconds and 310 joules of remaining energy. Comparative analysis with existing techniques demonstrates the superiority of the proposed approach.

A New Random Walk for Replica Detection in WSNs

Wireless Sensor Networks (WSNs) are vulnerable to Node Replication attacks or Clone attacks. Among all the existing clone detection protocols in WSNs, RAWL shows the most promising results by employing Simple Random Walk (SRW). More recently, RAND outperforms RAWL by incorporating Network Division with SRW. Both RAND and RAWL have used SRW for random selection of witness nodes which is problematic because of frequently revisiting the previously passed nodes that leads to longer delays, high expenditures of energy with lower probability that witness nodes intersect. To circumvent this problem, we propose to employ a new kind of constrained random walk, namely Single Stage Memory Random Walk and present a distributed technique called SSRWND (Single Stage Memory Random Walk with Network Division). In SSRWND, single stage memory random walk is combined with network division aiming to decrease the communication and memory costs while keeping the detection probability higher. Through intensive simulations it is verified that SSRWND guarantees higher witness node security with moderate communication and memory overheads. SSRWND is expedient for security oriented application fields of WSNs like military and medical.

Distributed clone detection in static wireless sensor networks: random walk with network division

Wireless Sensor Networks (WSNs) are vulnerable to clone attacks or node replication attacks as they are deployed in hostile and unattended environments where they are deprived of physical protection, lacking physical tamper-resistance of sensor nodes. As a result, an adversary can easily capture and compromise sensor nodes and after replicating them, he inserts arbitrary number of clones/replicas into the network. If these clones are not efficiently detected, an adversary can be further capable to mount a wide variety of internal attacks which can emasculate the various protocols and sensor applications. Several solutions have been proposed in the literature to address the crucial problem of clone detection, which are not satisfactory as they suffer from some serious drawbacks. In this paper we propose a novel distributed solution called Random Walk with Network Division (RWND) for the detection of node replication attack in static WSNs which is based on claimer-reporter-witness framework and combines a simple random walk with network division. RWND detects clone(s) by following a claimer-reporter-witness framework and a random walk is employed within each area for the selection of witness nodes. Splitting the network into levels and areas makes clone detection more efficient and the high security of witness nodes is ensured with moderate communication and memory overheads. Our simulation results show that RWND outperforms the existing witness node based strategies with moderate communication and memory overheads.