Energy Efficient Target-Oriented Scheduling in Directional Sensor Networks
Authors:
- 6 March 2009
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 58 (9) , 1259-1274
Abstract
Unlike convectional omnidirectional sensors that always have an omni-angle of sensing range, directional sensors may have a limited angle of sensing range due to the technical constraints or cost considerations. A directional sensor network consists of a number of directional sensors, which can switch to several directions to extend their sensing ability to cover all the targets in a given area. Power conservation is still an important issue in such directional sensor networks. In this paper, we address the multiple directional cover sets (MDCS) problem of organizing the directions of sensors into a group of non-disjoint cover sets to extend the network lifetime. One cover set in which the directions cover all the targets is activated at one time. We prove the MDCS to be NP-complete and propose several algorithms for the MDCS. Simulation results are presented to demonstrate the performance of these algorithms.Keywords
This publication has 18 references indexed in Scilit:
- Maximal lifetime scheduling for K to 1 sensor–target surveillance networksComputer Networks, 2006
- Cyclops2005
- Energy-efficient target coverage in wireless sensor networks2005
- Maintaining Sensing Coverage and Connectivity in Large Sensor Networks2005
- A Distributed Coverage- and Connectivity-Centric Technique for Selecting Active Nodes in Wireless Sensor NetworksIEEE Transactions on Computers, 2005
- Panoptes: scalable low-power video sensor networking technologiesACM Transactions on Multimedia Computing, Communications, and Applications, 2005
- An analysis of a large scale habitat monitoring application2004
- Integrated coverage and connectivity configuration in wireless sensor networks2003
- A survey on sensor networksIEEE Communications Magazine, 2002
- An O(n 3 L) potential reduction algorithm for linear programmingMathematical Programming, 1991