Advertisement

A NOMA-Enhanced Reconfigurable Access Scheme with Device Pairing for MTC

  • Tho Le-Ngoc
  • Atoosa Dalili Shoaei
Chapter
  • 10 Downloads
Part of the Wireless Networks book series (WN)

Abstract

In this chapter, we present a multiple access scheme for machine-type communications for which high spectral efficiency and massive connectivity are demanded. To meet these requirements, we enhance the proposed access scheme with the reconfigurability feature to properly divide each time frame to three segments of grant-based NOMA, grant-based OMA, and random access. To obtain the length of each segment, an optimization problem is formulated which is solved by dividing it into two sub-problems. The first sub-problem nominates devices for the NOMA transmissions, while the second sub-problem derives the length of each segment as well as the parameter of the random access-based scheme. The results show that the proposed scheme outperforms the reconfigurable scheme which does not support NOMA.

References

  1. 1.
    A. Dalili Shoaei, M. Derakhshani, T. Le-Ngoc, A NOMA-enhanced reconfigurable access scheme with device pairing for M2M networks. IEEE Access 7, 32266–32275 (2019)CrossRefGoogle Scholar
  2. 2.
    A. Dalili Shoaei, M. Derakhshani, T. Le-Ngoc, A reconfigurable NOMA scheme for machine-to-machine networks, in IEEE International Conference on Communication (ICC), Shanghai (2019)Google Scholar
  3. 3.
    Z. Wu, K. Lu, C. Jiang, X. Shao, Comprehensive study and comparison on 5G NOMA schemes. IEEE Access 6, 18511–18519 (2018)CrossRefGoogle Scholar
  4. 4.
    S. Lim, K. Ko, Non-orthogonal multiple access (NOMA) to enhance capacity in 5G. Int. J. Contents 11(4), 38–43 (2015)CrossRefGoogle Scholar
  5. 5.
    J. Edmonds, Paths, trees, and flowers. Can. J. Math. 17(3), 449–467 (1965)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    H.N. Gabow, Data structures for weighted matching and nearest common ancestors with linking, in ACM-SIAM Symposium on Discrete Algorithms, San Francisco (1990)Google Scholar
  7. 7.
    M. Wattenhofer, R. Wattenhofer, Fast and simple algorithms for weighted perfect matching. Electron. Notes Discrete Math. 17, 285–291 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    D. Avis, A survey of heuristics for the weighted matching problem. Networks 13(4), 475–493 (1983)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  • Tho Le-Ngoc
    • 1
  • Atoosa Dalili Shoaei
    • 1
  1. 1.Electrical and Computer EngineeringMcGill UniversityMontrealCanada

Personalised recommendations