Skip to main content
Article
Sentry Selection in Sensor Networks: Theory and Algorithms
International Journal of Sensor Networks (2017)
  • Paul Balister, University of Memphis
  • Béla Bollobás, University of Cambridge
  • Martin Haenggi, University of Notre Dame
  • Amites Sarkar, Western Washington University
  • Mark Walters, Queen Mary University of London
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
Publication Date
2017
DOI
10.1504/IJSNET.2015.10001255
Citation Information
Paul Balister, Béla Bollobás, Martin Haenggi, Amites Sarkar, et al.. "Sentry Selection in Sensor Networks: Theory and Algorithms" International Journal of Sensor Networks Vol. 24 Iss. 3 (2017) p. 139 - 148
Available at: http://works.bepress.com/amites_sarkar/22/