Load balancing for typical radar systems with overlapping surveillance space

Dwell scheduling has been an important issue for radar systems. This research explores the on-line dwell scheduling issue over multiple transmitters/receivers in radar systems. We investigate the minimization of the maximum load in the system to balance workloads over multiple transmitters/receivers. Two on-line algorithms are proposed and analyzed against adversaries. Algorithm GREEDY, which assigns an incoming dwell task to the available transmitters/receivers, is shown to be a 3-competitive algorithm against the adversary. The online algorithm, denoted by Algorithm FIXED, by assigning the arriving dwell task to a pre-defined transmitters/receivers is proved to be a 2-competitive algorithm. The capability of the proposed algorithms is evaluated by a series of experiments. Although Algorithm FIXED outperforms Algorithm GREEDY against adversaries in the worst cases, Algorithm GREEDY outperforms Algorithm FIXED if the dwell tasks are uniformly distributed in the behavior in experiments.