TY - GEN
T1 - Disaster recovery in wireless networks
T2 - 21st International Conference on Telecommunications, ICT 2014
AU - Vergne, A.
AU - Flint, I.
AU - Decreusefond, L.
AU - Martins, P.
PY - 2014/1/1
Y1 - 2014/1/1
N2 - In this paper, we present an algorithm for the recovery of wireless networks after a disaster. Considering a damaged wireless network, presenting coverage holes or/and many disconnected components, we propose a disaster recovery algorithm which repairs the network. It provides the list of locations where to put new nodes in order to patch the coverage holes and mend the disconnected components. In order to do this we first consider the simplicial complex representation of the network, then the algorithm adds supplementary vertices in excessive number, and afterwards runs a reduction algorithm in order to reach an optimal result. One of the novelty of this work resides in the proposed method for the addition of vertices. We use a determinantal point process: the Ginibre point process which has inherent repulsion between vertices, and has never been simulated before for wireless networks representation. We compare both the determinantal point process addition method with other vertices addition methods, and the whole disaster recovery algorithm to the greedy algorithm for the set cover problem.
AB - In this paper, we present an algorithm for the recovery of wireless networks after a disaster. Considering a damaged wireless network, presenting coverage holes or/and many disconnected components, we propose a disaster recovery algorithm which repairs the network. It provides the list of locations where to put new nodes in order to patch the coverage holes and mend the disconnected components. In order to do this we first consider the simplicial complex representation of the network, then the algorithm adds supplementary vertices in excessive number, and afterwards runs a reduction algorithm in order to reach an optimal result. One of the novelty of this work resides in the proposed method for the addition of vertices. We use a determinantal point process: the Ginibre point process which has inherent repulsion between vertices, and has never been simulated before for wireless networks representation. We compare both the determinantal point process addition method with other vertices addition methods, and the whole disaster recovery algorithm to the greedy algorithm for the set cover problem.
U2 - 10.1109/ICT.2014.6845113
DO - 10.1109/ICT.2014.6845113
M3 - Conference contribution
AN - SCOPUS:84904430469
SN - 9781479951413
T3 - 2014 21st International Conference on Telecommunications, ICT 2014
SP - 226
EP - 230
BT - 2014 21st International Conference on Telecommunications, ICT 2014
PB - IEEE Computer Society
Y2 - 4 May 2014 through 7 May 2014
ER -