A Dynamic Timeslot Assignment Algorithm for Asymmetric Traffic in Multimedia TDMA/TDD Mobile Radio

Lan CHEN  Susumu YOSHIDA  Hidekazu MURATA  Shouichi HIROSE  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E81-A    No.7    pp.1358-1366
Publication Date: 1998/07/25
Online ISSN: 
Print ISSN: 0916-8508
Type of Manuscript: Special Section PAPER (Special Section on Fundamentals of Multi-dimensional Mobile Information Network)
mobile communication,  multimedia,  dynamic timeslot assignment,  blocking probability,  forced termination probability,  transmission delay,  

Full Text: PDF(710KB)>>
Buy this Article

Personal 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, an algorithm is proposed in which the TDD boundary are moved adaptively to accommodate data traffic efficiently. Comparing with the boundary-fixed conventional algorithm, computer simulations confirm that the proposed algorithm has superior performance in the excessive transmission delay of data while maintaining the performance of voice. The intercell interference between mobiles due to different TDD boundaries is also confirmed to be negligible. Moreover, almost the similar performance improvements of the proposed algorithm are confirmed for two different average message sizes of data calls.