ABSTRACT
S.C. Borst,1 E.G. Coffman, E.N. Gilbert, P.A. Whiting and P.M. Winkler Bell Labs, Lucent Technologies
Abstract An important design issue in implementing Dynamic Channel Assignment in Time Division Multiple Access (TDMA) wireless networks is whether resource allocation can be done efficiently at the time slot level. Allocation at this level is seriously hampered by the lack of synchronization between base stations in distinct cells. We present simple greedy packing algorithms which overcome this obstacle by clustering calls in adjacent time slots. The results suggest that the algorithms are nearly optimal, and that little extra performance can be gained either by allowing the rejection of calls or by repacking. Keywords: mobile communications, wireless networks, TDMA wireless systems, dynamic channel allocation.
