Share Email Print

Proceedings Paper

Identification and description of coverage holes in a wireless sensor network using graph theory and homology
Author(s): Simon Uribe Peláez
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Identifying coverage holes makes an important topic for optimization of quality service for wireless sensor network hosts. This paper introduces a new way to identify and describe how is the network's structure, its number of holes and its components, assuming there's a sensor covering an area where a network communication exists. The simplicial complex method and algebraic graph theory will be applied. Betti numbers and Euler characteristics will be used for a sensor network represented by a simplicial complex, and the Tutte polynomial will be used for describing visual graphs algebraically, for a complete identification.

Paper Details

Date Published: 28 April 2010
PDF: 12 pages
Proc. SPIE 7706, Wireless Sensing, Localization, and Processing V, 77060R (28 April 2010); doi: 10.1117/12.849538
Show Author Affiliations
Simon Uribe Peláez, EAFIT Univ. (Colombia)

Published in SPIE Proceedings Vol. 7706:
Wireless Sensing, Localization, and Processing V
Sohail A. Dianat; Michael D. Zoltowski, Editor(s)

© SPIE. Terms of Use
Back to Top