Issue No. 09 - September (2009 vol. 58)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2009.40
Yanli Cai , Dept. of Comput. Sci. & Eng., Shanghai Jiao Tong Univ., Shanghai, China
Minglu Li , Dept. of Comput. Sci. & Eng., Shanghai Jiao Tong Univ., Shanghai, China
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.
wireless sensor networks, NP-complete, energy efficient target-oriented scheduling, directional sensor network, power conservation, multiple directional cover sets,Sensors, Data mining, Polynomials, Face, Probability density function, Switches, Runtime,sensor networks., Coverage, energy conservation, mixed integer programming, scheduling
Yanli Cai, Wei Lou, Minglu Li, Xiang-Yang Li, "Energy Efficient Target-Oriented Scheduling in Directional Sensor Networks", IEEE Transactions on Computers, vol. 58, no. , pp. 1259-1274, September 2009, doi:10.1109/TC.2009.40