The maximum concurrent flow problem
Journal of the ACM (JACM)
Exposure in wireless Ad-Hoc sensor networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Faster approximation schemes for fractional multicommodity flow problems
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete 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
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems.
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Integrated coverage and connectivity configuration in wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Set k-cover algorithms for energy efficient monitoring in wireless sensor networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
Maximum lifetime routing in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Approximate Coverage in Wireless Sensor Networks
LCN '05 Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary
Connected sensor cover: self-organization of sensor networks for efficient query execution
IEEE/ACM Transactions on Networking (TON)
Energy-efficient coverage problems in wireless ad-hoc sensor networks
Computer Communications
Energy-Efficient connected coverage of discrete targets in wireless sensor networks
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
Satisfying coverage and connectivity in bandwidth constrained sensor networks
ISCIT'09 Proceedings of the 9th international conference on Communications and information technologies
Fundamental results on target coverage problem in wireless sensor networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Connected partial target coverage and network lifetime in wireless sensor networks
WD'09 Proceedings of the 2nd IFIP conference on Wireless days
Energy-efficient and coverage-specific node scheduling for wireless sensor networks
Proceedings of the 13th ACM international conference on Modeling, analysis, and simulation of wireless and mobile systems
EURASIP Journal on Wireless Communications and Networking - Special issue on theoretical and algorithmic foundations of wireless ad hoc and sensor networks
Ant colony optimization based sensor deployment protocol for wireless sensor networks
Expert Systems with Applications: An International Journal
Coverage problems in sensor networks: A survey
ACM Computing Surveys (CSUR)
Maximising lifetime for fault-tolerant target coverage in sensor networks
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
INOC'11 Proceedings of the 5th international conference on Network optimization
Lifetime and coverage guarantees through distributed coordinate-free sensor activation
IEEE/ACM Transactions on Networking (TON)
Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing
A distributed lifetime-maximizing scheme for connected target coverage in WSNs
ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part III
The Journal of Supercomputing
A density-barrier construction algorithm with minimum total movement in mobile WSNs
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
In this paper, we consider the connected target coverage (CTC) problem with the objective of maximizing the network lifetime by scheduling sensors into multiple sets, each of which can maintain both target coverage and connectivity among all the active sensors and the sink.We model the CTC problem as a maximum cover tree (MCT) problem and prove that the MCT problem is NP-Complete. We determine an upper bound on the network lifetime for the MCT problem and then develop a (1+w) H (M) approximation algorithm to solve it, where is an arbitrarily small number, H(M) = Σ1≤i≤M (1/i) and M is the maximum number of targets in the sensing area of any sensor. As the protocol cost of the approximation algorithm may be high in practice, we develop a faster heuristic algorithm based on the approximation algorithm called Communication Weighted Greedy Cover (CWGC) algorithm and present a distributed implementation of the heuristic algorithm. We study the performance of the approximation algorithm and CWGC algorithm by comparing them with the lifetime upper bound and other basic algorithms that consider the coverage and connectivity problems independently. Simulation results show that the approximation algorithm and CWGC algorithm perform much better than others in terms of the network lifetime and the performance improvement can be up to 45% than the best-known basic algorithm. The lifetime obtained by our algorithms is close to the upper bound. Compared with the approximation algorithm, the CWGC algorithm can achieve a similar performance in terms of the network lifetime with a lower protocol cost.