Probabilistic Coverage Methods in People-Centric Sensing

• Item type: Journal(1)
• 公開日: 2011-10-15
• タイトル: Probabilistic Coverage Methods in People-Centric Sensing
• タイトル / 言語: en
• タイトル: Probabilistic Coverage Methods in People-Centric Sensing
• 言語: eng
• キーワード / 主題Scheme: Other
• キーワード / 主題: 一般論文
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_6501
• 資源タイプ: journal article
• 著者所属: Graduate School of Information Science, Nara Institute of Science and Technology／Mathematics Department, Faculty of Science, Al-Azhar University
• 著者所属: Graduate School of Information Science, Nara Institute of Science and Technology／Japan Science and Technology Agency, CREST.
• 著者所属: Graduate School of Information Science and Electrical Engineering, Kyushu University／Japan Science and Technology Agency, CREST.
• 著者所属: Graduate School of Information Science, Nara Institute of Science and Technology
• 著者所属(英): en
• 著者所属(英): Graduate School of Information Science, Nara Institute of Science and Technology / Mathematics Department, Faculty of Science, Al-Azhar University
• 著者所属(英): en
• 著者所属(英): Graduate School of Information Science, Nara Institute of Science and Technology / Japan Science and Technology Agency, CREST.
• 著者所属(英): en
• 著者所属(英): Graduate School of Information Science and Electrical Engineering, Kyushu University / Japan Science and Technology Agency, CREST.
• 著者所属(英): en
• 著者所属(英): Graduate School of Information Science, Nara Institute of Science and Technology
• 著者名: Asaad, Ahmed; Keiichi, Yasumoto; Yukiko, Yamauchi; Minoru, Ito
• 著者名(英): Asaad, Ahmed; Keiichi, Yasumoto; Yukiko, Yamauchi; Minoru, Ito
• 論文抄録 / 内容記述タイプ: Other
• 論文抄録 / 内容記述: Aiming to achieve sensing coverage for given Areas of Interest (AoI) over time at low cost in a People-Centric Sensing manner, we propose a concept of (α, T)-coverage of a target field where each point in the field is sensed by at least one mobile node with the probability of at least α during time period T. Our goal is to achieve (α, T)-coverage of a given AoI by a minimal set of mobile nodes. In this paper, we propose two algorithms: inter-location algorithm that selects a minimal number of mobile nodes from nodes inside the AoI considering the distance between them and inter-meeting-time algorithm that selects nodes regarding the expected meeting time between the nodes. To cope with the case that there is an insufficient number of nodes inside the AoI, we propose an extended algorithm which regards nodes inside and outside the AoI. To improve the accuracy of the proposed algorithms, we also propose an updating mechanism which adapts the number of selected nodes based on their latest locations during the time period T. In our simulation-based performance evaluation, our algorithms achieved (α, T)-coverage with good accuracy for various values of α, T, AoI size, and moving probability.
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: Aiming to achieve sensing coverage for given Areas of Interest (AoI) over time at low cost in a People-Centric Sensing manner, we propose a concept of (α, T)-coverage of a target field where each point in the field is sensed by at least one mobile node with the probability of at least α during time period T. Our goal is to achieve (α, T)-coverage of a given AoI by a minimal set of mobile nodes. In this paper, we propose two algorithms: inter-location algorithm that selects a minimal number of mobile nodes from nodes inside the AoI considering the distance between them and inter-meeting-time algorithm that selects nodes regarding the expected meeting time between the nodes. To cope with the case that there is an insufficient number of nodes inside the AoI, we propose an extended algorithm which regards nodes inside and outside the AoI. To improve the accuracy of the proposed algorithms, we also propose an updating mechanism which adapts the number of selected nodes based on their latest locations during the time period T. In our simulation-based performance evaluation, our algorithms achieved (α, T)-coverage with good accuracy for various values of α, T, AoI size, and moving probability.
• 書誌レコードID / 収録物識別子タイプ: NCID
• 書誌レコードID / 収録物識別子: AN00116647
• 書誌情報: 情報処理学会論文誌; 巻 52, 号 10, p. 2902-2919, 発行日 2011-10-15
• ISSN / 収録物識別子タイプ: ISSN
• ISSN / 収録物識別子: 1882-7764