scholarly journals MiA-CODER: A Multi-Intelligent Agent-Enabled Reinforcement Learning for Accurate Coverage Hole Detection and Recovery in Unequal Cluster-Tree-Based QoSensing WSN

2021 ◽  
Vol 11 (23) ◽  
pp. 11134
Author(s):  
Luis Orlando Philco ◽  
Luis Marrone ◽  
Emily Estupiñan
Keyword(s):  
Reinforcement Learning ◽  
Energy Consumption ◽  
Intelligent Agent ◽  
Sleep Mode ◽  
Cluster Tree ◽  
Coverage Hole ◽  
Coverage Holes ◽  
Effective Transmission ◽  
Coverage Hole Detection ◽  
Hole Detection

Coverage is an important factor for the effective transmission of data in the wireless sensor networks. Normally, the formation of coverage holes in the network deprives its performance and reduces the lifetime of the network. In this paper, a multi-intelligent agent enabled reinforcement learning-based coverage hole detection and recovery (MiA-CODER) is proposed in order to overcome the existing challenges related to coverage of the network. Initially, the formation of coverage holes is prevented by optimizing the energy consumption in the network. This is performed by constructing the unequal Sierpinski cluster-tree topology (USCT) and the cluster head is selected by implementing multi-objective black widow optimization (MoBWo) to facilitate the effective transmission of data. Further, the energy consumption of the nodes is minimized by performing dynamic sleep scheduling in which Tsallis entropy enabled Bayesian probability (TE2BP) is implemented to switch the nodes between active and sleep mode. Then, the coverage hole detection and repair are carried out in which the detection of coverage holes if any, both inside the cluster and between the clusters, is completed by using the virtual sector-based hole detection (ViSHD) protocol. Once the detection is over, the BS starts the hole repair process by using a multi-agent SARSA algorithm which selects the optimal mobile node and replaces it to cover the hole. By doing so, the coverage of the network is enhanced and better QoSensing is achieved. The proposed approach is simulated in NS 3.26 and evaluated in terms of coverage rate, number of dead nodes, average energy consumption and throughput.

scholarly journals Efficient Coverage Hole Detection Algorithm Based on the Simplified Rips Complex in Wireless Sensor Networks

2020 ◽  
Vol 2020 ◽  
pp. 1-13
Author(s):  
Jing Zhang ◽  
Han Chu ◽  
Xin Feng
Keyword(s):  
Wireless Sensor Networks ◽  
Detection Algorithm ◽  
Wireless Sensor ◽  
Detection Accuracy ◽  
High Complexity ◽  
Rips Complex ◽  
Coverage Hole ◽  
Coverage Holes ◽  
Coverage Hole Detection ◽  
Hole Detection

The appearance of coverage holes in the network leads to transmission links being disconnected, thereby resulting in decreasing the accuracy of data. Timely detection of the coverage holes can effectively improve the quality of network service. Compared with other coverage hole detection algorithms, the algorithms based on the Rips complex have advantages of high detection accuracy without node location information, but with high complexity. This paper proposes an efficient coverage hole detection algorithm based on the simplified Rips complex to solve the problem of high complexity. First, Turan’s theorem is combined with the concept of the degree and clustering coefficient in a complex network to classify the nodes; furthermore, redundant node determination rules are designed to sleep redundant nodes. Second, according to the concept of the complete graph, redundant edge deletion rules are designed to delete redundant edges. On the basis of the above two steps, the Rips complex is simplified efficiently. Finally, from the perspective of the loop, boundary loop filtering and reduction rules are designed to achieve coverage hole detection in wireless sensor networks. Compared with the HBA and tree-based coverage hole detection algorithm, simulation results show that the proposed hole detection algorithm has lower complexity and higher accuracy and the detection accuracy of the hole area is up to 99.03%.

scholarly journals Homology-Based Distributed Coverage Hole Detection in Wireless Sensor Networks

2015 ◽  
Vol 23 (6) ◽  
pp. 1705-1718 ◽  
Author(s):  
Feng Yan ◽  
Anais Vergne ◽  
Philippe Martins ◽  
Laurent Decreusefond
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Coverage Hole ◽  
Coverage Hole Detection ◽  
Hole Detection

scholarly journals Hole Detection for Quantifying Connectivity in Wireless Sensor Networks: A Survey

2014 ◽  
Vol 2014 ◽  
pp. 1-11 ◽  
Author(s):  
Pearl Antil ◽  
Amita Malik
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Future Research ◽  
Detection Algorithms ◽  
Coverage Hole ◽  
Future Research Directions ◽  
Detection Schemes ◽  
Coverage Hole Detection ◽  
Hole Detection

Owing to random deployment, environmental factors, dynamic topology, and external attacks, emergence of holes in wireless sensor networks is inescapable. Hole is an area in sensor network around which sensors cease to sense or communicate due to drainage of battery or any fault, either temporary or permanent. Holes impair sensing and communication functions of network; thus their identification is a major concern. This paper discusses different types of holes and significance of hole detection in wireless sensor networks. Coverage hole detection schemes have been classified into three categories based on the type of information used by algorithms, computation model, and network dynamics for better understanding. Then, relative strengths and shortcomings of some of the existing coverage hole detection algorithms are discussed. The paper is concluded by highlighting various future research directions.

Sign in / Sign up

Export Citation Format

Share Document