Name
Abstract | ||
|---|---|---|
One of the major applications of sensor networks is tracking and surveillance. Very often, a single sensor is sufficient to monitor a single target. However, when the object is very large, several sensors have to work together to monitor the object continuously. In this paper, we study how to identify a set of sensors that can cover the perimeter of a large target with the minimum cost. We develop a novel distributed algorithm that requires fewer messages than existing mechanisms. Our algorithm can be extended to solve the problem when the sensor range is adjustable. We provide a formal proof of correctness and convergence time analysis of our algorithm. We further demonstrate the performance through extensive simulations. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1504/IJSNET.2011.038761 | IJSNET |
Keywords | Field | DocType |
formal proof,fewer message,sensor range,single sensor,wireless sensor network,extensive simulation,perimeter coverage,large target,sensor network,minimum cost,single target,major application,convergence time analysis,simulation,wireless networks,tracking,distributed algorithms,wireless sensor networks,distributed algorithm | Wireless network,Computer science,Sensor array,Correctness,Brooks–Iyengar algorithm,Real-time computing,Distributed algorithm,Artificial intelligence,Wireless sensor network,Distributed computing,Formal proof,Formal verification | Journal |
Volume | Issue | ISSN |
9 | 2 | 1748-1279 |
Citations | PageRank | References |
6 | 0.41 | 25 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ka-Shun Hung | 1 | 40 | 2.98 |
| King-Shan Lui | 2 | 294 | 26.21 |