Name
Abstract | ||
|---|---|---|
Many sensor network applications require the tracking and the surveillance of target objects. However, in current research, many studies have assumed that a target object can be sufficiently monitored by a single sensor. This assumption is invalid in some situations, especially, when the target object is so large that a single sensor can only monitor a certain portion of it. In this case, several sensors are required to ensure a 360° coverage of the target. To minimize the amount of energy required to cover the target, the minimum set of sensors should be identified. Centralized algorithms are not suitable for sensor applications. In this paper, we describe our novel distributed algorithm for finding the minimum cover. Our algorithm requires fewer messages than earlier mechanisms and we provide a formal proof of correctness and time of convergence. We further demonstrate our performance improvement through extensive simulations. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1109/TWC.2010.07.080817 | IEEE Transactions on Wireless Communications |
Keywords | Field | DocType |
centralized algorithm,perimeter coverage,earlier mechanism,minimum cover,wireless sensor network,certain portion,current research,sensor network,sensor network application,single sensor,minimum set,target object,sensor application,art,protocols,sensors,convergence,distributed algorithm,distributed algorithms,algorithm design and analysis,quality of service,wireless sensor networks | Key distribution in wireless sensor networks,Algorithm design,Correctness,Sensor array,Visual sensor network,Brooks–Iyengar algorithm,Real-time computing,Distributed algorithm,Wireless sensor network,Mathematics | Journal |
Volume | Issue | ISSN |
9 | 7 | 1536-1276 |
Citations | PageRank | References |
8 | 0.49 | 17 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ka-Shun Hung | 1 | 40 | 2.98 |
| King-Shan Lui | 2 | 294 | 26.21 |