Distributed Localization of Coverage Holes Using Topological Persistence

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 nodes. We use algebraic topological methods to define a coverage hole, and develop provably correct algorithm to detect...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on signal processing 2014-05, Vol.62 (10), p.2531-2541
Main Authors: Chintakunta, Harish, Krim, Hamid
Format: Article
Language:English
Subjects:
Abstracts
Algebra
Algebraic topology
Algorithms
Applied sciences
Computer simulation
Detection, estimation, filtering, equalization, prediction
Distributed algorithms
Exact sciences and technology
graph theory
Information, signal and communications theory
Laplace equations
Localization
Materials
Networks
Partitioning algorithms
sensor networks
Signal and communications theory
Signal processing
Signal processing algorithms
Signal, noise
Telecommunications and information theory
Topology
Transaction processing
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 nodes. We use algebraic topological methods to define a coverage hole, and develop provably correct algorithm to detect a hole. We then partition the network into smaller subnetworks, while ensuring that the holes are preserved, and checking for holes in each. We show that repeating this process leads to localizing the coverage holes. We demonstrate the improved complexity of our algorithm using simulations.
ISSN:1053-587X
1941-0476
DOI:10.1109/TSP.2014.2314063