抄録
Aiming to achieve sensing coverage for a given Area of Interest (AoI) in a People-Centric Sensing (PCS) manner, we propose a concept of (α, T)-coverage of the target field where each point in the field is sensed by at least one node with probability of at least during the time period T. Our goal is to achieve (α, T)-coverage by a minimal set of mobile sensor nodes for a given AoI, coverage ratio α, and time period T. We model pedestrians as mobile sensor nodes moving according to a discrete Markov chain. Based on this model, we propose two algorithms: the inter-location and inter-meeting-time algorithms, to meet a coverage ratio α in time period T. These algorithms estimate the expected coverage of the specified AoI for a set of selected nodes. The inter-location algorithm selects a minimal number of mobile sensor nodes from nodes inside the AoI taking into account the distance between them. The inter-meeting-time selects nodes taking into account the expected meeting time between the nodes. We conducted a simulation study to evaluate the performance of the proposed algorithms for various parameter setting including a realistic scenario on a specific city map. The simulation results show that our algorithms achieve (α, T)-coverage with good accuracy for various values of α, T, and AoI size.
本文言語 | 英語 |
---|---|
ホスト出版物のタイトル | 2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2011 |
ページ | 134-142 |
ページ数 | 9 |
DOI | |
出版ステータス | 出版済み - 9月 20 2011 |
イベント | 2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2011 - Salt Lake City, UT, 米国 継続期間: 6月 27 2011 → 6月 30 2011 |
その他
その他 | 2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2011 |
---|---|
国/地域 | 米国 |
City | Salt Lake City, UT |
Period | 6/27/11 → 6/30/11 |
!!!All Science Journal Classification (ASJC) codes
- コンピュータ ネットワークおよび通信
- 通信