A fast link assignment algorithm for satellite communication networks

In satellite communication networks using laser transceivers, each satellite has a limited number of transceivers with a very narrow field of view. The authors consider the problem of deciding which logical connections should be formed among satellites out of all the possible connections that can be made depending on the line-of-sight (LOS) visibility of satellites. These logical connections can be decided to meet various objectives of the underlying network. The objective functions can be maximizing the number of links formed, thus, maximizing the transceiver utilization, maximizing network connectivity, minimizing link re-targeting, or minimizing average distance between nodes. Here, the satellite networks are assumed to be independent from intervention by ground stations. Hence, the decisions made should be autonomous. Another assumption is that all the computations and decisions made are either aperiodic or the input to computation is too unpredictable to be precomputed. Various approaches to link assignment with different objective functions and algorithms for some specific functions are described. Simulation results and performance analyses for some of the algorithms are also presented.<<ETX>>

[1]  Yuan-Chieh Chow,et al.  Initialization of dynamic laser networks , 1990 .

[2]  C. Ward,et al.  Optimizing the Delay and Reliability of Low Altitude Satellite Network Topologies , 1987, MILCOM 1987 - IEEE Military Communications Conference - Crisis Communications: The Promise and Reality.

[3]  Giuseppe F. Italiano,et al.  Incremental algorithms for minimal length paths , 1991, SODA '90.

[4]  Michael D. Noakes,et al.  A Distributed Link Assignment (Reconstitution) Algorithm for Space-Based SDI Networks , 1987, MILCOM 1987 - IEEE Military Communications Conference - Crisis Communications: The Promise and Reality.

[5]  ZVI GALIL,et al.  Efficient algorithms for finding maximum matching in graphs , 1986, CSUR.

[6]  R. Newman-Wolfe,et al.  An efficient algorithm for reconfiguration of large-scale point-to-point satellite computer networks with maximum connectivity , 1990, Ninth Annual International Phoenix Conference on Computers and Communications. 1990 Conference Proceedings.

[7]  Katarína Cechlárová The uniquely solvable bipartite matching problem , 1991, Oper. Res. Lett..

[8]  Udi Manber,et al.  Introduction to algorithms - a creative approach , 1989 .

[9]  J.H. Lodge Mobile satellite communications systems: Toward global personal communications , 1991, IEEE Communications Magazine.

[10]  C. McLochlin,et al.  Determining the delay and reliability of low altitude satellite network topologies using simulation , 1987 .

[11]  J.L. Grubb The traveler's dream come true (satellite personal communication) , 1991, IEEE Communications Magazine.

[12]  Alon Itai,et al.  The Multi-Tree Approach to Reliability in Distributed Networks , 1988, Inf. Comput..