The Complexity of the Minimum Sensor Cover Problem with Unit-Disk Sensing Regions over a Connected Monitored Region
This paper considers the complexity of the Minimum Unit-Disk Cover (MUDC) problem. This problem has applications in extending the sensor network lifetime by selecting minimum number of nodes to cover each location in a geometric connected region of interest and putting the remaining nodes in power s...
Saved in:
Main Author: | Ren-Song Ko |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2011-11-01
|
Series: | International Journal of Distributed Sensor Networks |
Online Access: | https://doi.org/10.1155/2012/918252 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Minimum Number of Soil Moisture Sensors for Monitoring and Irrigation Purposes
by: Lincoln Zotarelli, et al.
Published: (2013-08-01) -
Minimum Number of Soil Moisture Sensors for Monitoring and Irrigation Purposes
by: Lincoln Zotarelli, et al.
Published: (2013-08-01) -
Optimal Sensor Placement and Minimum Number Selection of Sensors for Health Monitoring of Transmission Towers
by: Chuandi Zhou, et al.
Published: (2020-01-01) -
Dust Dynamics in Radially Convective Regions of Protoplanetary Disks
by: Min-Kai Lin, et al.
Published: (2025-01-01) -
Unit Disk Graph-Based Node Similarity Index for Complex Network Analysis
by: Natarajan Meghanathan
Published: (2019-01-01)