Bandwidth on Demand for Laser Communications Satellites

Narrow beamwidth satellites such as laser communication or imaging satellites present a unique problem in control and scheduling. The narrow beamwidth limits the sources of information available to the satellite. This is especially true for laser communication satellites who can only point the laser at one user at a time. For the most part, this restricts the use of laser communications satellites to fixed connections or dedicated temporary connections. However, some classes of users can benefit from the speed and security of the lasercom connection. For example, a Globalhawk unmanned aerial vehicle with time sensitive battlefield imaging would be in this class. For this class of users a lasercom bandwidth-on-demand system would allow for high speed, secure, timely data transfer capability. The consequence of this narrow beamwidth is that the switching time for the system can no longer be ignored. In this dissertation, we will formulate the bandwidth-ondemand lasercom problem mathematically and determine several objective functions for improving the performance and quality of service. Next, we will derive equations that describe the limiting behavior of this system from a queueing standpoint. Next, we will also analyze the performance of the proposed objective functions, and look at real time solution methods and their performance. Next, we present a new algorithm for solving the traveling salesman problem that is easily applied to the systems such a bandwidth-on-demand lasercom, whose behavior cost cannot be described by a cost matrix that characterizes a standard traveling salesman problem. Finally, we present a system for emulating global coverage with a constellation of narrow beamwidth satellites such as imaging or laser communications satellite.

[1]  Dieter Baum,et al.  An introduction to queueing theory and matrix-analytic methods , 2005 .

[2]  William J. Cook,et al.  The Traveling Salesman Problem: A Computational Study , 2007 .

[3]  Frank Harary,et al.  Dynamic graph models , 1997 .

[4]  Özgür B. Akan,et al.  Performance of TCP protocols in deep space communication networks , 2002, IEEE Communications Letters.

[5]  Giovanni Rinaldi,et al.  A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems , 1991, SIAM Rev..

[6]  R. Prim Shortest connection networks and some generalizations , 1957 .

[7]  Stanley R. Rotman,et al.  Bandwidth maximization for satellite laser communication , 1998, Optics & Photonics.

[8]  Shen Lin Computer solutions of the traveling salesman problem , 1965 .

[9]  Tsun-Yee Yan,et al.  Considerations on communications network protocols in deep space , 2001, 2001 IEEE Aerospace Conference Proceedings (Cat. No.01TH8542).

[10]  Leonard Kleinrock,et al.  Queueing Systems - Vol. 1: Theory , 1975 .

[11]  M. Held,et al.  A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.

[12]  Erik H. Kjeldsen Optimizing satellite communications access with simulation , 1994, Proceedings of Winter Simulation Conference.

[13]  G. Croes A Method for Solving Traveling-Salesman Problems , 1958 .

[14]  Antonio Pietrabissa,et al.  Resource management for ATM-based geostationary satellite networks with on-board processing , 2002, Comput. Networks.

[15]  T. Le-Ngoc,et al.  Combined free/demand assignment multiple access (CFDAMA) protocols for packet satellite communications , 1993, Proceedings of 2nd IEEE International Conference on Universal Personal Communications.

[16]  D. Bertsimas,et al.  STOCHASTIC AND DYNAMIC VEHICLE ROUTING PROBLEM IN THE EUCLIDEAN PLANE WITH MULTIPLE CAPACITATED VEHICLES. , 1993 .

[17]  Michel X. Goemans,et al.  Probabilistic Analysis of the Held and Karp Lower Bound for the Euclidean Traveling Salesman Problem , 1991, Math. Oper. Res..

[18]  G. V. Shenoy,et al.  Linear programming: methods and applications , 1958 .

[19]  Abraham P. Punnen,et al.  The Traveling Salesman Problem: Applications, Formulations and Variations , 2007 .

[20]  Sean R Eddy,et al.  What is dynamic programming? , 2004, Nature Biotechnology.

