Download Now Free registration required
In this paper, the authors provide a homology based algorithm for disaster recovery of wireless networks. They consider a damaged wireless network presenting coverage holes that they need to restore by patching the holes. They propose an algorithm which adds supernumerary vertices to cover the entire area, then run an improved reduction algorithm to reach an optimal result with a minimum number of added vertices. The algorithm is homology based, using simplicial homology representation to compute the coverage and abstract simplicial complex structure to know redundancy vertices information.
- Format: PDF
- Size: 1559.6 KB