.png){kind=icon}
返回
Probabilistic coverage based sensor scheduling for target tracking sensor networks
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ins.2014.08.067.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In target tracking sensor networks, tracking quality and network lifetime are two conflicting optimization goals due to the limited battery power of the sensor nodes. During the movement of a target, how to select an optimal subset of sensors to wake up is of critical importance both for extending network lifetime and guaranteeing tracking quality. In this paper, we first propose a probabilistic-based dynamic non-complete k-coverage method, alpha-k-coverage, which can guarantee that target moving area is covered by at least k sensors under at least alpha probability. Then, we propose an energy-efficient sensor scheduling scheme, Optimal Cooperation Scheduling Algorithm (OCSA), to balance tracking quality and network lifetime under alpha-k-coverage condition. The effectiveness of the proposed scheme is validated through extensive simulation experiments. (C) 2014 Elsevier Inc. All rights reserved.
Keyword:
Probabilistic coverage
Sensor scheduling
Target tracking
Wireless sensor networks
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.8
论文数:
553
被引数:
6.2W
机构
暂无机构信息
引用论文
N-Acetyl-Aspartate Level is Decreased in the Prefrontal Cortex in Subjects At-Risk for Schizophrenia
OAAI
.png){kind=icon}
OAAI分享收藏
分享收藏
查看更多内容