返回
Spatial-Temporal Coverage Optimization in Wireless Sensor Networks
DOI:10.1109/TMC.2010.172.png)
摘要
En 中文
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, we 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, our objective is to maximize the spatial-temporal coverage by scheduling sensors' activity after they have been deployed. Since the optimization problem is NP-hard, we first present a centralized heuristic whose approximation factor is proved to be 1 2, and then, propose a distributed parallel optimization protocol (POP). In POP, nodes optimize their schedules on their own but converge to local optimality without conflict with one another. Theoretical and simulation results show that POP substantially outperforms other schemes in terms of network lifetime, coverage redundancy, convergence time, and event detection probability.
Keyword:
Wireless sensor network
coverage
sensor scheduling
distributed protocol
parallel algorithm
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
9.2
论文数:
5.9K
被引数:
1.8W
机构
引用论文
Physical and Optical Properties of CeO<sub>2</sub> BaO B<sub>2</sub>O<sub>3</sub> Glasses
Optics
IF0
A Review of Flexible Acceleration Sensors Based on Piezoelectric Materials: Performance Characterization, Parametric Analysis, Frontier Technologies, and Applications
Coatings
IF0

