Efficient Coverage Hole Detection Algorithm Based on the Simplified Rips Complex in Wireless Sensor Networks
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,...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2020-01-01
|
Series: | Journal of Sensors |
Online Access: | http://dx.doi.org/10.1155/2020/3236970 |
id |
doaj-2fb069cd45d9436db1d0dc83fcd5d248 |
---|---|
record_format |
Article |
spelling |
doaj-2fb069cd45d9436db1d0dc83fcd5d2482020-11-25T03:35:37ZengHindawi LimitedJournal of Sensors1687-725X1687-72682020-01-01202010.1155/2020/32369703236970Efficient Coverage Hole Detection Algorithm Based on the Simplified Rips Complex in Wireless Sensor NetworksJing Zhang0Han Chu1Xin Feng2College of Computer Science And Technology, Changchun University of Science and Technology, Changchun 130022, ChinaCollege of Computer Science And Technology, Changchun University of Science and Technology, Changchun 130022, ChinaCollege of Computer Science And Technology, Changchun University of Science and Technology, Changchun 130022, ChinaThe 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%.http://dx.doi.org/10.1155/2020/3236970 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Jing Zhang Han Chu Xin Feng |
spellingShingle |
Jing Zhang Han Chu Xin Feng Efficient Coverage Hole Detection Algorithm Based on the Simplified Rips Complex in Wireless Sensor Networks Journal of Sensors |
author_facet |
Jing Zhang Han Chu Xin Feng |
author_sort |
Jing Zhang |
title |
Efficient Coverage Hole Detection Algorithm Based on the Simplified Rips Complex in Wireless Sensor Networks |
title_short |
Efficient Coverage Hole Detection Algorithm Based on the Simplified Rips Complex in Wireless Sensor Networks |
title_full |
Efficient Coverage Hole Detection Algorithm Based on the Simplified Rips Complex in Wireless Sensor Networks |
title_fullStr |
Efficient Coverage Hole Detection Algorithm Based on the Simplified Rips Complex in Wireless Sensor Networks |
title_full_unstemmed |
Efficient Coverage Hole Detection Algorithm Based on the Simplified Rips Complex in Wireless Sensor Networks |
title_sort |
efficient coverage hole detection algorithm based on the simplified rips complex in wireless sensor networks |
publisher |
Hindawi Limited |
series |
Journal of Sensors |
issn |
1687-725X 1687-7268 |
publishDate |
2020-01-01 |
description |
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%. |
url |
http://dx.doi.org/10.1155/2020/3236970 |
work_keys_str_mv |
AT jingzhang efficientcoverageholedetectionalgorithmbasedonthesimplifiedripscomplexinwirelesssensornetworks AT hanchu efficientcoverageholedetectionalgorithmbasedonthesimplifiedripscomplexinwirelesssensornetworks AT xinfeng efficientcoverageholedetectionalgorithmbasedonthesimplifiedripscomplexinwirelesssensornetworks |
_version_ |
1715170687611568128 |