Distance and time based node selection for probabilistic coverage in People-Centric Sensing

Asaad Ahmed, Keiichi Yasumoto, Yukiko Yamauchi, Minoru Ito

Research output: Chapter in Book/Report/Conference proceedingConference contribution

43 Citations (Scopus)

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 languageEnglish
Title of host publication2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2011
Pages134-142
Number of pages9
DOIs
Publication statusPublished - Sep 20 2011
Event2011 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 2011Jun 30 2011

Other

Other2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2011
CountryUnited States
CitySalt Lake City, UT
Period6/27/116/30/11

Fingerprint

coverage
Sensor nodes
simulation
Markov processes
time
pedestrian
scenario
performance
Values

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Communication

Cite this

Ahmed, A., Yasumoto, K., Yamauchi, Y., & Ito, M. (2011). Distance and time based node selection for probabilistic coverage in People-Centric Sensing. In 2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2011 (pp. 134-142). [5984884] https://doi.org/10.1109/SAHCN.2011.5984884

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 proceedingConference contribution

Ahmed, A, Yasumoto, K, Yamauchi, Y & Ito, M 2011, Distance and time based node selection for probabilistic coverage in People-Centric Sensing. in 2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2011., 5984884, pp. 134-142, 2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2011, Salt Lake City, UT, United States, 6/27/11. https://doi.org/10.1109/SAHCN.2011.5984884
Ahmed A, Yasumoto K, Yamauchi Y, Ito M. Distance and time based node selection for probabilistic coverage in People-Centric Sensing. In 2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2011. 2011. p. 134-142. 5984884 https://doi.org/10.1109/SAHCN.2011.5984884
Ahmed, Asaad ; Yasumoto, Keiichi ; Yamauchi, Yukiko ; Ito, Minoru. / Distance and time based node selection for probabilistic coverage in People-Centric Sensing. 2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2011. 2011. pp. 134-142
@inproceedings{cd8579d8c5a24adaba94e4f911146daf,
title = "Distance and time based node selection for probabilistic coverage in People-Centric Sensing",
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.",
author = "Asaad Ahmed and Keiichi Yasumoto and Yukiko Yamauchi and Minoru Ito",
year = "2011",
month = "9",
day = "20",
doi = "10.1109/SAHCN.2011.5984884",
language = "English",
isbn = "9781457700934",
pages = "134--142",
booktitle = "2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2011",

}

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 -