We consider in this paper downlink scheduling for different traffic classes at the MAC layer of wireless systems based on orthogonal frequency division multiple access (OFDMA), such as the recent 3rd Generation Partnership Project (3GPP) long-term evolution (LTE)/LTE-A wireless standard. Our goal is to provide via the scheduling decisions quality of service (QoS), but also to guarantee fairness...

In this study, a scheduling algorithm based on communication delay is proposed. This scheduling algorithm can tolerate delay of periodic communication tasks in wireless network control system. It resolves real-time problem of periodic communication tasks in wireless network control system and partly reduces overtime phenomenon of periodic communication tasks caused by delay in wireless network....

IEEE 802.16 is a standardisation for a broadband wireless access in metropolitan area networks (MAN). Since the IEEE 802.16 standard defines the concrete quality of service (QoS) requirement, a scheduling scheme is necessary to achieve the QoS requirement. Many scheduling schemes are proposed with the purpose of throughput optimisation and fairness enhancement, however, few scheduling schemes s...

Feasible region is a simple and optimal framework for scheduling the transmission of data with deadlines. In this paper, we establish the fundamental relationship between the bandwidth requirement and the initial delay in feasible-region-based transmission scheduling. The relationship represents the optimal band-width/delay tradeoo. In the process, we identify the essential bandwidth, the exact...

IEEE 802.16 mesh standard specifies uses Time Division Multiple Access (TDMA) technology to provide end-to-end Quality-of-Service (QoS). However, the performance in the mesh depends on TDMA scheduling algorithms. A new class of TDMA scheduling algorithms, based on the BellmanFord algorithm, was proposed recently. This class of TDMA scheduling algorithms takes into account many of the QoS issues...

Wireless sensor networks have been attracting significant research and commercial interest recently. In many sensor network applications, such as real-time surveillance and monitoring, the sensed data need to be delivered with some real-time constraints, such as an end-to-end deadlines. Since the data dissemination model is different from the tranditional wireless ad hoc networks or any central...

Providing end-to-end delay has been an important issue in Quality of Service enabled networks. If we can assign a call’s end-to-end delay requirement optimally to each node along the route of that call, the whole network can be better utilized. In practice, routers in a network are likely to use different packet scheduling policies. Due to the differences in the scheduling policies, delay bound...

The network nodes that are connected by wireless data connections called as wireless networks. The devices are connected via wireless link to communicate with each other. In wireless networks, it is very difficult to maintain the trade-off between throughput and delay. This paper proposes a new joint scheduling and congestion control algorithm for multihop wireless networks with dynamic route f...

This work addresses opportunistic distributed multiuser scheduling in the presence of a fixed packet deadline delay constraint. A threshold-based scheduling scheme is proposed which uses the instantaneous channel gain and buffering time of the individual packets to schedule a group of users simultaneously in order to minimize the average system energy consumption while fulfilling the deadline d...

The paper presents a modified version of the deficit round-robin (DRR) scheduling algorithm due to [1]. The proposed scheduling scheme called Weighted Switch Deficit Round Robin (WSDRR) categorises the different frame types of compressed video which are handled in separate queues and prioritizes time-sensitive and visually important data. WSDRR also introduces an overdraft threshold that basica...