Maximizing the sensor cover from randomly deployed sensors to provide k-target coverage, is a challenging problem in Wireless Sensor Network (WSN). In this paper, an improved cuckoo search algorithm is proposed to determine the sensor covers by optimizing the sensing range of the sensors to reduce the redundancy in the network. The proposed algorithm partitions the sensor set into non-disjoint subsets with varying sensing range such that each cover provides k-coverage in the network. The activation of each cover, one after the other increases the lifetime of the network. The efficiency of the proposed algorithm is estimated using the simulations results.
21 January 2020 in Wireless Personal Communications
The Internet of Things (IoT) has become widely popular due to its rapid progress and broad range of practical uses, which have significantly impacted our daily lives. One such key utilization of IoT is making consumer electronics interactive, interconnected and self-responsible by means of sensors and internet. Sensors play a crucial role as the primary technology that enables the Internet of Things (IoT) and its various applications. The inherent difficulty hinders the further growth of IoT. One such problem is utilizing minimum number of sensors to achieve maximum coverage and connectivity in the network. The most accurate method to encounter this issue is optimal Sensor Placement (OSP). OSP predetermines the sensor’s position for its deployment to attain maximum network coverage and connectivity. Hence, this paper proposes a coverage and connectivity-preserving hierarchical algorithm based on discrete Haar wavelet transform for optimal sensor placement algorithm. The proposed algorithm utilizes discrete Haar wavelet transform, for identifying sensor’s position and to ensure connectivity Breadth first search algorithm is used. Further, to enhance the coverage, proposed algorithm determines redundant sensors and redeploy it in determined spots. The results obtained from the proposed algorithm effectively address the research problem and attain better results compared with the existing efficient methods.
Wireless Sensor Networks (WSNs) are widely used in urban and commercial sectors to collect information over a substantial region using intelligent inter-linked sensors. The deployment of excessive number of sensors leads to data redundancy and consumes more energy. An Efficient number of required sensors with optimal position for a certain region contains predefined set of targets, maximizes the WSN lifetime and minimizes redundancy of sensors. Hence in this study, a Grundy Number-based Deterministic Sensor Deployment (GN-DSD) algorithm is proposed to identify the sensor requirement based on target’s spatial coordinates and the optimal sensors coordinates to resolve Q-coverage problem in 3D-terrain. To enhance the connectivity of WSN a relay node deployment method is proposed with Breadth First Search approach. The performance of proposed algorithm is tested by a series of simulation with varying the parameters, and a statistical analysis is performed using Analysis of Variance (ANOVA) and Fisher’s Least Significant Difference (LSD) Post-Hoc test.