Skip to main content
Article thumbnail
Location of Repository

Detecting Cuts in Sensor Networks

By Nisheeth Shrivastava and Subhash Suri

Abstract

Abstract — We propose a low overhead scheme for detecting a network partition or cut in a sensor network. Consider a network S of n sensors, modeled as points in a two-dimensional plane. An ε-cut, for any 0 <ε< 1, is a linear separation of εn nodes in S from a distinguished node, the base station. We show that the base station can detect whenever an ε-cut occurs by monitoring the status of just O ( 1) nodes in the network. ε Our scheme is deterministic and it is free of false positives: no reported cut has size smaller than 1 εn. Besides this combinatorial result, we also 2 propose efficient algorithms for finding the O ( 1) nodes that should act ε as sentinels, and report on our simulation results, comparing the sentinel algorithm with two natural schemes based on sampling. I

Year: 2005
OAI identifier: oai:CiteSeerX.psu:10.1.1.135.7490
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://math.mit.edu/~toth/sent... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.