Sphere-packings, lattices, and groups
Sphere-packings, lattices, and groups
Tolerating failures of continuous-valued sensors
ACM Transactions on Computer Systems (TOCS)
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Covering rectilinear polygons with axis-parallel rectangles
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
A coverage-preserving node scheduling scheme for large wireless sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks
IEEE Transactions on Computers
Approximation Algorithms for Connected Dominating Sets
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Connected sensor cover: self-organization of sensor networks for efficient query execution
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
PEAS: A Robust Energy Conserving Protocol for Long-lived Sensor Networks
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Fault Recovery Based on Checkpointing for Hard Real-Time Embedded Systems
DFT '03 Proceedings of the 18th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems
Integrated coverage and connectivity configuration in wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Dynamic coverage in ad-hoc sensor networks
Mobile Networks and Applications
Energy-efficient coverage problems in wireless ad-hoc sensor networks
Computer Communications
Efficient and fault-tolerant feature extraction in wireless sensor networks
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
Coverage in wireless ad hoc sensor networks
IEEE Transactions on Computers
| Hi-index | 0.00 |
Wireless Sensor Networks (WSNs) promise a maintenance free, fault-tolerant platform for gathering different kinds of data. For widespread adoption of the wireless sensor technology, robustness in the event of abnormal behaviour is critical. In this paper, the coverage problem in a 3-dimensional space is studied. Due to node failures or node migration, some uncovered holes are created. The problem of a self-healing sensor network in the case of coverage holes is addressed through a back up scheme where a designated substitute set of sensor nodes is activated.