Effect of Utility Function on Lifetime of Directional Sensor Networks
GREENCOM-CPSCOM '10 Proceedings of the 2010 IEEE/ACM Int'l Conference on Green Computing and Communications & Int'l Conference on Cyber, Physical and Social Computing
The target coverage problem in directional sensor networks with rotatable angles
GPC'11 Proceedings of the 6th international conference on Advances in grid and pervasive computing
The coverage problem in directional sensor networks with rotatable sensors
UIC'11 Proceedings of the 8th international conference on Ubiquitous intelligence and computing
A deterministic sensor node deployment method with target coverage and node connectivity
AICI'11 Proceedings of the Third international conference on Artificial intelligence and computational intelligence - Volume Part II
Distributed coverage-enhancing algorithms in directional sensor networks with rotatable sensors
ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking
Coverage estimation for crowded targets in visual sensor networks
ACM Transactions on Sensor Networks (TOSN)
Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing
The Journal of Supercomputing
Achieving full-view coverage in camera sensor networks
ACM Transactions on Sensor Networks (TOSN)
simDSN: A Simulation Platform for the Sensing Coverage Problem in Directional Sensor Networks
DS-RT '13 Proceedings of the 2013 IEEE/ACM 17th International Symposium on Distributed Simulation and Real Time Applications
Hi-index | 14.98 |
Unlike convectional omnidirectional sensors that always have an omniangle 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 nondisjoint 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.