Sentry selection in sensor networks: Theory and algorithms

Abstract

We study the geometric aspects of the sentry selection problem for a sensor network with randomly distributed sensors, each of which covers a small disc. The problem is to partition the sensors into a predetermined number of groups, so that, for each group, the sensing regions of the sensors in that group together cover the region of interest. After presenting some theoretical results, we include descriptions of two fast partitioning algorithms, together with the results of simulating them on moderate-sized networks.

Publication Title

International Journal of Sensor Networks

Link to Full Text

Share

COinS