Coverage problem with uncertain properties in wireless sensor networks: A survey

Y Wang, S Wu, Z Chen, X Gao, G Chen - Computer Networks, 2017 - Elsevier
The coverage problem, as a fundamental problem for almost all types of applications in
wireless sensor networks (WSNs), has been studied for over a decade. Because of its …

Optimal coverage in wireless sensor networks

W Wu, Z Zhang, W Lee, D Du - 2020 - Springer
The motivation for writing this book came from our previous research works on sensor
coverage. They received a large number of citations and this number grows rapidly each …

Localized confident information coverage hole detection in internet of things for radioactive pollution monitoring

L Yi, X Deng, M Wang, D Ding, Y Wang - IEEE Access, 2017 - ieeexplore.ieee.org
As a novel cyber-physical-social network paradigm, the Internet of Things (IoT) provides a
powerful tool to monitor the hazardous fields of interest. Due to the uneven random …

Simplifying the homology of networks via strong collapses

AC Wilkerson, TJ Moore, A Swami… - 2013 IEEE International …, 2013 - ieeexplore.ieee.org
There has recently been increased interest in applications of topology to areas ranging from
control and sensing, to social network analysis, to high-dimensional point cloud data …

Telpac: A time and energy efficient protocol for locating and patching coverage holes in wsns

P Le Nguyen, K Nguyen, H Vu, Y Ji - Journal of Network and Computer …, 2019 - Elsevier
Guaranteeing sufficient sensing coverage is of prime importance in wireless sensor
networks. Unfortunately, due to many reasons such as natural disruptions, adversarial …

Distributed localization of coverage holes using topological persistence

H Chintakunta, H Krim - IEEE Transactions on Signal …, 2014 - ieeexplore.ieee.org
We develop distributed algorithms to detect and localize coverage holes in sensor networks.
We neither assume coordinate information of the nodes, neither any distances between the …

Broadcasting in multi-radio multi-channel wireless networks using simplicial complexes

W Ren, Q Zhao, R Ramanathan, J Gao, A Swami… - Wireless networks, 2013 - Springer
We consider the broadcasting problem in multi-radio multi-channel ad hoc networks. The
objective is to minimize the total cost of the network-wide broadcast, where the cost can be …

Computing persistent features in big data: A distributed dimension reduction approach

AC Wilkerson, H Chintakunta… - 2014 IEEE international …, 2014 - ieeexplore.ieee.org
Persistent homology has become one of the most popular tools used in topological data
analysis for analyzing big data sets. In an effort to minimize the computational complexity of …

Analyzing collaboration networks using simplicial complexes: A case study

TJ Moore, RJ Drost, P Basu… - 2012 Proceedings …, 2012 - ieeexplore.ieee.org
Collaboration social networks are traditionally modeled using graphs that capture pairwise
relationships but have ambiguity between group collaborations and multiple pairwise …

Persistent homology lower bounds on high-order network distances

W Huang, A Ribeiro - IEEE Transactions on Signal Processing, 2016 - ieeexplore.ieee.org
High-order networks are weighted hypergraphs collecting relationships between elements
of tuples, not necessarily pairs. Valid metric distances between high-order networks have …