Abstract
UTRA-TDD is one of the adopted air interfaces for third-generation mobile communication systems (UMTS). In UTRA-TDD, information packets are transmitted organized into radio frames. A radio frame is divided into a fixed number of time slots and different packets can be sent on the same time slot by means of the Code Division Multiple Access technique. Packets belong to different traffic classes and have different formats and Quality of Service (QoS) requirements in terms of delay, transmission error probability and priority level. In this paper, we address the problem of scheduling packets for downlink transmissions in the time slots of a frame, in such a way that QoS requirements are fulfilled. In particular, exact pseudo-polynomial and heuristic scheduling algorithms are compared in terms of typical performance parameters. Computational results for three traffic classes show that the proposed algorithms are suitable for UTRA-TDD implementation, both for solution quality and computational time.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
