Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/TSP.2014.2314063 | Signal Processing, IEEE Transactions |
Keywords | Field | DocType |
telecommunication network topology,wireless sensor networks,algebraic topological methods,distributed localization,hole detection,localize coverage holes,sensor networks,subnetworks,topological persistence,Algebraic topology,distributed algorithms,graph theory,sensor networks | Graph theory,Topology,Mathematical optimization,Algebraic topology,Algebraic number,Theoretical computer science,Distributed algorithm,Partition (number theory),Wireless sensor network,Mathematics,Topological persistence,Signal processing algorithms | Journal |
Volume | Issue | ISSN |
62 | 10 | 1053-587X |
Citations | PageRank | References |
9 | 0.64 | 20 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Harish Chintakunta | 1 | 36 | 6.05 |
| Hamid Krim | 2 | 520 | 59.69 |