Modelling and performance analysis of the distributed scheduler in IEEE 802.16 mesh mode
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Algorithms for routing and centralized scheduling to provide QoS in IEEE 802.16 mesh networks
WMuNeP '05 Proceedings of the 1st ACM workshop on Wireless multimedia networking and performance modeling
Efficient interference-aware TDMA link scheduling for static wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Ensuring the QoS requirements in 802.16 scheduling
Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems
Performance evaluation of scheduling in IEEE 802.16 based wireless mesh networks
Computer Communications
Resource Allocation for Delay Differentiated Traffic in Multiuser OFDM Systems
IEEE Transactions on Wireless Communications
Multiuser OFDM with adaptive subcarrier, bit, and power allocation
IEEE Journal on Selected Areas in Communications
Transmit power adaptation for multiuser OFDM systems
IEEE Journal on Selected Areas in Communications
Resource Allocation for OFDMA Relay Networks With Fairness Constraints
IEEE Journal on Selected Areas in Communications
Optimization problems in proportional differentiated admission control
Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication
Hi-index | 0.00 |
Growing popularity of high-speed wireless broad-band access for real-time applications makes it increasingly relevant to study the admission control and scheduling of flows in a service differentiated manner. Next-generation wireless broadband networks employ orthogonal frequency division multiple access (OFDMA) technology that enables multiple users to communicate at the same time using a time-frequency grid. In this paper, we provide a mathematical model for prioritized admission control and scheduling in OFDMA-based multihop wireless networks. The problem is formulated as an integer linear program (ILP) that does joint admission control and scheduling of flows while satisfying its rate and latency requirements. We propose different heuristic algorithms for scheduling priority-based flows in centralized multihop OFDMA networks. We define the "Flow Admittance" (FA) metric and compare the different scheduling schemes based on this metric. Simulation results show that the Start from Frame Beginning (SFB) heuristic performs well in most of the scenarios. We also propose a combination approach that merges multiple heuristics. The FA values obtained from the combination approach are close to the ILP while incurring computation time orders of lower magnitude.