Traffic sensitive algorithms for generating self-organizing network schedules

The generation of transmission schedules for self-organizing networks by traffic-sensitive algorithms is described. A centralized traffic algorithm is used as a basis for the comparison of other algorithms. This algorithm is based on a suggestion made by A. Ephremides and T. Truong (IEEE INFOCOM 1988, pp. 1119-1124) to construct a priority rule based on traffic requirements. Although it is not possible to implement this algorithm in a distributed form, a distributed algorithm using nodal degree to determine priority among nodes is presented and shown to produce results closer to those of the preferred traffic-based algorithm than id-number-based priority does.