Download now Free registration required
Mission-driven sensor networks usually have special lifetime requirements. However, the density of the sensors may not be large enough to satisfy the coverage requirement while meeting the lifetime constraint at the same time. Sometimes coverage has to be traded for network lifetime. In this paper, the authors study how to schedule sensors to maximize their coverage during a specified network lifetime. Unlike sensor deployment, where the goal is to maximize the spatial coverage, the objective is to maximize the spatialtemporal coverage by scheduling sensors' activity after they have been deployed. Since the optimization problem is NP-hard, the authors first present a centralized heuristics whose approximation factor is proved to be, and then propose a distributed Parallel Optimization Protocol (POP).
- Format: PDF
- Size: 385.2 KB