Show simple item record

dc.contributor.authorBurrowbridge, Sarah Elizabethen
dc.date.accessioned2014-03-14T20:50:37Zen
dc.date.available2014-03-14T20:50:37Zen
dc.date.issued1999-12-17en
dc.identifier.otheretd-122199-091647en
dc.identifier.urihttp://hdl.handle.net/10919/36385en
dc.description.abstractThis 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.en
dc.publisherVirginia Techen
dc.relation.haspartthesis-modified.pdfen
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.subjectScheduleren
dc.subjectMission Planningen
dc.subjectGreedy Algorithmen
dc.titleOptimal Allocation of Satellite Network Resourcesen
dc.typeThesisen
dc.contributor.departmentMathematicsen
dc.description.degreeMaster of Scienceen
thesis.degree.nameMaster of Scienceen
thesis.degree.levelmastersen
thesis.degree.grantorVirginia Polytechnic Institute and State Universityen
thesis.degree.disciplineMathematicsen
dc.contributor.committeememberHagar, Hamiltonen
dc.contributor.committeememberBorggaard, Jeffrey T.en
dc.contributor.committeememberHerdman, Terry L.en
dc.contributor.committeememberBurns, John A.en
dc.identifier.sourceurlhttp://scholar.lib.vt.edu/theses/available/etd-122199-091647/en
dc.date.sdate1999-12-21en
dc.date.rdate2000-12-31en
dc.date.adate1999-12-31en


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record