Optimal energy allocation and admission control for communications satellites

We address the issue of optimal energy allocation and admission control for communications satellites in earth orbit. Such satellites receive requests for transmission as they orbit the earth, but may not be able to serve them all, due to energy limitations. The objective is to choose which requests to serve so that the expected total reward is maximized. The special case of a single energy-constrained satellite is considered. Rewards and demands from users for transmission (energy) are random and known only at request time. Using a dynamic programming approach, an optimal policy is derived and is characterized in terms of thresholds. Furthermore, in the special case where demand for energy is unlimited, an optimal policy is obtained in closed form. Although motivated by satellite communications, our approach is general and can be used to solve a variety of resource allocation problems in wireless communications.

[1]  J.M. Aein,et al.  Satellite capacity allocation , 1977, Proceedings of the IEEE.

[2]  R.C. Collette,et al.  Design problems of spacecraft for communication missions , 1977, Proceedings of the IEEE.

[3]  Dimitri P. Bertsekas,et al.  Dynamic Programming and Optimal Control, Two Volume Set , 1995 .

[4]  Kenneth L. Calvert,et al.  Modeling Internet topology , 1997, IEEE Commun. Mag..

[5]  A. Ween,et al.  Dynamic resource allocation for multi-service packet based LEO satellite communications , 1998, IEEE GLOBECOM 1998 (Cat. NO. 98CH36250).

[6]  Jean-Yves Le Boudec,et al.  SRP: a Scalable Resource Reservation Protocol for the Internet , 1998, Wide Area Networks and High Performance Computing.

[7]  S. Pink,et al.  Aggregating resource reservations over multiple routing domains , 1998, 1998 Sixth International Workshop on Quality of Service (IWQoS'98) (Cat. No.98EX136).

[8]  Fotini-Niovi Pavlidou,et al.  Performance evaluation of LEO satellite constellations with inter‐satellite links under self‐similar and Poisson traffic , 1999 .

[9]  Ion Stoica,et al.  Providing guaranteed services without per flow management , 1999, SIGCOMM '99.

[10]  A. Terzis,et al.  A two-tier resource management model for the Internet , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

[11]  Laurie G. Cuthbert,et al.  Predictive Resource Allocation for Real Time Video Traffic in Broadband Satellite Networks , 1999, Broadband Communications.

[12]  ZhangHui,et al.  Providing guaranteed services without per flow management , 1999 .

[13]  Jens B. Schmitt,et al.  Aggregation of guaranteed service flows , 1999, 1999 Seventh International Workshop on Quality of Service. IWQoS'99. (Cat. No.98EX354).

[14]  Hui Zhang,et al.  Endpoint admission control: architectural issues and performance , 2000, SIGCOMM 2000.

[15]  Henning Schulzrinne,et al.  BGRP: Sink-tree-based aggregation for inter-domain reservations , 2000, Journal of Communications and Networks.

[16]  Ramesh R. Rao,et al.  Energy efficient battery management , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[17]  Ramesh R. Rao,et al.  Improving battery performance by using traffic shaping techniques , 2001, IEEE J. Sel. Areas Commun..

[18]  Markus Werner,et al.  Topological design, routing and capacity dimensioning for ISL networks in broadband LEO satellite systems , 2001, Int. J. Satell. Commun. Netw..