- About this Journal
- Abstracting and Indexing
- Aims and Scope
- Annual Issues
- Article Processing Charges
- Articles in Press
- Author Guidelines
- Bibliographic Information
- Citations to this Journal
- Contact Information
- Editorial Board
- Editorial Workflow
- Free eTOC Alerts
- Publication Ethics
- Reviewers Acknowledgment
- Submit a Manuscript
- Subscription Information
- Table of Contents
International Journal of Distributed Sensor Networks
Volume 2012 (2012), Article ID 918252, 25 pages
doi:10.1155/2012/918252
The Complexity of the Minimum Sensor Cover Problem with Unit-Disk Sensing Regions over a Connected Monitored Region
Department of Computer Science and Information Engineering, National Chung Cheng University, 168 University Road, Min-Hsiung Chia-Yi 621, Taiwan
Received 17 June 2011; Revised 12 August 2011; Accepted 16 August 2011
Academic Editor: Yuhang Yang
Copyright © 2012 Ren-Song Ko. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
How to Cite this Article
Ren-Song Ko, “The Complexity of the Minimum Sensor Cover Problem with Unit-Disk Sensing Regions over a Connected Monitored Region,” International Journal of Distributed Sensor Networks, vol. 2012, Article ID 918252, 25 pages, 2012. doi:10.1155/2012/918252