[21]  Keith E. Wilson,et al.  Preliminary results of the Ground/Orbiter Lasercom Demonstration experiment between Table Mountain and the ETS-VI satellite , 1996, Photonics West.

[22]  Catherine Rosenberg,et al.  Weighted fair bandwidth-on-demand (WFBoD) for geostationary satellite systems , 2001, SPIE ITCom.

[23]  P. Mahalanobis A sample survey of the acreage under jute in Bengal. , 1940 .

[24]  David S. Johnson,et al.  8. The traveling salesman problem: a case study , 2003 .

[25]  H. Kuhn The Hungarian method for the assignment problem , 1955 .

[26]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[27]  Charles M. Grinstead,et al.  Introduction to probability , 1999, Statistics for the Behavioural Sciences.

[28]  Mandell Bellmore,et al.  Pathology of Traveling-Salesman Subtour-Elimination Algorithms , 1971, Oper. Res..

[29]  J. Meadows,et al.  Operations Timeline for Tsat Planning , 2006, MILCOM 2006 - 2006 IEEE Military Communications conference.

[30]  F. Yegenoglu,et al.  TSAT advanced network services and routing architecture , 2006, 2006 IEEE Aerospace Conference.

[31]  David S. Johnson,et al.  Asymptotic experimental analysis for the Held-Karp traveling salesman bound , 1996, SODA '96.

[32]  E. Kay,et al.  Graph Theory. An Algorithmic Approach , 1975 .

[33]  Mark Allman,et al.  Enhancing TCP Over Satellite Channels using Standard Mechanisms , 1999, RFC.

[34]  Z. Sodnik,et al.  Free-Space Laser Communication Activities in Europe: SILEX and beyond , 2006, LEOS 2006 - 19th Annual Meeting of the IEEE Lasers and Electro-Optics Society.

[35]  Antonio Pietrabissa,et al.  Design of a bandwidth-on-demand (BoD) protocol for satellite networks modelled as time-delay systems , 2004, Autom..

[36]  Victor C. M. Leung,et al.  Interactive multimedia satellite access communications , 2003, IEEE Commun. Mag..

[37]  M. N. Shanmukha Swamy,et al.  Graphs - theory and algorithms , 1992 .

[38]  M. M. Flood The Traveling-Salesman Problem , 1956 .

[39]  T. Le-Ngoc,et al.  Performance of combined free/demand assignment multi-access (CFDAMA) protocol with pre-assigned request slots in integrated voice/data satellite communications , 1995, Proceedings IEEE International Conference on Communications ICC '95.

[40]  Alan M. Richard,et al.  Overview on In-Space Internet Node Testbed (ISINT) , 2000 .

[41]  John N. Tsitsiklis,et al.  Introduction to Probability , 2002 .

[42]  Dimitris Bertsimas,et al.  A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane , 1991, Oper. Res..

[43]  J. Beardwood,et al.  The shortest path through many points , 1959, Mathematical Proceedings of the Cambridge Philosophical Society.

[44]  Nicos Christofides,et al.  Technical Note - Bounds for the Travelling-Salesman Problem , 1972, Oper. Res..

[45]  J. Kruskal On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[46]  A. J. Jones,et al.  Estimating the Held-Karp lower bound for the geometric TSP , 1997 .

[47]  David Grace,et al.  Burst targeted demand assignment multiple-access for broadband Internet service delivery over geostationary satellite , 2004, IEEE Journal on Selected Areas in Communications.

[48]  John G. Proakis,et al.  Probability, random variables and stochastic processes , 1985, IEEE Trans. Acoust. Speech Signal Process..

[49]  K. E. Wilson,et al.  An Overview of the Galileo Optical Experiment (GOPEX) , 1993 .

[50]  Harilaos N. Psaraftis,et al.  Dynamic vehicle routing: Status and prospects , 1995, Ann. Oper. Res..

[51]  Shlomi Arnon,et al.  Enhanced ATM for satellite laser communication networks , 1999 .