Dynamic timeslot allocation algorithms suitable for asymmetric traffic in multimedia TDMA/TDD cellular radio

Mobile communication systems are increasingly required to accommodate not only voice traffic, but also various types of data traffic. Generally speaking, voice traffic is symmetric between uplink and downlink, while data traffic can be highly asymmetric. It is therefore inefficient to accommodate data in a conventional TDMA/TDD system with fixed TDD boundary. In this paper, focusing on the continuous data traffic which requires multi-slots in a circuit based TDMA/TDD system, two algorithms are proposed in which the TDD boundaries are moved adaptively to accommodate data traffic efficiently. One moves the TDD boundaries of all carriers simultaneously, while the other moves the TDD boundary of each carrier independently and allocate the timeslot after considering the adjacent carrier interference. Comparing with the fixed-boundary conventional algorithm, computer simulations confirm that the proposed algorithms have superior performance in the transmission delay of data while maintaining the performance of voice