.png){kind=icon}
.png){kind=icon}
Return
Reconfiguration methods for mobile sensor networks
.png){kind=icon}
PRE
AI
DOI：10.1145/1281492.1281497.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
performance
reliability
measurement
mobile or actuator systems
network protocols
coverage
actuation
motion coordination
spatial resolution
mobility control
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.7
Papers:
995
Citations:
2.0K
