Probabilistic Coverage Methods in People-Centric Sensing
スポンサーリンク
概要
- 論文の詳細を見る
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.
- Information and Media Technologies 編集運営会議の論文
著者
-
Ahmed Asaad
Graduate School Of Information Science Nara Institute Of Science And Technology
-
Yasumoto Keiichi
Graduate School Of Information Science Nara Institute Of Science And Technology
-
Ito Minoru
Graduate School Of Information Science Nara Institute Of Science And Technology
-
Yamauchi Yukiko
Graduate School of Information Science and Electrical Engineering, Kyushu University
関連論文
- Two-layer distributed service placement method on mobile ad-hoc networks (モバイルコンピューティングとユビキタス通信)
- HDAR: Highly Distributed Adaptive Service Replication for MANETs
- Computational Complexity of Finding Meaningful Association Rules
- Implication Problems for Specialization Constraints on Databases Supporting Complex Objects
- An Approximation Algorithm for the Task-Coalition Assignment Problem
- A Formal Approach to Detecting Security Flaws in Object-Oriented Databases (Special Issue on New Generation Database Technologies)
- An Authorization Model for Object-Oriented Databases and Its Efficient Access Control
- Complexity of the Type-Consistency Problem for Acyclic Object-Oriented Database Schemas
- Hierarchical Composition of Self-Stabilizing Protocols Preserving the Fault-Containment Property
- A Personal Navigation System with Functions to Compose Tour Schedules Based on Multiple Conflicting Criteria(Selected Papers from ICMU 2005(Second International Conference on Mobile Computing and Ubiquitous Networking))
- HDAR : Highly Distributed Adaptive Service Replication for MANETs
- Probabilistic Coverage Methods in People-Centric Sensing
- Specialization Constraints for a Complex Object Model Supporting Selective Inheritance
- A Reinforcement Learning Method with the Inference of the Other Agent's Policy for 2-Player Stochastic Games
- A Personal Navigation System with Functions to Compose Tour Schedules Based on Multiple Conflicting Criteria
- A Personal Navigation System with Functions to Compose Tour Schedules Based on Multiple Conflicting Criteria
- Probabilistic Coverage Methods in People-Centric Sensing
- SS-mPMG and SS-GA : Tools for Finding Pathways and Dynamic Simulation of Metabolic Networks