Title: Sentry selection in sensor networks: theory and algorithms

Authors: Paul Balister; Béla Bollobás; Martin Haenggi; Amites Sarkar; Mark Walters

Addresses: Department of Mathematical Sciences, University of Memphis, Memphis TN 38152, USA ' Trinity College, Cambridge CB2 1TQ, UK; Department of Mathematical Sciences, University of Memphis, Memphis TN 38152, USA ' Department of Electrical Engineering, University of Notre Dame, Notre Dame IN 46556, USA ' Department of Mathematics, Western Washington University, Bellingham WA 98225, USA ' School of Mathematical Sciences, Queen Mary University of London, London E1 4NS, UK

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.

Keywords: wireless sensor networks; sentry selection; Gilbert model; random coverings; recolouring algorithms; geometric probability.

DOI: 10.1504/IJSNET.2017.085759

International Journal of Sensor Networks, 2017 Vol.24 No.3, pp.139 - 148

Received: 15 May 2015
Accepted: 25 Sep 2015

Published online: 12 Aug 2017 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article