A large number n of sensors (finite connected intervals) are placed randomly on the real line so that the distances between the consecutive midpoints are independent random variables with expectation inversely proportional to n. In this work we address two fundamental sensor allocation problems. The interference problem tries to reallocate the sensors from their initial positions to eliminate overlaps. The coverage problem, on the other hand, allows overlaps, but tries to eliminate uncovered spaces between the originally placed sensors. Both problems seek to minimize the total sensormovement while reaching their respective goals. Using tools from queueing theory, Skorokhod reflections, and weak convergence, we investigate asymptotic behaviour of optimal costs as n increases to∞. The introduced methodology is then used to address a more complicated, modified coverage problem, in which the overlaps between any two sensors can not exceed a certain parameter.

Additional Metadata
Keywords Potential outflow, Queueing theory, Reflected random walk, Sensor allocation, Skorokhod map, Weak convergence
Persistent URL dx.doi.org/10.1017/jpr.2016.33
Journal Journal of Applied Probability
Kranakis, E, & Shaikhet, G. (2016). Sensor allocation problems on the real line. Journal of Applied Probability, 53(3), 667–687. doi:10.1017/jpr.2016.33