By Topic

Scheduling Prioritized Services in Multihop OFDMA Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Gupta, A. ; Dept. of Comput. Sci., Univ. of California at Davis, Davis, CA, USA ; Ghosh, D. ; Mohapatra, P.

Growing popularity of high-speed wireless broadband 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.

Published in:

Networking, IEEE/ACM Transactions on  (Volume:18 ,  Issue: 6 )