An Energy-Efficient and Distributed Cooperation Mechanism for k-Coverage Hole Detection and Healing in WSNs

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%.

Download Full-text

Coverage Hole Detection Algorithm Based on Cooperative Probability Coverage in Wireless Sensor Networks

2018 5th IEEE International Conference on Cloud Computing and Intelligence Systems (CCIS) ◽

10.1109/ccis.2018.8691183 ◽

2018 ◽

Author(s):

Ying Tian ◽

Xiaoheng Chang ◽

Yang Ou ◽

Yi Jiang

Keyword(s):

Wireless Sensor Networks ◽

Sensor Networks ◽

Detection Algorithm ◽

Wireless Sensor ◽

Coverage Hole ◽

Coverage Hole Detection ◽

Hole Detection

Download Full-text

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

Journal of Computer Networks and Communications ◽

10.1155/2014/969501 ◽

2014 ◽

Vol 2014 ◽

pp. 1-11 ◽

Cited By ~ 6

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.

Download Full-text