User priority aware scheduling and dynamic resource allocation in orthogonal frequency division multiple access

Access Full Text

User priority aware scheduling and dynamic resource allocation in orthogonal frequency division multiple access

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IET Communications — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

© The Institution of Engineering and Technology
Published

In this study, new mathematical formulations and algorithms for joint scheduling and hybrid resource allocation are derived and investigated for a multi-user downlink orthogonal frequency division multiple access system. A three-sectored multi-cellular heterogeneous traffic environment is considered where users are randomly distributed and categorised under different priority levels. Traffic consists of time delay-sensitive and time delay-insensitive services. Three practical scheduling and resource allocation methods are proposed to address the balance between throughput, outage probability and resource efficiency under varying channel conditions. The proposed methods are based on the Lagrangian duality framework, and are formulated as mixed integer programming problems constrained by the total power of the base station and users' data rate while maintaining the quality of service for each user. Both dynamic and fixed resource allocation approaches are included in the main problem formulation. The complexity of the resource allocation problem is minimised by approximating the well-known water level. Simulation results show that the total system throughput is penalised for the method that aims to minimise the outage probability of the highest priority level. This is because of the severe channel conditions experienced by some users, whereas the alternatively proposed methods maintain system efficiency under a similar amount of constrained resources and required traffic.

Inspec keywords: OFDM modulation; quality of service; resource allocation; integer programming

Other keywords: mixed integer programming; joint scheduling; dynamic resource allocation; quality of service; Lagrangian duality framework; hybrid resource allocation; user priority aware scheduling; orthogonal frequency division multiple access

Subjects: Optimisation techniques; Communication system theory; Modulation and coding methods

References

    1. 1)
      • Anas, M., Kim, K., Shin, S., Kim, K.: `QoS aware power allocation for combined guaranteed performance and best effort users in OFDMA systems', Proc. Int. Symp. on Intelligent Signal Processing and Communication Systems, November 2004.
    2. 2)
    3. 3)
    4. 4)
    5. 5)
    6. 6)
    7. 7)
      • Liu, X.: `Opportunistic scheduling in wireless communication networks', Purdue University, December 2002, PhD, .
    8. 8)
      • Paloheimo, H., Manner, J., Nieminen, J., Yla-Jaaski, A.: `Challenges in packet scheduling in 4G wireless networks', IEEE Int. Symp. on Personal, Indoor and Mobile Radio Communication, PIMRC, 2006.
    9. 9)
      • Al Rawi, A.F., Tsimenidis, C.C., Sharif, B.S.: `Fair scheduling and hybrid resource allocation in OFDMA cellular system', Proc. IEEE Personal, Indoor and Mobile Radio Conf. PIMRC, September 2010.
    10. 10)
    11. 11)
      • Lo, E.S., Letaief, K.B.: `Optimization downlink throughput with user cooperation and scheduling in adaptive cellular networks', Proc. IEEE Communication Society WCNC, 2007.
    12. 12)
      • V.S. Abhayawardhana , I.J. Wassell , D. Crosby , M.P. Sellars , M.G. Brown . Comparison of empirical propagation path loss models for fixed wireless access systems.
    13. 13)
      • Ibing, A., Boche, H.: `Fair OFDMA scheduling algorithm using iterative local search with ', Proc. IEEE WCNC, 2008.
    14. 14)
      • IEEE802.16-2004: ‘IEEE standard for local and metropolitan area networks part 16: air interface for fixed broadband wireless access systems’, 2004, available at www.ieee.org.
    15. 15)
      • S. Boyd , L. Vandenberghe . (2004) Convex optimization.
    16. 16)
    17. 17)
      • Cruz, R.L., Santhanam, A.V.: `Optimal routing, link scheduling and power control in multihop wireless networks', Proc. IEEE INFOCOM, 2003.
    18. 18)
    19. 19)
    20. 20)
      • Al Rawi, A.F., Sharif, B.S., Tsimenidis, C.C., Ntagkounakis, K.: `Influence of code orthogonality on downlink throughput comparison between MC-CMDA and OFDMA in multi-cellular environments', Proc. IEEE Symp. on Computers and Communications, July 2009.
    21. 21)
    22. 22)
    23. 23)
      • E.S. Lo , P.W.C. Chan , V.K.N. Lau . Performance comparison of downlink multiuser MIMO-OFDMA and MIMO-MC-CDMA with transmit side information multi-cell analysis. IEEE Trans. Wirel. Commun. , 3 , 2193 - 2203
    24. 24)
      • Agarwal, R., Majjigi, V., Vannithamby, R., Cioffi, J.M.: `Efficient scheduling for heterogeneous services in OFDMA downlink', Proc. IEEE Globecom, 2007.
    25. 25)
      • S. Boyd . Convex optimization II.
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-com.2010.0141
Loading

Related content

content/journals/10.1049/iet-com.2010.0141
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading