An OL(n3) potential reduction algorithm for linear programming
Mathematical Programming: Series A and B
Next century challenges: scalable coordination in sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
A discrete-time battery model for high-level power estimation
DATE '00 Proceedings of the conference on Design, automation and test in Europe
Proceedings of the 7th annual international conference on Mobile computing and networking
Exposure in wireless Ad-Hoc sensor networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Approximation algorithms
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
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
Exposure in wireless sensor networks: theory and practical solutions
Wireless Networks
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
Differentiated surveillance for sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Resource efficiency in ad hoc wireless networks: problems and solutions
Resource efficiency in ad hoc wireless networks: problems and solutions
Latency of wireless sensor networks with uncoordinated power saving mechanisms
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
On k-coverage in a mostly sleeping sensor network
Proceedings of the 10th 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
IEEE Communications Magazine
Satisfying coverage and connectivity in bandwidth constrained sensor networks
ISCIT'09 Proceedings of the 9th international conference on Communications and information technologies
EURASIP Journal on Wireless Communications and Networking - Special issue on theoretical and algorithmic foundations of wireless ad hoc and sensor networks
Coverage problems in sensor networks: A survey
ACM Computing Surveys (CSUR)
Theoretical treatment of target coverage in wireless sensor networks
Journal of Computer Science and Technology - Special issue on natural language processing
Models of Rate Restricted Communication for Concurrent Objects
Electronic Notes in Theoretical Computer Science (ENTCS)
Maximum lifetime coverage preserving scheduling algorithms in sensor networks
Journal of Global Optimization
Design of wireless sensor networks for mobile target detection
IEEE/ACM Transactions on Networking (TON)
Parameterized complexity of Max-lifetime Target Coverage in wireless sensor networks
Theoretical Computer Science
| Hi-index | 0.00 |
Recent research in sensor networks highlights the low-power mode operation of sensor networks. In wireless sensor networks, network lifetime can be extended by organizing sensors into mutually exclusive subsets and alternatively activating each subset. Coverage breach occurs when a subset fails to cover all the targets. In bandwidth-constrained sensor networks, coverage breach is more likely to happen because when active sensors periodically send data to the base station, contention for channel access must be considered. Channel bandwidth imposes a limit on the cardinality of each subset. To make efficient use of both energy and bandwidth with minimum coverage breach requires optimal arrangement of sensor nodes. This article addresses three coverage breach problems related to the low-power operation of wireless sensor networks where channel bandwidth is limited. The three coverage breach problems are formulated using integer linear programming models. A greedy approximation algorithm and a heuristic based on the LP-relaxation method are proposed. Effects of changing different network resources on sensor network coverage are studied through simulations. One consistent result is that when the number of sensors increases, network lifetime can be improved without loss of network coverage only if there is no bandwidth constraint; with bandwidth constraints, network lifetime may be improved further at the cost of coverage breach.