A Branch and Bound Algorithm for the Critical Grid Coverage Problem in Wireless Sensor Networks
We aim to cover a grid fully by deploying the necessary wireless sensors while maintaining connectivity between the deployed sensors and a base station ( the sink ). The problem is NP - Complete as it can be reduced to a 2 - dimensional critical coverage problem, which is an NP - Complete problem. W...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SAGE Publishing
2014-02-01
|
| Series: | International Journal of Distributed Sensor Networks |
| Online Access: | https://doi.org/10.1155/2014/769658 |