Algorithmic geometry
Computational geometry in C (2nd ed.)
Computational geometry in C (2nd ed.)
System architecture directions for networked sensors
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
A probabilistic analysis for the range assignment problem in ad hoc networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
A dual-space approach to tracking and sensor management in wireless sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Polygon decomposition for efficient construction of Minkowski sums
Computational Geometry: Theory and Applications - Special issue on: Sixteenth European Workshop on Computational Geometry (EUROCG-2000)
Locating Objects in Mobile Computing
IEEE Transactions on Knowledge and Data Engineering
Maintaining the Extent of a Moving Point Set
WADS '97 Proceedings of the 5th International Workshop on Algorithms and Data Structures
SHARP: a hybrid adaptive routing protocol for mobile ad hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Spatio-temporal data reduction with deterministic error bounds
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
Spatio-Temporal Databases
Efficient data reduction with EASE
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
The sensor spectrum: technology, trends, and requirements
ACM SIGMOD Record
Managing uncertainty in sensor database
ACM SIGMOD Record
Multimedia streaming in large-scale sensor networks with mobile swarms
ACM SIGMOD Record
Managing uncertainty in moving objects databases
ACM Transactions on Database Systems (TODS)
Querying Imprecise Data in Moving Object Environments
IEEE Transactions on Knowledge and Data Engineering
Contour estimation using collaborating mobile sensors
DIWANS '06 Proceedings of the 2006 workshop on Dependability issues in wireless ad hoc networks and sensor networks
Managing cohort movement of mobile sensors via GPS-free and compass-free node localization
Journal of Parallel and Distributed Computing
Sensor relocation for emergent data acquisition in sparse mobile sensor networks
Mobile Information Systems
Honeybees: combining replication and evasion for mitigating base-station jamming in sensor networks
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Journal of Mobile Multimedia
Hi-index | 0.00 |
This work addresses the problem of optimizing the deployment of sensors in order to ensure the quality of the readings of the value of interest in a given (critical) geographic region. As usual, we assume that each sensor is capable of reading a particular physical phenomenon (e.g., concentration of toxic materials in the air) and transmitting it to a server or a peer. However, the key assumptions considered in this work are: 1. each sensor is capable of moving (where the motion may be remotely controlled); and 2. the spatial range for which the individual sensor's reading is guaranteed to be of a desired quality is limited. In scenarios like disaster management and homeland security, in case some of the sensors dispersed in a larger geographic area report a value higher than a certain threshold, one may want to ensure a quality of the readings for the affected region. This, in turn, implies that one may want to ensure that there are enough sensors there and, consequently, guide a subset of the rest of the sensors towards the affected region. In this paper we explore variants of the problem of optimizing the guidance of the mobile sensors towards the affected geographic region and we present algorithms for their solutions.