Sensor Deployment for Network-like Environments
Luca Greco, Matteo Gaeta, Benedetto Piccoli

TL;DR
This paper introduces a two-step gradient ascent method for optimally deploying omnidirectional sensors in network-like environments, effectively handling complex terrains and reducing local optima issues.
Contribution
It presents a novel two-phase optimization approach combining coarse and fine adjustments for sensor placement in network environments.
Findings
Effective sensor deployment in simulated airport environment
Reduction of local optima impact through initial coarse optimization
Distributed online fine-tuning of sensor positions
Abstract
This paper considers the problem of optimally deploying omnidirectional sensors, with potentially limited sensing radius, in a network-like environment. This model provides a compact and effective description of complex environments as well as a proper representation of road or river networks. We present a two-step procedure based on a discrete-time gradient ascent algorithm to find a local optimum for this problem. The first step performs a coarse optimization where sensors are allowed to move in the plane, to vary their sensing radius and to make use of a reduced model of the environment called collapsed network. It is made up of a finite discrete set of points, barycenters, produced by collapsing network edges. Sensors can be also clustered to reduce the complexity of this phase. The sensors' positions found in the first step are then projected on the network and used in the second…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed Control Multi-Agent Systems · Energy Efficient Wireless Sensor Networks · Indoor and Outdoor Localization Technologies
