Answers are grounded in this paper and cite their sources.
In this paper, we consider the problem of designing a topology for deploying a free space optical (FSO) link based network. The problem is to create a topology with strong connectivity and short diameter with uniform degree bounds on each node. Two centralized approaches are presented. The first approach constructs a backbone network by Delaunay triangulation. The basic structure is then refined to meet the design objectives. The second approach called the closest neighbor (CN) algorithm constructs a degree constrained minimum weight spanning tree. The tree is developed into a network with good connectivity and small diameter by forming edges with the closest neighbors. We prove that the CN algorithm forms a connected network. Through simulation and analysis we also show that this approach results in high reliability and small diameter.
No takes yet. Share an insight, caveat, or question.
Gurumohan et al. (2004) studied this question.