.png){kind=icon}
.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Probabilistic coverage
Sensor scheduling
Target tracking
Wireless sensor networks
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.8
Papers:
540
Citations:
6.2W
Organization
No organization information available