Art gallery theorems and algorithms
Art gallery theorems and algorithms
Information Processing Letters
An Active Testing Model for Tracking Roads in Satellite Images
IEEE Transactions on Pattern Analysis and Machine Intelligence
Nonmonotone and perturbed optimization
Nonmonotone and perturbed optimization
Sweeping simple polygons with a chain of guards
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
An Incremental Self-Deployment Algorithm for Mobile Sensor Networks
Autonomous Robots
Sentient Computing for Everyone
Proceedings of the IFIP TC6 / WG6.1 Third International Working Conference on New Developments in Distributed Applications and Interoperable Systems
Towards mobility as a network control primitive
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Event-Based Motion Control for Mobile-Sensor Networks
IEEE Pervasive Computing
Scalable control of decentralised sensor platforms
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
Stability analysis of social foraging swarms
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Factor graphs and the sum-product algorithm
IEEE Transactions on Information Theory
Engineering of Software-Intensive Systems: State of the Art and Research Challenges
Software-Intensive Systems and New Computing Paradigms
Using Context Annotated Mobility Profiles to Recruit Data Collectors in Participatory Sensing
LoCA '09 Proceedings of the 4th International Symposium on Location and Context Awareness
Occlusion-aware multiple camera reconfiguration
Proceedings of the Fourth ACM/IEEE International Conference on Distributed Smart Cameras
On coverage issues in directional sensor networks: A survey
Ad Hoc Networks
A new coverage improvement algorithm based on motility capability of directional sensor nodes
ADHOC-NOW'11 Proceedings of the 10th international conference on Ad-hoc, mobile, and wireless networks
Recruitment framework for participatory sensing data collections
Pervasive'10 Proceedings of the 8th international conference on Pervasive Computing
Coverage management for mobile targets in visual sensor networks
Proceedings of the 15th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Coverage algorithms for visual sensor networks
ACM Transactions on Sensor Networks (TOSN)
Hi-index | 0.00 |
Motion may be used in sensor networks to change the network configuration for improving the sensing performance. We consider the problem of controlling motion in a distributed manner for a mobile sensor network for a specific form of motion capability. Mobility itself may have a high resource overhead, hence we exploit motility, a constrained form of mobility, which has very low overheads but provides significant reconfiguration potential. We present an architecture that allows each node in the network to learn the medium and phenomenon characteristics. We describe a quantitative metric for sensing performance that is concretely tied to real sensor and medium characteristics, rather than assuming an abstract range based model. The problem of determining the desirable network configuration is expressed as an optimization of this metric. We present a distributed optimization algorithm which computes a desirable network configuration, and adapts it to environmental changes. The relationship of the proposed algorithm to simulated annealing and incremental subgradient descent based methods is discussed. A key property of our algorithm is that convergence to a desirable configuration can be proved even though no global coordination is involved. A network protocol to implement this algorithm is discussed, followed by simulations and experiments on a laboratory test bed.