{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T08:12:12Z","timestamp":1769847132651,"version":"3.49.0"},"reference-count":35,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2022,4,12]],"date-time":"2022-04-12T00:00:00Z","timestamp":1649721600000},"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>This work considers a two-user multiple access channel in which both users have Age of Information (AoI)-oriented traffic with different characteristics. More specifically, the first user has external traffic and cannot control the generation of status updates, and the second user monitors a sensor and transmits status updates to the receiver according to a generate-at-will policy. The receiver is equipped with multiple antennas and the transmitters have single antennas; the channels are subject to Rayleigh fading and path loss. We analyze the average AoI of the first user for a discrete-time first-come-first-served (FCFS) queue, last-come-first-served (LCFS) queue, and queue with packet replacement. We derive the AoI distribution and the average AoI of the second user for a threshold policy. Then, we formulate an optimization problem to minimize the average AoI of the first user for the FCFS and LCFS with preemption queue discipline to maintain the average AoI of the second user below a given level. The constraints of the optimization problem are shown to be convex. It is also shown that the objective function of the problem for the first-come-first-served queue policy is non-convex, and a suboptimal technique is introduced to effectively solve the problem using the algorithms developed for solving a convex optimization problem. Numerical results illustrate the performance of the considered optimization algorithm versus the different parameters of the system. Finally, we discuss how the analytical results of this work can be extended to capture larger setups with more than two users.<\/jats:p>","DOI":"10.3390\/e24040542","type":"journal-article","created":{"date-parts":[[2022,4,12]],"date-time":"2022-04-12T21:15:35Z","timestamp":1649798135000},"page":"542","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["On the Age of Information in a Two-User Multiple Access Setup"],"prefix":"10.3390","volume":"24","author":[{"given":"Mehrdad","family":"Salimnejad","sequence":"first","affiliation":[{"name":"Department of Science and Technology, Link\u00f6ping University, SE-60174 Norrk\u00f6ping, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4416-7702","authenticated-orcid":false,"given":"Nikolaos","family":"Pappas","sequence":"additional","affiliation":[{"name":"Department of Science and Technology, Link\u00f6ping University, SE-60174 Norrk\u00f6ping, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2022,4,12]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1561\/1300000060","article-title":"Age of information: A new concept, metric, and tool","volume":"12","author":"Kosta","year":"2017","journal-title":"Found. Trends Netw."},{"key":"ref_2","first-page":"1","article-title":"Age of information: A new metric for information freshness","volume":"12","author":"Sun","year":"2019","journal-title":"Synth. Lect. Commun. Netw."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Kaul, S., Gruteser, M., Rai, V., and Kenney, J. (2011, January 27\u201330). Minimizing age of information in vehicular networks. Proceedings of the 2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, Salt Lake City, UT, USA.","DOI":"10.1109\/SAHCN.2011.5984917"},{"key":"ref_4","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 2012 IEEE INFOCOM, Orlando, FL, USA.","DOI":"10.1109\/INFCOM.2012.6195689"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Kaul, S.K., Yates, R.D., and Gruteser, M. (2012, January 21\u201323). Status updates through queues. Proceedings of the 2012 46th Annual Conference on Information Sciences and Systems (CISS), Princeton, NJ, USA.","DOI":"10.1109\/CISS.2012.6310931"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Najm, E., and Nasser, R. (2016, January 10\u201315). Age of information: The gamma awakening. Proceedings of the 2016 IEEE International Symposium on Information Theory (ISIT), Barcelona, Spain.","DOI":"10.1109\/ISIT.2016.7541764"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Bedewy, A.M., Sun, Y., and Shroff, N.B. (2016, January 10\u201315). Optimizing data freshness, throughput, and delay in multi-server information-update systems. Proceedings of the 2016 IEEE International Symposium on Information Theory (ISIT), Barcelona, Spain.","DOI":"10.1109\/ISIT.2016.7541763"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Yates, R.D. (2018, January 15\u201319). Age of information in a network of preemptive servers. Proceedings of the IEEE INFOCOM 2018\u2014IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), Honolulu, HI, USA.","DOI":"10.1109\/INFCOMW.2018.8406966"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Najm, E., and Telatar, E. (2018, January 15\u201319). Status updates in a multi-stream M\/G\/1\/1 preemptive queue. Proceedings of the IEEE Infocom 2018\u2014IEEE Conference On Computer Communications Workshops (Infocom Wkshps), Honolulu, HI, USA.","DOI":"10.1109\/INFCOMW.2018.8406928"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Chen, Z., Pappas, N., Bj\u00f6rnson, E., and Larsson, E.G. (May, January 29). Age of information in a multiple access channel with heterogeneous traffic and an energy harvesting node. Proceedings of the IEEE INFOCOM 2019\u2014IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), Paris, France.","DOI":"10.1109\/INFCOMW.2019.8845083"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Pappas, N., and Kountouris, M. (2019, January 2\u20135). Delay violation probability and age of information interplay in the two-user multiple access channel. Proceedings of the 2019 IEEE 20th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC), Cannes, France.","DOI":"10.1109\/SPAWC.2019.8815559"},{"key":"ref_12","unstructured":"Fountoulakis, E., Charalambous, T., Nomikos, N., Ephremides, A., and Pappas, N. (2020). Information Freshness and Packet Drop Rate Interplay in a Two-User Multi-Access Channel. arXiv."},{"key":"ref_13","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_14","doi-asserted-by":"crossref","first-page":"7468","DOI":"10.1109\/TCOMM.2019.2931538","article-title":"Joint status sampling and updating for minimizing age of information in the Internet of Things","volume":"67","author":"Zhou","year":"2019","journal-title":"IEEE Trans. Commun."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1109\/LWC.2019.2953628","article-title":"Worst case age of information in wireless sensor networks: A multi-access channel","volume":"9","author":"Moltafet","year":"2019","journal-title":"IEEE Wirel. Commun. Lett."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Kadota, I., Sinha, A., and Modiano, E. (2018, January 16\u201319). Optimizing age of information in wireless networks with throughput constraints. Proceedings of the IEEE INFOCOM 2018\u2014IEEE Conference on Computer Communications, Honolulu, HI, USA.","DOI":"10.1109\/INFOCOM.2018.8486307"},{"key":"ref_17","unstructured":"Talak, R., Karaman, S., and Modiano, E. (2018). Can determinacy minimize age of information?. arXiv."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1109\/TNET.2019.2946481","article-title":"Optimizing information freshness in wireless networks under general interference constraints","volume":"28","author":"Talak","year":"2019","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1109\/TGCN.2017.2778501","article-title":"Optimal status update for age of information minimization with an energy harvesting source","volume":"2","author":"Wu","year":"2017","journal-title":"IEEE Trans. Green Commun. Netw."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"1359","DOI":"10.1109\/TNET.2019.2918736","article-title":"Scheduling algorithms for optimizing age of information in wireless networks with throughput constraints","volume":"27","author":"Kadota","year":"2019","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Fountoulakis, E., Pappas, N., Codreanu, M., and Ephremides, A. (2020, January 6\u20139). Optimal sampling cost in wireless networks with age of information constraints. Proceedings of the IEEE INFOCOM 2020\u2014IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), Toronto, ON, Canada.","DOI":"10.1109\/INFOCOMWKSHPS50562.2020.9163054"},{"key":"ref_22","first-page":"1","article-title":"Stochastic network optimization with application to communication and queueing systems","volume":"3","author":"Neely","year":"2010","journal-title":"Synth. Lect. Commun. Netw."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Moltafet, M., Leinonen, M., Codreanu, M., and Pappas, N. (2019, January 3\u20136). Power minimization in wireless sensor networks with constrained AoI using stochastic optimization. Proceedings of the 2019 53rd Asilomar Conference on Signals, Systems, and Computers, Pacific Grove, CA, USA.","DOI":"10.1109\/IEEECONF44664.2019.9048692"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1109\/OJCOMS.2021.3062678","article-title":"Optimizing information freshness in a multiple access channel with heterogeneous devices","volume":"2","author":"Chen","year":"2021","journal-title":"IEEE Open J. Commun. Soc."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"5315","DOI":"10.1109\/JIOT.2020.2976690","article-title":"Optimal Policies for Status Update Generation in an IoT Device with Heterogeneous Traffic","volume":"7","author":"Stamatakis","year":"2020","journal-title":"IEEE Internet Things J."},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Chen, H., Wang, Q., Dong, Z., and Zhang, N. (2020, January 9\u201311). Multiuser scheduling for minimizing age of information in uplink MIMO systems. Proceedings of the 2020 IEEE\/CIC International Conference on Communications in China (ICCC), Chongqing, China.","DOI":"10.1109\/ICCC49849.2020.9238859"},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Zhu, Z., Yu, B., and Cai, Y. (2020, January 21\u201323). Status Update Performance in Uplink Massive MU-MIMO Short-packet Communication Systems. Proceedings of the 2020 International Conference on Wireless Communications and Signal Processing (WCSP), Nanjing, China.","DOI":"10.1109\/WCSP49889.2020.9299796"},{"key":"ref_28","unstructured":"Feng, S., and Yang, J. (2020). Precoding and Scheduling for AoI Minimization in MIMO Broadcast Channels. arXiv."},{"key":"ref_29","unstructured":"Tadele, B., Shyianov, V., Bellili, F., Mezghani, A., and Hossain, E. (2020). Age-limited capacity of Massive MIMO. arXiv."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"1429","DOI":"10.1109\/LWC.2021.3069257","article-title":"Age of Information in Grant-Free Random Access with Massive MIMO","volume":"10","author":"Yu","year":"2021","journal-title":"IEEE Wirel. Commun. Lett."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"1454","DOI":"10.1109\/25.875282","article-title":"Performance analysis of maximal ratio combining and comparison with optimum combining for mobile radio communications with cochannel interference","volume":"49","author":"Shah","year":"2000","journal-title":"IEEE Trans. Veh. Technol."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"1352","DOI":"10.1109\/JSAC.2021.3065045","article-title":"The Age of Information in a Discrete Time Queue: Stationary Distribution and Non-Linear Age Mean Analysis","volume":"39","author":"Kosta","year":"2021","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Boyd, S., Boyd, S.P., and Vandenberghe, L. (2004). Convex Optimization, Cambridge University Press.","DOI":"10.1017\/CBO9780511804441"},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/s10479-007-0176-2","article-title":"An overview of bilevel optimization","volume":"153","author":"Colson","year":"2007","journal-title":"Ann. Oper. Res."},{"key":"ref_35","unstructured":"Den Hertog, D. (2012). Interior Point Approach to Linear, Quadratic and Convex Programming: Algorithms and Complexity, Springer Science & Business Media."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/24\/4\/542\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T22:52:49Z","timestamp":1760136769000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/24\/4\/542"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,12]]},"references-count":35,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2022,4]]}},"alternative-id":["e24040542"],"URL":"https:\/\/doi.org\/10.3390\/e24040542","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4,12]]}}}