Topology design for free space optical networks

被引:22
作者
Gurumohan, PC [1 ]
Hui, J [1 ]
机构
[1] Arizona State Univ, Dept Elect Engn, Tempe, AZ 85287 USA
来源
ICCCN 2003: 12TH INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS AND NETWORKS, PROCEEDINGS | 2003年
关键词
D O I
10.1109/ICCCN.2003.1284227
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
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.
引用
收藏
页码:576 / 579
页数:4
相关论文
共 17 条
[1]  
BEYER D, 2002, WIRELESS COMMUNI JAN
[2]  
BOLLOBAS B, 1998, MODERN GRAPH THEORY, P75
[3]  
COOPER C, 1996, COMBINATORICS PROBAB, V4
[4]  
FARAGO, 1999, VPN NETWORK TOPOLOGY
[5]   Mesh networks for broadband access [J].
Fowler, T .
IEE REVIEW, 2001, 47 (01) :17-22
[6]  
HU L, 1993, IEEE T COMMUNICA OCT, P41
[7]  
IZADPANAH H, 2001, IEEE COMMUNICATI SEP, P39
[8]  
KRISHNAMURTHY S, 1998, IEEE JSAC AUG, P16
[9]   2 ALGORITHMS FOR CONSTRUCTING A DELAUNAY TRIANGULATION [J].
LEE, DT ;
SCHACHTER, BJ .
INTERNATIONAL JOURNAL OF COMPUTER & INFORMATION SCIENCES, 1980, 9 (03) :219-242
[10]  
LEE DT, 1986, GEOMETRY, P201