Building Robust Spanning Trees in Free Space Optical Networks
Free Space Optical (FSO) technology has been considered as a viable solution for broadband wireless networks. It has high potential for military communications for the next decade. In this paper, the authors investigate the problem of building robust spanning trees for FSO networks. They adopt algebraic connectivity as robustness measure, and formulate a 0-1 Integer Linear Programming (ILP) problem. They present a Fragment Selection and Merging (FSM) algorithm, which is executed in a distributed and asynchronous fashion to iteratively merge fragments until a spanning tree is formed. Their simulation study shows that FSM can achieve significantly improved connectivity at the cost of slightly degraded average link weight performance, compared to prior approaches.