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.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.