Sub-Channel Assignment, Power Allocation, and User Scheduling for Non-Orthogonal Multiple Access Networks

IEEE Transactions on Wireless Communications

Volumn 15, Issue 11, 2016, Pages 7686-7698

  Di, Boya ^a   Song, Lingyang ^a   Li, Yonghui ^b  

^a PEKING UNIVERSITY   (China)

^b UNIVERSITY OF SYDNEY   (Australia)

Author keywords

matching game; Non orthogonal multiple access; resource allocation; scheduling problem

Indexed keywords

ITERATIVE METHODS; RESOURCE ALLOCATION; SCHEDULING;

MATCHING ALGORITHM; MATCHING GAME; MULTIPLE ACCESS; MULTIPLE ACCESS NETWORK; MULTIPLE ACCESS SCHEME; NUMBER OF ITERATIONS; SCHEDULING PROBLEM; SUBCHANNEL ASSIGNMENT;

MOBILE TELECOMMUNICATION SYSTEMS;

EID: 85027056198     PISSN: 15361276     EISSN: None     Source Type: Journal    
DOI: 10.1109/TWC.2016.2606100     Document Type: Article

References (42)

1. B. Di, S. Bayat, L. Song, and Y. Li, "Radio resource allocation for downlink non-orthogonal multiple access (NOMA) networks using matching theory, " in Proc. IEEE Global Commun. Conf. (GlobeCom), San Diego, CA, USA, Dec. 2015, pp. 1-6
2. A. Ghosh, R. Ratasuk, B. Mondal, N. Mangalvedhe, and T. Thomas, "LTE-advanced: Next-generation wireless broadband technology [Invited Paper], " IEEE Wireless Commun., vol. 17, no. 3, pp. 10-22, Jun. 2010.
3. L. Dai, B. Wang, Y. Yuan, S. Han, C.-L. I, and Z. Wang, "Nonorthogonal multiple access for 5G: Solutions, challenges, opportunities, and future research trends, " IEEE Commun. Mag., vol. 53, no. 9, pp. 74-81, Sep. 2015.
4. J. Thompson et al., "5G wireless communication systems: Prospects and challenges [Guest Editorial], " IEEE Commun. Mag., vol. 52, no. 2, pp. 62-64, Feb. 2014.
5. L. Ping, L. Liu, K. Wu, and W. Leung, "On interleave-division multipleaccess, " in Proc. IEEE Int. Conf. Commun. (ICC), Paris, France, Jun. 2004, pp. 2869-2873.
6. M. Imari, M. Imran, and R. Tafazolli, "Low density spreading multiple access, " Inf. Technol. Softw. Eng., vol. 2, no. 4, pp. 1-2, Sep. 2012.
7. Y. Saito, Y. Kishiyama, A. Benjebbour, T. Nakamura, A. Li, and K. Higuchi, "Non-orthogonal multiple access (NOMA) for cellular future radio access, " in Proc. IEEE 77th Veh. Technol. Conf., Dresden, Germany, June. 2013, pp. 1-5.
8. J. Liberti, S. Moshavi, and P. Zablocky, "Successive interference cancellation, " U. S. Patent 8 670 418 B2, Mar. 11, 2014.
9. D. Tse and P. Viswanath, Fundamentals of Wireless Communication. Cambridge, U. K.: Cambridge Univ. Press, 2005.
10. Y. Saito, A. Benjebbour, Y. Kishiyama, and T. Nakamura, "System-level performance evaluation of downlink non-orthogonal multiple access (NOMA), " in Proc. IEEE Int. Symp. Pers., Indoor Mobile Radio Commun. (PIMRC), London, U. K., Sep. 2013, pp. 611-615.
11. A. Li, A. Harada, and H. Kayama, "A novel low computational complexity power assignment method for non-orthogonal multiple access systems, " IEICE Trans. Fundam. Electron. Commun. Comput. Sci., vol. E97-A, no. 1, pp. 57-68, Jan. 2014.
12. Z. Ding, Z. Yang, P. Fan, and H. V. Poor, "On the performance of non-orthogonal multiple access in 5G systems with randomly deployed users, " IEEE Signal Process. Lett., vol. 21, no. 12, pp. 1501-1505, Dec. 2014.
13. T. Takeda and K. Higuchi, "Enhanced user fairness using non-orthogonal access with sic in cellular uplink, " in Proc. IEEE Veh. Technol. Conf., San Francisco, CA, USA, Sep. 2011, pp. 1-5.
14. A. Roth and M. Sotomayor, Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis. Cambridge U. K.: Cambridge, Univ. Press, 1992.
15. E. Bodine-Baron, C. Lee, A. Chong, B. Hassibi, and A. Wierman, "Peer effects and stability in matching markets, " in Proc. 4th Symp. Algorithmic Game Theory (SAGT), Amalfi, Italy, Oct. 2011, pp. 117-129.
16. S. Bayat, R. H. Y. Louie, Z. Han, B. Vucetic, and Y. Li, "Distributed user association and femtocell allocation in heterogeneous wireless networks, " IEEE Trans. Commun., vol. 62, no. 8, pp. 3027-3043, Aug. 2014.
17. B. Di, S. Bayat, L. Song, and Y. Li, "Radio resource allocation for fullduplex OFDMA networks using matching theory, " in Proc. IEEE Int. Conf. Comput. Commun. Workshops (InfoCom), Toronto, ON, Canada, May 2014, pp. 197-198.
18. O. Semiari, W. Saad, S. Valentin, M. Bennis, and B. Maham, "Matching theory for priority-based cell association in the downlink of wireless small cell networks, " in Proc. IEEE Int. Conf. Acoust. Speech, Signal Process., Florence, Italy, May 2014, pp. 444-448.
19. A. Benjebbour, A. Li, Y. Saito, Y. Kishiyama, A. Harada, and T. Nakamura, "System-level performance of downlink noma for future lte enhancements, " in Proc. IEEE Globecom Workshops (GC Wkshps), Alanta, GA, USA, Dec. 2013, pp. 66-70.
20. P. Bergmans, "A simple converse for broadcast channels with additive white gaussian noise (Corresp. ), " IEEE Trans. Inf. Theory, vol. 20, no. 2, pp. 279-280, Mar. 1974.
21. W. Yu and J. M. Cioffi, "Sum capacity of Gaussian vector broadcast channels, " IEEE Trans. Inf. Theory, vol. 50, no. 9, pp. 1875-1892, Sep. 2004.
22. F. Kelly, "Charging and rate control for elastic traffic, " Eur. Trans. Telecommun., vol. 8, no. 1, pp. 33-37, Jan. 1997.
23. J. Yang, Z. Yifan, W. Ying, and Z. Ping, "Average rate updating mechanism in proportional fair scheduler for HDR, " in Proc. IEEE Global Telecommun. Conf., vol. 6. Dallas, TX, USA, Dec. 2004, pp. 3464-3466.
24. L. A. Wolsey and G. L. Nemhauser, Integer and Combinatorial Optimization. Hoboken, NJ, USA: Wiley, 2014.
25. Z.-Q. Luo and S. Zhang, "Dynamic spectrum management: Complexity and duality, " IEEE J. Sel. Topics Signal Process., vol. 2, no. 1, pp. 57-73, Feb. 2008.
26. S. Boyd, S.-J. Kim, L. Vandenberghe, and A. Hassibi, "A tutorial on geometric programming, " Optim. Eng., vol. 8, no. 1, pp. 67-127, 2007.
27. S. Kim, "Cross-layer resource allocation for multi-user communication systems, " Ph. D. dissertation, Dept. Elect. Eng., Stanford Univ. Press, Palo Alto, CA, USA, 2008.
28. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge, U. K.: Cambridge Univ. Press, 2004.
29. F. Echenique and J. Oviedo, "Core many-to-one matchings by fixed point methods, " J. Econnomic Theory, vol. 115, no. 2, pp. 358-376, Apr. 2004.
30. K. Cechlárová, "On the complexity of exchange-stable roommates, " Discrete Appl. Math., vol. 116, no. 3, pp. 279-287, Feb. 2002.
31. F. Pantisano, M. Bennis, W. Saad, S. Valentin, and M. Debbah, "Matching with externalities for context-aware user-cell association in small cell networks, " in Proc. IEEE Globecom Workshops (GC Wkshps), Atlanta, GA, USA, Dec. 2013, pp. 4483-4488.
32. L. Davis, Genetic Algorithms and Simulated Annealing. San Mateo, CA, USA: Morgan Kaufman, 1987.
33. O. Häggström, Finite Markov Chains and Algorithmic Applications. Cambridge U. K.: Cambridge, Univ. Press, 2001.
34. G. Song and Y. Li, "Adaptive subcarrier and power allocation in ofdm based on maximizing utility, " in Proc. IEEE Semiannu. Veh. Technol. Conf. (VTC Spring), vol. 2. Apr. 2003, pp. 905-909.
35. Spatial Channel Model for Multiple Input Multiple Output (MIMO) simulations, Release 12, document 3GPP TR 25. 996, Sep. 2014.
36. Evolved Universal Terrestrial Radio Access (E-UTRA) Physical Layer Procedures Release 12, document 3GPP TS 36. 213, Sep. 2014.
37. R. Jain, D. Chiu, and W. Hawe, "A quantitative measure of fairness and discrimination for resource allocation in shared computer systems, " Eastern Res. Lab, Digit. Equip. Corp. (DEC), Hudson, MA, USA, Tech. Rep. TR-301, Sept. 1984.
38. Y.-F. Liu and Y.-H. Dai, "On the complexity of joint subcarrier and power allocation for multi-user OFDMA systems, " IEEE Trans. Signal Process., vol. 62, no. 3, pp. 583-596, Feb. 2014.
39. R. M. Karp, "Reducibility among combinatorial problems, " in Complexity Computer Computations. New York, NY, USA: Springer, 1972, pp. 85-103.
40. V. Kann, "Maximum bounded 3-dimensional matching is MAX SNPcomplete, " Info. Process. Lett., vol. 37, no. 1, pp. 27-35, Jan. 1991.
41. M. Sipser, Introduction to the Theory of Computation. Boston, MA, USA: Cengage Learning, 2012.
42. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi, "Complexity and approximation, " in Combinatorial Optimization Problems and Their Approximability Properties. New York, NY, USA: Springer, 2003.