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

Distance and time based node selection for probabilistic coverage in People-Centric Sensing
复制标题

DOI:
10.1109/sahcn.2011.5984884
复制
发表时间:
2011-06
期刊:
2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks
影响因子:
--
通讯作者:
Asaad Ahmed;K. Yasumoto;Yukiko Yamauchi;Minoru Ito
Asaad Ahmed;K. Yasumoto;Yukiko Yamauchi;Minoru Ito
中科院分区:
其他
文献类型:
--
作者:
Asaad Ahmed;K. Yasumoto;Yukiko Yamauchi;Minoru Ito

文献摘要

被引文献

相似文献

为了实现以人为中心感知(PCS)方式对给定感兴趣区域(AoI)的感知覆盖,提出了目标场的(α,T)-覆盖概念,即在时间段T内,目标场中的每个点至少被一个节点以至少α的概率感知到。我们的目标是实现(α,T)-覆盖的移动的传感器节点的最小集合为给定的AoI,覆盖率α,和时间周期T。我们的行人模型作为移动的传感器节点移动根据离散马尔可夫链。在此模型的基础上,我们提出了两种算法:位置间算法和相遇时间间算法,以满足时间段T内的覆盖率α。这些算法估计一组选定节点的指定AoI的预期覆盖范围。该算法从AoI内的节点中选择最小数量的移动的传感器节点,同时考虑到它们之间的距离。会议间时间选择考虑节点之间的预期会议时间的节点。我们进行了模拟研究,以评估所提出的算法的性能,包括一个现实的情况下,在一个特定的城市地图上的各种参数设置。仿真结果表明,我们的算法实现(α,T)-覆盖具有良好的精度为各种值的α,T,和AoI大小。
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.