Summary
This report is an attempt to define the interrogation scheduling problem which arised in the implementation of the discrete address beacon idea. The interfaces of this problem with other parts of the beacon system design are discussed, and several specific algorithms for scheduling are analyzed for arrays and rotating antennas.