Currently, over 100 million objects orbit our planet in Low-Earth Orbit (LEO). To track these objects, the United States utilizes the Space Surveillance Network (SSN). However, numerous countries and corporations continue to expand their utilization of space leaving in their wake a sea of space debris. The rate that the number of objects is increasing has now outpaced our ability to build additional sites and there is an increasing concern for the safety of our astronauts and other space-borne assets. Another solution is to use large numbers of low-cost optical sensors, which can be easily deployed at a fraction of the cost of a traditional tracking station. However, the introduction of these systems, which are subject to time and position constraints, creates a complex coordination problem that must be solved in a communication limited environment. In this paper, we describe the satellite tracking problem and compare a resource allocation and scheduling representation for the problem. As an initial solution, scheduling tasks to telescope-slot pairs by a central facility is adopted. Then, we compare central and distributed repair mechanisms in terms of tasks completed and the communication cost. Finally, different distributed repair mechanism are proposed and compared.
[1]
Eli Gafni,et al.
An O(n^2 m^1/2) Distributed Max-Flow Algorithm
,
1987,
ICPP.
[2]
Bhaskar Krishnamachari,et al.
Communication and Computation in DisCSP Algorithms
,
2002
.
[3]
K. M. Mjelde.
Methods of the Allocation of Limited Resources
,
1983
.
[4]
James G. Miller,et al.
A New Sensor Allocation Algorithm for the Space Surveillance Network
,
2007
.
[5]
Toshihide Ibaraki,et al.
Resource allocation problems - algorithmic approaches
,
1988,
MIT Press series in the foundations of computing.
[6]
Naoki Katoh,et al.
Resource Allocation Problems
,
1998
.
[7]
Ivan Lavallée,et al.
A Distributed Algorithm for the Maximum Flow Problem
,
2005,
The 4th International Symposium on Parallel and Distributed Computing (ISPDC'05).