Optimal Allocation of Satellite Network Resources

This work examines a straightforward solution to a problem of satellite network resource allocation by exploring the application of an optimal algorithm to a subset of the general scheduling problem. Making some basic simplifications, such as the limitation of the mission scenarios to Low Earth Orbiting satellites, allows the effective application of the rigorous methods of the Greedy Activity-Selector algorithm. Tools such as Analytical Graphic's Satellite Tool Kit and MATLAB 5.0 are integrated to assist in the implementation of the algorithm. Several examples are presented in order to illustrate the effectiveness of the process.

Name thesis:degree_name

Master of Science

Level thesis:degree_level

masters

Discipline thesis:degree_discipline

Mathematics

Department dc:contributor.department

Mathematics

Grantor dc:publisher

Virginia Tech

Year dc:date.issued

1999

Author dc:creator

• Burrowbridge, Sarah Elizabeth

Committee members dc:contributor.committeemember

• Hagar, Hamilton
• Borggaard, Jeffrey T.
• Herdman, Terry L.
• Burns, John A.

• Scheduler
• Mission Planning
• Greedy Algorithm

Statement dc:rights

• In Copyright

Licence dc:rights.uri

• http://rightsstatements.org/vocab/InC/1.0/

Dc Identifier Other

etd-122199-091647

OAI identifier oai:identifier

oai:vtechworks.lib.vt.edu:10919/36385