A faster approximation algorithm for the Steiner problem in graphs
Information Processing Letters
A polylogarithmic approximation algorithm for the group Steiner tree problem
Journal of Algorithms
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Integrated coverage and connectivity configuration for energy conservation in sensor networks
ACM Transactions on Sensor Networks (TOSN)
Barrier coverage with wireless sensors
Proceedings of the 11th annual international conference on Mobile computing and networking
Deploying wireless sensors to achieve both coverage and connectivity
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Localization in sparse networks using sweeps
Proceedings of the 12th annual international conference on Mobile computing and networking
Improved Approximation Algorithms for Geometric Set Cover
Discrete & Computational Geometry
Designing localized algorithms for barrier coverage
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Strong barrier coverage of wireless sensor networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Energy-efficient connected-coverage in wireless sensor networks
International Journal of Sensor Networks
Lifetime maximization for connected target coverage in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Energy-efficient connected coverage of discrete targets in wireless sensor networks
International Journal of Ad Hoc and Ubiquitous Computing
Energy Efficient Target-Oriented Scheduling in Directional Sensor Networks
IEEE Transactions on Computers
Lifetime and coverage guarantees through distributed coordinate-free sensor activation
Proceedings of the 15th annual international conference on Mobile computing and networking
Selection and orientation of directional sensors for coverage maximization
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
A greedy approximation algorithm for the group Steiner problem
Discrete Applied Mathematics
Efficient algorithms to solve a class of resource allocation problems in large wireless networks
WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Directional Sensor Placement with Optimal Sensing Range, Field of View and Orientation
Mobile Networks and Applications
Wireless coverage with disparate ranges
MobiHoc '11 Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing
Barrier coverage in camera sensor networks
MobiHoc '11 Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing
LAACAD: Load Balancing k-Area Coverage through Autonomous Deployment in Wireless Sensor Networks
ICDCS '12 Proceedings of the 2012 IEEE 32nd International Conference on Distributed Computing Systems
Duty-cycle-aware minimum-energy multicasting in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Compressed data aggregation: energy-efficient and high-fidelity data collection
IEEE/ACM Transactions on Networking (TON)
Computers and Electrical Engineering
| Hi-index | 0.00 |
Wireless Sensor Networks (WSNs) have acquired new features recently, i.e., both the sensor and the antenna of a node can be directional. This brings new challenges to the Connected Coverage (CoCo) problem, where a finite set of targets needs to be monitored by some active sensor nodes, and the connectivity of these active nodes with the sink must be retained at the same time. In this paper, we study the Minimum-Energy Connected Coverage (MeCoCo) problem in WSNs with Omni-directional (O) and Directional (D) features, aiming at minimizing the total energy cost of both sensing and connectivity. Considering different combinations of O and D features, we study the MeCoCo problem under four cases, namely: O-Antenna and O-Sensor (OAOS), O-Antenna and D-Sensor (OADS), D-Antenna and D-Sensor (DADS), as well as D-Antenna and O-Sensor (DAOS). We prove that the MeCoCo problem is NP-hard under all these cases, and present approximation algorithms with provable approximation ratios. In particular, we propose a constant-approximation for OAOS, and polylogarithmic approximations for all other cases. Finally, we conduct extensive simulations and the results strongly confirm the effectiveness of our approach.