Download now Free registration required
The authors 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, they include descriptions of two fast partitioning algorithms, together with the results of simulating them on moderate-sized networks.
- Format: PDF
- Size: 232.2 KB