Abstract
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.
| Original language | English |
|---|---|
| Title of host publication | 2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2011 |
| Pages | 134-142 |
| Number of pages | 9 |
| DOIs | |
| Publication status | Published - Sep 20 2011 |
| Event | 2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2011 - Salt Lake City, UT, United States Duration: Jun 27 2011 → Jun 30 2011 |
Other
| Other | 2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2011 |
|---|---|
| Country | United States |
| City | Salt Lake City, UT |
| Period | 6/27/11 → 6/30/11 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Computer Networks and Communications
- Communication
Cite this
Distance and time based node selection for probabilistic coverage in People-Centric Sensing. / Ahmed, Asaad; Yasumoto, Keiichi; Yamauchi, Yukiko; Ito, Minoru.
2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2011. 2011. p. 134-142 5984884.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Distance and time based node selection for probabilistic coverage in People-Centric Sensing
AU - Ahmed, Asaad
AU - Yasumoto, Keiichi
AU - Yamauchi, Yukiko
AU - Ito, Minoru
PY - 2011/9/20
Y1 - 2011/9/20
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=80052818431&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=80052818431&partnerID=8YFLogxK
U2 - 10.1109/SAHCN.2011.5984884
DO - 10.1109/SAHCN.2011.5984884
M3 - Conference contribution
AN - SCOPUS:80052818431
SN - 9781457700934
SP - 134
EP - 142
BT - 2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2011
ER -