By Topic

Coverage and hole-detection in sensor networks via homology

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

2 Author(s)
Ghrist, R. ; Dept. of Math., Illinois Univ., Urbana, IL, USA ; Muhammad, A.

We consider coverage problems in sensor networks of stationary nodes with minimal geometric data. In particular, there are no coordinates and no localization of nodes. We introduce a new technique for detecting holes in coverage by means of homology, an algebraic topological invariant. The impetus for these techniques is a completion of network communication graphs to two types of simplicial complexes: the nerve complex and the Rips complex. The former gives information about coverage intersection of individual sensor nodes, and is very difficult to compute. The latter captures connectivity in terms of inter-node communication: it is easy to compute but does not in itself yield coverage data. We obtain coverage data by using persistence of homology classes for Rips complexes. These homological invariants are computable: we provide simulation results.

Published in:

Information Processing in Sensor Networks, 2005. IPSN 2005. Fourth International Symposium on

Date of Conference:

15 April 2005