{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T02:35:53Z","timestamp":1772850953197,"version":"3.50.1"},"reference-count":35,"publisher":"MDPI AG","issue":"6","license":[{"start":{"date-parts":[[2021,5,28]],"date-time":"2021-05-28T00:00:00Z","timestamp":1622160000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>Wireless mobile networks from the fifth generation (5G) and beyond serve as platforms for flexible support of heterogeneous traffic types with diverse performance requirements. In particular, the broadband services aim for the traditional rate optimization, while the time-sensitive services aim for the optimization of latency and reliability, and some novel metrics such as Age of Information (AoI). In such settings, the key question is the one of spectrum slicing: how these services share the same chunk of available spectrum while meeting the heterogeneous requirements. In this work we investigated the two canonical frameworks for spectrum sharing, Orthogonal Multiple Access (OMA) and Non-Orthogonal Multiple Access (NOMA), in a simple, but insightful setup with a single time-slotted shared frequency channel, involving one broadband user, aiming to maximize throughput and using packet-level coding to protect its transmissions from noise and interference, and several intermittent users, aiming to either to improve their latency-reliability performance or to minimize their AoI. We analytically assessed the performances of Time Division Multiple Access (TDMA) and ALOHA-based schemes in both OMA and NOMA frameworks by deriving their Pareto regions and the corresponding optimal values of their parameters. Our results show that NOMA can outperform traditional OMA in latency-reliability oriented systems in most conditions, but OMA performs slightly better in age-oriented systems.<\/jats:p>","DOI":"10.3390\/e23060686","type":"journal-article","created":{"date-parts":[[2021,5,31]],"date-time":"2021-05-31T00:22:15Z","timestamp":1622420535000},"page":"686","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Spectrum Slicing for Multiple Access Channels with Heterogeneous Services"],"prefix":"10.3390","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7915-7275","authenticated-orcid":false,"given":"Federico","family":"Chiariotti","sequence":"first","affiliation":[{"name":"Department of Electronic Systems, Aalborg University, Fredrik Bajers Vej 7C, 9100 Aalborg, Denmark"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7116-397X","authenticated-orcid":false,"given":"Israel","family":"Leyva-Mayorga","sequence":"additional","affiliation":[{"name":"Department of Electronic Systems, Aalborg University, Fredrik Bajers Vej 7C, 9100 Aalborg, Denmark"}]},{"given":"\u010cedomir","family":"Stefanovi\u0107","sequence":"additional","affiliation":[{"name":"Department of Electronic Systems, Aalborg University, Fredrik Bajers Vej 7C, 9100 Aalborg, Denmark"}]},{"given":"Anders E.","family":"Kal\u00f8r","sequence":"additional","affiliation":[{"name":"Department of Electronic Systems, Aalborg University, Fredrik Bajers Vej 7C, 9100 Aalborg, Denmark"}]},{"given":"Petar","family":"Popovski","sequence":"additional","affiliation":[{"name":"Department of Electronic Systems, Aalborg University, Fredrik Bajers Vej 7C, 9100 Aalborg, Denmark"}]}],"member":"1968","published-online":{"date-parts":[[2021,5,28]]},"reference":[{"key":"ref_1","unstructured":"3GPP (2020). 5G: Study on Scenarios and Requirements for Next Generation Access Technologies, ETSI. TR 38.913 V16.0.0."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Kaul, S., Yates, R., and Gruteser, M. (2012, January 25\u201330). Real-time status: How often should one update?. Proceedings of the IEEE INFOCOM, Orlando, FL, USA.","DOI":"10.1109\/INFCOM.2012.6195689"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1109\/JSAC.2019.2898760","article-title":"Reliable Transmission of Short Packets Through Queues and Noisy Channels Under Latency and Peak-Age Violation Guarantees","volume":"37","author":"Devassy","year":"2019","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"7237","DOI":"10.1109\/TWC.2020.3009881","article-title":"Urgency of Information for Context-Aware Timely Status Updates in Remote Control Systems","volume":"19","author":"Zheng","year":"2020","journal-title":"IEEE Trans. Wirel. Commun."},{"key":"ref_5","unstructured":"Yates, R.D., Sun, Y., Brown III, D.R., Kaul, S.K., Modiano, E., and Ulukus, S. (2020). Age of Information: An Introduction and Survey. arXiv."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Leyva-Mayorga, I., Chiariotti, F., Stefanovi\u0107, \u010c., Kal\u00f8r, A.E., and Popovski, P. (2021). Slicing a single wireless collision channel among throughput- and timeliness-sensitive services. arXiv.","DOI":"10.1109\/ICC42927.2021.9500253"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Chiariotti, F., Leyva-Mayorga, I., Stefanovi\u0107, \u010c., Kal\u00f8r, A.E., and Popovski, P. (2021). RAN Slicing Performance Trade-offs: Timing versus Throughput Requirements. arXiv.","DOI":"10.1109\/OJCOMS.2022.3164733"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1109\/MCOM.2017.1600920","article-title":"Network slicing to enable scalability and flexibility in 5G mobile networks","volume":"55","author":"Rost","year":"2017","journal-title":"IEEE Commun. Mag."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1109\/TNSM.2016.2597295","article-title":"Resource Slicing in Virtual Wireless Networks: A Survey","volume":"13","author":"Richart","year":"2016","journal-title":"IEEE Trans. Netw. Serv. Manag."},{"key":"ref_10","unstructured":"Maatouk, A., Assaad, M., and Ephremides, A. (May, January 29). Minimizing The Age of Information: NOMA or OMA?. Proceedings of the IEEE INFOCOM Workshops, Paris, France."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1109\/MCOM.2015.7263349","article-title":"Non-orthogonal multiple access for 5G: Solutions, challenges, opportunities, and future research trends","volume":"53","author":"Dai","year":"2015","journal-title":"IEEE Commun. Mag."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"18511","DOI":"10.1109\/ACCESS.2018.2817221","article-title":"Comprehensive Study and Comparison on 5G NOMA Schemes","volume":"6","author":"Wu","year":"2018","journal-title":"IEEE Access"},{"key":"ref_13","unstructured":"3GPP (2020). NR and NG-RAN Overall Description; Stage-2, ETSI. TS 38.300 V16.2.0."},{"key":"ref_14","unstructured":"3GPP (2021, May 27). Release 15 Description. Available online: https:\/\/www.3gpp.org\/release-15."},{"key":"ref_15","unstructured":"(2021, May 27). Release 16 Description. Available online: https:\/\/www.3gpp.org\/release-16."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"2347","DOI":"10.1109\/JPROC.2017.2768666","article-title":"Nonorthogonal Multiple Access for 5G and Beyond","volume":"105","author":"Liu","year":"2017","journal-title":"Proc. IEEE"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"55765","DOI":"10.1109\/ACCESS.2018.2872781","article-title":"5G Wireless Network Slicing for eMBB, URLLC, and mMTC: A Communication-Theoretic View","volume":"6","author":"Popovski","year":"2018","journal-title":"IEEE Access"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"13035","DOI":"10.1109\/ACCESS.2019.2893128","article-title":"Non-Orthogonal Multiplexing of Ultra-Reliable and Broadband Services in Fog-Radio Architectures","volume":"7","author":"Kassab","year":"2019","journal-title":"IEEE Access"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Okegbile, S.D., and Maharaj, B.T. (2021). Age of Information and Success Probability Analysis in Hybrid Spectrum Access-Based Massive Cognitive Radio Networks. Appl. Sci., 11.","DOI":"10.3390\/app11041940"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Hwang, D., Yang, J., Nam, S.S., and Song, H.K. (2021). Optimal Multi-Antenna Transmission for the Cooperative Non-Orthogonal Multiple-Access System. Appl. Sci., 11.","DOI":"10.3390\/app11052203"},{"key":"ref_21","unstructured":"3GPP (2021). 5G; NR; Medium Access Control (MAC) Protocol Specification, ETSI. TS38 321 V16.3.0."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Leyva-Mayorga, I., Stefanovic, C., Popovski, P., Pla, V., and Martinez-Bauset, J. (2019). Random Access for Machine-Type Communications. Wiley 5G Ref, Wiley.","DOI":"10.1002\/9781119471509.w5GRef031"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Mahmood, N.H., Abreu, R., B\u00f6hnke, R., Schubert, M., Berardinelli, G., and Jacobsen, T.H. (2019, January 27\u201330). Uplink grant-free access solutions for URLLC services in 5G New Radio. Proceedings of the 16th International Symposium on Wireless Communication Systems (ISWCS), Oulu, Finland.","DOI":"10.1109\/ISWCS.2019.8877253"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1109\/JSAC.2020.3018822","article-title":"Analyzing Grant-Free Access for URLLC Service","volume":"39","author":"Liu","year":"2021","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"1322","DOI":"10.1109\/TCOMM.2017.2771478","article-title":"Ultra-reliable low latency communication using interface diversity","volume":"66","author":"Nielsen","year":"2018","journal-title":"IEEE Trans. Commun."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1109\/JCN.2019.000039","article-title":"Age of information performance of multiaccess strategies with packet management","volume":"21","author":"Kosta","year":"2019","journal-title":"J. Commun. Netw."},{"key":"ref_27","unstructured":"3GPP (2020). Service Requirements for Cyber-Physical Control Applications in Vertical Domains, ETSI. TS 22.104 V16.5.0."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"5712","DOI":"10.1109\/TIT.2020.2998100","article-title":"The Age of Information in Networks: Moments, Distributions, and Sampling","volume":"66","author":"Yates","year":"2020","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_29","unstructured":"Champati, J.P., Al-Zubaidy, H., and Gross, J. (2019). Statistical Guarantee Optimization for AoI in Single-Hop and Two-Hop Systems with Periodic Arrivals. arXiv."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"818","DOI":"10.1109\/TNET.2020.2971350","article-title":"On the Age of Information in a CSMA Environment","volume":"28","author":"Maatouk","year":"2020","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Yates, R.D., and Kaul, S.K. (2020). Age of Information in Uncoordinated Unslotted Updating. arXiv.","DOI":"10.1109\/ISIT44484.2020.9174098"},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Chen, X., Gatsis, K., Hassani, H., and Bidokhti, S.S. (2020, January 21\u201326). Age of information in random access channels. Proceedings of the International Symposium on Information Theory (ISIT), Los Angeles, CA, USA.","DOI":"10.1109\/ISIT44484.2020.9174254"},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Yates, R.D., and Kaul, S.K. (2017, January 25\u201330). Status updates over unreliable multiaccess channels. Proceedings of the IEEE International Symposium on Information Theory-Proceedings, Aachen, Germany.","DOI":"10.1109\/ISIT.2017.8006544"},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Yates, R.D., Zhong, J., and Zhang, W. (2019, January 7\u201312). Updates with Multiple Service Classes. Proceedings of the IEEE International Symposium on Information Theory (ISIT), Paris, France.","DOI":"10.1109\/ISIT.2019.8849529"},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"4817","DOI":"10.1109\/TCOMM.2017.2734649","article-title":"Coded slotted ALOHA for erasure channels: Design and throughput analysis","volume":"65","author":"Sun","year":"2017","journal-title":"IEEE Trans. Commun."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/23\/6\/686\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T06:10:09Z","timestamp":1760163009000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/23\/6\/686"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,28]]},"references-count":35,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2021,6]]}},"alternative-id":["e23060686"],"URL":"https:\/\/doi.org\/10.3390\/e23060686","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5,28]]}}}