{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,22]],"date-time":"2026-09-22T17:36:02Z","timestamp":1790098562168,"version":"4.0.1"},"reference-count":19,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T00:00:00Z","timestamp":1580860800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["715111"],"award-info":[{"award-number":["715111"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010661","name":"Horizon 2020","doi-asserted-by":"publisher","award":["694630"],"award-info":[{"award-number":["694630"]}],"id":[{"id":"10.13039\/100010661","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>This paper analyzes the multiplexing gains (MG) achievable over Wyner\u2019s soft-handoff model under mixed-delay constraints, that is, when delay-sensitive and delay-tolerant data are simultaneously transmitted over the network. In the considered model, delay-sensitive data cannot participate or profit in any ways from transmitter or receiver cooperation, but delay-tolerant data can. Cooperation for delay-tolerant data takes place over rate-limited links and is limited to a fixed number of cooperation rounds. For the described setup, inner and outer bounds are derived on the set of MG pairs that are simultaneously achievable for delay-sensitive and delay-tolerant data. The bounds are tight in special cases and allow us to obtain the following conclusions. For large cooperation rates, and when both transmitters and receivers can cooperate, it is possible to simultaneously attain maximum MG for delay-sensitive messages and maximum sum MG for all messages. For comparison, in scheduling schemes (also called time-sharing schemes), the largest achievable sum MG decreases linearly with the MG of delay-sensitive messages. A similar linear decrease is proved for any coding scheme, not only for scheduling schemes, if only transmitters or only receivers can cooperate (but not both) and if delay-sensitive messages have moderate MG. In contrast, if the MG of delay-sensitive messages is small, the maximum sum MG can be achieved even with only transmitter or only receiver cooperation. To summarise, when cooperation rates are high and both transmitters and receivers can cooperate or when delay-sensitive messages have small MG, then transmitting delay-sensitive messages causes no penalty on the sum-MG. In other regimes, this penalty increases proportionally to the delay-tolerant MG in the sense that increasing the delay-sensitive MG by    \u0394    penalises the largest achievable delay-tolerant MG by     2 \u0394     and thus the sum MG by    \u0394   .<\/jats:p>","DOI":"10.3390\/e22020182","type":"journal-article","created":{"date-parts":[[2020,2,6]],"date-time":"2020-02-06T02:59:18Z","timestamp":1580957958000},"page":"182","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Multiplexing Gains under Mixed-Delay Constraints on Wyner\u2019s Soft-Handoff Model"],"prefix":"10.3390","volume":"22","author":[{"given":"Homa","family":"Nikbakht","sequence":"first","affiliation":[{"name":"Laboratoire Traitement et Communication de l\u2019Information (LTCI), Telecom Paris, Institut polytechnique de Paris, 91120 Palaiseau, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mich\u00e8le Angela","family":"Wigger","sequence":"additional","affiliation":[{"name":"Laboratoire Traitement et Communication de l\u2019Information (LTCI), Telecom Paris, Institut polytechnique de Paris, 91120 Palaiseau, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shlomo","family":"Shamai (Shitz)","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, Technion\u2013Israel Institute of Technology, Haifa 32000, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2020,2,5]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Cohen, K.M., Steiner, A., and Shamai (Shitz), S. (2012, January 1\u20136). The broadcast approach under mixed delay constraints. Proceedings of the 2012 IEEE International Symposium on Information Theory Proceedings, Cambridge, MA, USA.","DOI":"10.1109\/ISIT.2012.6283732"},{"key":"ref_2","unstructured":"Zhang, R., Cioffic, J., and Liang, Y.-C. (2005, January 16\u201320). MIMO broadcasting with delay-constrained and no-delay-constrained services. Proceedings of the IEEE International Conference on Communications, Seoul, Korea."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1109\/JSTSP.2008.922470","article-title":"Optimal dynamic resource allocation for multi-antenna broadcasting with heterogeneous delay-constrained traffic","volume":"2","author":"Zhang","year":"2008","journal-title":"IEEE J. Sel. Top. Signal Process."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Kassab, R., Simeone, O., and Popovski, P. (2018). Coexistence of URLLC and eMBB services in the C-RAN uplink: An information-theoretic study. arXiv.","DOI":"10.1109\/GLOCOM.2018.8647460"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Nikbakht, H., Wigger, M., Hachem, W., and Shamai (Shitz), S. (2019, January 25\u201328). Mixed delay constraints on a fading C-RAN uplink. Proceedings of the ITW 2019: IEEE Information Theory Workshop, Visby, Sweden.","DOI":"10.1109\/ITW44776.2019.8989156"},{"key":"ref_6","first-page":"5886","article-title":"Channels with cooperation links that may be absent","volume":"63","author":"Huleihel","year":"2017","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Itzhak, D., and Steinberg, Y. (2017). The broadcast channel with degraded message sets and unreliable conference. arXiv.","DOI":"10.1109\/ISIT.2017.8006687"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1713","DOI":"10.1109\/18.340450","article-title":"Shannon-theoretic approach to a Gaussian cellular multiple-access channel","volume":"40","author":"Wyner","year":"1994","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02136153","article-title":"Information-theoretic capacity of multi-receiver networks","volume":"1","author":"Hanly","year":"1993","journal-title":"Telecommun. Syst."},{"key":"ref_10","unstructured":"Singhal, M., Seyfi, T., and Gamal, A.E. (2018). Joint Uplink-Downlink Cooperative Interference Management with Flexible Cell Associations. arXiv."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"6342","DOI":"10.1109\/TIT.2014.2345070","article-title":"Cognitive Wyner networks with clustered decoding","volume":"60","author":"Lapidoth","year":"2014","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"1199","DOI":"10.1109\/TIT.2016.2633253","article-title":"Conferencing in Wyner\u2019s asymmetric interference network: Effect of number of rounds","volume":"63","author":"Wigger","year":"2016","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"4967","DOI":"10.1109\/TIT.2009.2030472","article-title":"Clustered local decoding for Wyner-type cellular models","volume":"55","author":"Levy","year":"2009","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Lapidoth, A., Shamai (Shitz), S., and Wigger, M.A. (2007, January 2\u20136). On cognitive interference networks. Proceedings of the 2007 IEEE Information Theory Workshop, Tahoe City, CA, USA.","DOI":"10.1109\/ITW.2007.4313095"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"5287","DOI":"10.1109\/TWC.2015.2435745","article-title":"Base station cooperation for confidential broadcasting in multi-cell networks","volume":"14","author":"He","year":"2015","journal-title":"IEEE Trans. Wirel. Commun."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"5740","DOI":"10.1109\/TIT.2012.2198614","article-title":"Degrees of freedom of interference channels with CoMP transmission and reception","volume":"58","author":"Annapureddy","year":"2012","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Shamai (Shitz), S., and Wigger, M. (August, January 31). Rate-limited transmitter-cooperation in Wyner\u2019s asymmetric interference network. Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, St. Petersburg, Russia.","DOI":"10.1109\/ISIT.2011.6034161"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Nikbakht, H., Wigger, M., and Shamai (Shitz), S. (2019, January 2\u20135). Multiplexing gain region of sectorized cellular networks with mixed delay constraints. Proceedings of the 2019 IEEE 20th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC), Cannes, France.","DOI":"10.1109\/SPAWC.2019.8815417"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Wang, J., Yuan, B., Huang, L., and Jafar, S.A. (2019). GDoF of Interference Channel with Limited Cooperation under Finite Precision CSIT. arXiv.","DOI":"10.1109\/GLOBECOM38437.2019.9013882"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/22\/2\/182\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T08:54:58Z","timestamp":1760172898000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/22\/2\/182"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,5]]},"references-count":19,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2020,2]]}},"alternative-id":["e22020182"],"URL":"https:\/\/doi.org\/10.3390\/e22020182","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,5]]}}}