Sorry, you need to enable JavaScript to visit this website.

GREEDY APPROACHES TO FINDING A SPARSE COVER IN A SENSOR NETWORK WITHOUT LOCATION INFORMATION

Citation Author(s):
Submitted by:
Terrence Moore
Last updated:
2 December 2016 - 7:22pm
Document Type:
Poster
Document Year:
2016
Event:
Presenters:
Terrence J Moore
Paper Code:
SPN-P1.7
 

Modeling a location-unaware sensor network as a simplicial complex, where simplices correspond to cliques in the communication graph, has proven useful for solving a number of coverage problems under certain conditions using algebraic topology. Several approaches to finding a sparse cover for a fenced sensor network are considered, including calculating homology changes locally, strong collapsing, and Euler characteristic collapsing.

up
0 users have voted: