Optimal Distributed Blanket Coverage Problem

This chapter considers the blanket coverage problem, which is believed to be more difficult than barrier and sweep coverage problems. It proposes a distributed motion coordination algorithm for a mobile sensor network to address a blanket coverage problem. The proposed blanket coverage algorithm is randomized and has a highly probabilistic nature. According to this algorithm, the sensors are deployed on vertices of a regular triangular grid. Some asymptotic optimality of such grids is derived from the classical mathematical result of Kershner theorem.