Some optimal inapproximability results
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Exposure in wireless Ad-Hoc sensor networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Barrier coverage with wireless sensors
Proceedings of the 11th annual international conference on Mobile computing and networking
Foundations of coverage in wireless sensor networks
Foundations of coverage in wireless sensor networks
Strong barrier coverage of wireless sensor networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Approximating Barrier Resilience in Wireless Sensor Networks
Algorithmic Aspects of Wireless Sensor Networks
The complexity of separating points in the plane
Proceedings of the twenty-ninth annual symposium on Computational geometry
| Hi-index | 0.00 |
Various notions of coverage have been introduced as basic quality-of-service measures for wireless sensor networks. One natural measure of coverage is referred to as resilience: given a starting region S and a target region T, the resilience a sensor configuration with respect to S and T is the minimum number of sensors that need to be deactivated before an S−T path can exist that does not cross any active sensor region. We demonstrate that determining resilience of a network of unit-line-segment sensors is NP-hard. Furthermore, we can extend our proof to show that the resilience problem remains NP-hard for other types of non-symmetric sensor coverage regions.