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.