Published research · Published

Optimising sensor placement in stormwater networks

Published in AJOSR

This research investigates where sensors should be placed in a stormwater network to improve coverage within a limited budget. Using drainage-network data from Bengaluru, I modelled the system as a graph and compared random placement, greedy selection, and exact optimisation. I examined how sensor budgets and coverage assumptions affect the results, alongside the practical limitations of translating a mathematical solution into a deployment plan.

3strategies compared: random, greedy, exact

Methods

Graph Modelling
Greedy Algorithms
Coverage Optimisation
Sensor Placement

Try it

Where would you put the sensors? Budget 3

You0

Greedy0

Best possible0

Junctions covered out of 20. A sensor sees its own junction and the pipes next to it. This is a small made-up network, not the Bengaluru data. It lets you try: place sensors by hand, greedy, and exact. Greedy and exact are two of the three strategies I compare in my paper.

Read and verify

Read the paper in AJOSR (opens in a new tab)

Connected work

FloodGuard stormwater
IIT Bombay network optimisation
University courses and PACT graphs, algorithms

Next: Pell's equation and quadratic Diophantine equations →