A Dynamic Timeslot Assignment Algorithm for Asymmetric Traffic in Multimedia TDMA/TDD Mobile Radio
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E81-A No.7 pp.1358-1366
- Publication Date
- 1998/07/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Section on Fundamentals of Multi-dimensional Mobile Information Network)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Lan CHEN, Susumu YOSHIDA, Hidekazu MURATA, Shouichi HIROSE, "A Dynamic Timeslot Assignment Algorithm for Asymmetric Traffic in Multimedia TDMA/TDD Mobile Radio" in IEICE TRANSACTIONS on Fundamentals,
vol. E81-A, no. 7, pp. 1358-1366, July 1998, doi: .
Abstract: 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e81-a_7_1358/_p
Copy
@ARTICLE{e81-a_7_1358,
author={Lan CHEN, Susumu YOSHIDA, Hidekazu MURATA, Shouichi HIROSE, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Dynamic Timeslot Assignment Algorithm for Asymmetric Traffic in Multimedia TDMA/TDD Mobile Radio},
year={1998},
volume={E81-A},
number={7},
pages={1358-1366},
abstract={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.},
keywords={},
doi={},
ISSN={},
month={July},}
Copy
TY - JOUR
TI - A Dynamic Timeslot Assignment Algorithm for Asymmetric Traffic in Multimedia TDMA/TDD Mobile Radio
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1358
EP - 1366
AU - Lan CHEN
AU - Susumu YOSHIDA
AU - Hidekazu MURATA
AU - Shouichi HIROSE
PY - 1998
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E81-A
IS - 7
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - July 1998
AB - 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.
ER -
English
