Coverage-aware sensor engagement in dense sensor networks.

J. Embedded Computing 01/2009; 3:3-18.
Source: DBLP
Download full-text


Available from: Tatsuya Suda
    • "Coverage problems for sensor networks have been extensively investigated as well. Coverage problems are solved for sensor networks in [11]–[13]. More recent work of interest includes [14], in which a genetic algorithm is used for maximizing sensor coverage in wireless sensor networks. "
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we consider the problem of sensing a finite set of (moving) objects over a finite planning horizon using a set of sensors in prefixed locations that vary with respect to time over a discretized space. Control in this situation is limited and the problem considered is one of opportunistic sensing. We formulate an integer program that maximizes the quality of sensor return given either deterministic or probabilistic (i.e., forecasted) object routes. We examine the computational complexity of the problem and show it is non-deterministic polynomial-hard. We theoretically and numerically illustrate subclasses of the problem that are computationally simpler, ultimately deriving a heuristic that is strongly polynomial. Real-world and constructed data sets are used in our analysis.
    No preview · Article · Dec 2015 · Cybernetics, IEEE Transactions on
  • Source
    • "Sensors in this case calculate the utility based on the expected distance to the task's location from the class to which they belong. More formally the distance used by the sensor to calculate the utility, D i j , is determined using the expected radial distance as follows:(4)where D i+1 and D i are the distances form the edges of the outer and inner circle of the ring in which sensor S i lies, respectively. The task leader chooses sensors that provides the highest utility values. "
    [Show abstract] [Hide abstract]
    ABSTRACT: We propose sensor-to-task assignments algorithms that take into account location privacy issues. Our solutions enable the network to choose the “best” assignment of the available sensors to the tasks to maximize the utility of the network while preserving sensors’ location privacy. We focus on preserving the sensors’ locations during the assignment process in contrast to previous works, which considered location privacy while sensors are in operation. We also propose an energy-based algorithm that uses the remaining energy of a sensor as a factor to scale the distance between a sensor and a task such that sensors that have more energy appear to be closer than ones with less energy left. This does not only provide location privacy but will also consume the sensing resources more evenly, which leads to extending the lifetime of the network. From our simulations, we found that our algorithms can successfully hide sensors’ locations while providing performance close to the algorithms, which use the exact locations. In addition, our energy-based algorithm, while achieving results close to the exact location algorithm, was found to increase the network lifetime by as much as 40%.
    Full-text · Article · Jan 2012 · International Journal of Distributed Sensor Networks
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: The problem of selecting a subset of sensors in a distributed object tracking environment that optimizes an objective function consisting of a trade-off between data accuracy and energy consumption is known to be NP-hard. The problem is exacerbated because of the uncertainty and dynamic nature of either sensor characteristics or the environment or both. We propose, for the first time, a novel framework based on a reinforcement learning approach, to deal with the problems of computational complexity, dynamic nature and uncertainty for sensor subset selection. Our proposed sensor subset selection approach is completely decentralized and sensors do not need to know even the presence of other sensors in the system. This makes our approach extremely scalable and easy to implement in a distributed system. To the best of our knowledge, this is the first application of reinforcement learning to the domain of sensor subset selection.
    Full-text · Conference Paper · Apr 2010
Show more