Paper
28 April 2010 Identification and description of coverage holes in a wireless sensor network using graph theory and homology
Author Affiliations +
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.
© (2010) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Simon Uribe Peláez "Identification and description of coverage holes in a wireless sensor network using graph theory and homology", Proc. SPIE 7706, Wireless Sensing, Localization, and Processing V, 77060R (28 April 2010); https://doi.org/10.1117/12.849538
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Sensor networks

Sensors

Algorithm development

Wireless communications

Environmental monitoring

Vector spaces

Visualization

Back to Top