Cart (Loading....) | Create Account
Close category search window
 

Sentry Selection in Sensor Networks: A Sufficient Condition for k Single Covers

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Balister, P. ; Dept. of Math., Univ. of Memphis, Memphis, TN ; Bollobas, B. ; Haenggi, M. ; Sarkar, A.
more authors

Wireless sensor networks are becoming increasingly popular due to their numerous applications and advances in microelectronics. One basic application is the surveillance or monitoring of large areas. Assuming n sensor nodes are randomly deployed and each sensor can cover a circular area of a certain radius r, a central question is what fraction the total area of interest can be expected to be covered (as a function of n and r). This question has been answered for certain cases. We present a recent result on a related problem, the so-called sentry selection problem. In practical applications, it is desirable to turn most of the sensor nodes off to conserve energy, while having a subset of nodes active acting as sentries. After a certain period of time, the sentry duty is moved to a disjoint set of nodes, and so on. Let the desired number of subsets be k. Then the sentry selection problem is the following: Find the minimum radius r such that there exists a partition of the node set into k subsets that each provide a (single) cover of the area of interest. Note that this is different from asking for k-coverage, since a k-cover may not be divisible into k single covers.

Published in:

Communications, 2008 IEEE International Zurich Seminar on

Date of Conference:

12-14 March 2008

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.