Abstract
Sensor deployment is one fundamental task in sensor network implementation. We generalize and investigate the problem of deploying a minimum set of wireless sensors at candidate locations in constrained 3D space of interest to achieve k-coverage of given target areas such that each point in the target areas is covered by at least k sensors. Based on different constraints on sensor locations and target areas, we formulate four sensor deployment problems: Discrete / Continuous sensor Locations (D/CL) with Discrete / Continuous Target areas (D/CT). We propose an approximate algorithm for DLDT and reduce DLCT and CLDT to DLDT by discretizing continuous sensor locations or target areas into a number of divisions without loss of sensing precision. We further consider the connected version of these four sensor deployment problems where deployed sensors must form a connected network, and propose an approximate algorithm for each of these connected deployment problems.
Original language | English (US) |
---|---|
Title of host publication | Proceedings - 16th International Conference on Parallel and Distributed Systems, ICPADS 2010 |
Pages | 550-557 |
Number of pages | 8 |
DOIs | |
State | Published - Dec 1 2010 |
Externally published | Yes |
Event | 16th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2010 - Shanghai, China Duration: Dec 8 2010 → Dec 10 2010 |
Other
Other | 16th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2010 |
---|---|
Country/Territory | China |
City | Shanghai |
Period | 12/8/10 → 12/10/10 |
All Science Journal Classification (ASJC) codes
- Hardware and Architecture