Algebraic connectivity of degree constrained spanning trees for FSO networks
Algebraic connectivity of degree constrained spanning trees for FSO networks
复制标题
DOI：
10.1109/icc.2013.6655558
复制
发表时间：
2013-06
期刊：
影响因子：
--
通讯作者：
Hui Zhou;A. Babaei;S. Mao;P. Agrawal
中科院分区：
文献类型：
--
作者：
Hui Zhou;A. Babaei;S. Mao;P. Agrawal
自由空间光网络是一种极具吸引力的技术，其应用范围从高容量军事通信到“最后一英里”宽带接入解决方案。拓扑控制是FSO网络中的一个重要问题。在FSO网络中，当每个基站上的收发信机数量有限时，建立生成树的问题是NP困难的。使问题更具挑战性的是最大化生成树的代数连通性。本文提出了一种初始配置或自举算法，该算法生成具有高代数连通性和高平均边权重的度约束生成树，其中图中的边权重代表FSO链路的可靠性。我们还提出了一种在FSO网络中一条或多条链路发生故障时的快速重构算法。我们的算法在改善代数连通性和平均边权重方面优于其他方案。所得到的FSO网络拓扑的健壮性显著提高。
Free space optical (FSO) networking is an attractive technology with applications ranging from high capacity military communications to “Last-mile” broadband access solutions. Topology control is an important problem in FSO networks. The problem of building a spanning tree when number of transceivers on each base station is limited, in FSO networks, is NP-hard. What makes the problem even more challenging is to maximize the algebraic connectivity of the spanning tree. In this paper, we develop an initially configuring, or bootstrapping, algorithm which produces a degree constrained spanning tree with high algebraic connectivity and also high average edge weight, where the edge weight in the graph represents the FSO link reliability. We also develop a fast reconfiguration algorithm when one or more links fail in the FSO network. Our algorithms outperform alternative schemes in improving both algebraic connectivity and average edge weight. The robustness of the resulting topology of FSO networks is significantly improved.