More is more

Abstract

Positioning disk-shaped sensors to optimize certain coverage parameters is a fundamental problem in ad hoc sensor networks. The hexagon lattice arrangement is known to be optimally efficient in the plane, even though 20.9% of the area is unnecessarily covered twice, however, the arrangement is very rigid—any movement of a sensor from its designated grid position (due to, e.g., placement error or obstacle avoidance) leaves some region uncovered, as would the failure of any one sensor. In this article, we consider how to arrange sensors in order to guarantee multiple coverage, that is,k-coverage for some valuek> 1. A naive approach is to superimpose multiple hexagon lattices, but for robustness reasons, we may wish to space sensors evenly apart.We present two arrangement methods fork-coverage: (1) optimizing a Riesz energy function in order to evenly distribute nodes, and (2) simply shrinking the hexagon lattice and making it denser. The first method often approximates the second, and so we focus on the latter. We show that a density increase tantamount tokcopies of the lattice can yieldk′-coverage, fork′ >k(e.g.,k= 11,k′ = 12 andk= 21,k′ = 24), by exploiting the double-coverage regions. Our examples' savings provably converge in the limit to the ≈ 20.9% maximum. We also provide analogous results for the square lattice and its ≈ 57% inefficiency (e.g.,k= 3,k′ = 4 andk=5,k′ = 7) and show that for multi-coverage for some values ofk′, the square lattice can actually be more efficient than the hexagon lattice.We also explore other benefits of shrinking the lattice: Doing so allows all sensors to move about their intended positions independently while nonetheless guaranteeing full coverage and can also allow us to tolerate probabilistic sensor failure when providing 1-coverage ork-coverage. We conclude by construing the shrinking factor as a budget to be divided among these three benefits.