{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T23:45:55Z","timestamp":1740181555779,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,12,21]],"date-time":"2019-12-21T00:00:00Z","timestamp":1576886400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,12,21]],"date-time":"2019-12-21T00:00:00Z","timestamp":1576886400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN COMPUT. SCI."],"published-print":{"date-parts":[[2020,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this paper, we consider the two-user broadcast channel with security constraints. We assume that a source broadcasts packets to two receivers, and that one of them has secrecy constraints, i.e., its packets need to be kept secret from the other receiver. The receiver with secrecy constraint has full-duplex capability, allowing it to transmit a jamming signal to increase its secrecy. We derive the average delay per packet and provide simulations and numerical results, where we compare different performance metrics for the cases when both receivers treat interference as noise, when the legitimate receiver performs successive decoding, and when the eavesdropper performs successive decoding. The results show that successive decoding provides better average packet delay for the legitimate user. Furthermore, we define a new metric that characterizes the reduction on the success probability for the legitimate user that is caused by the secrecy constraint. The results show that secrecy poses a significant amount of packet delay for the legitimate receiver when either receiver performs successive decoding. We also formulate an optimization problem, wherein the throughput of the eavesdropper is maximized under delay and secrecy rate constraints at the legitimate receiver. We provide numerical results for the optimization problem, where we show the trade-off between the transmission power for the jamming and the throughput of the non-legitimate receiver. The results provide insights into how channel ordering and encoding differences can be exploited to improve performance under different interference conditions.<\/jats:p>","DOI":"10.1007\/s42979-019-0055-3","type":"journal-article","created":{"date-parts":[[2019,12,21]],"date-time":"2019-12-21T08:03:22Z","timestamp":1576915402000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Delay Performance of a Two-User Broadcast Channel with Security Constraints"],"prefix":"10.1007","volume":"1","author":[{"given":"Antonia","family":"Arvanitaki","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4416-7702","authenticated-orcid":false,"given":"Nikolaos","family":"Pappas","sequence":"additional","affiliation":[]},{"given":"Parthajit","family":"Mohapatra","sequence":"additional","affiliation":[]},{"given":"Niklas","family":"Carlsson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,12,21]]},"reference":[{"key":"55_CR1","doi-asserted-by":"crossref","unstructured":"Arvanitaki A, Pappas N, Mohapatra P, Carlsson N, Delay performance of a two-user broadcast channel with security constraints. In: Global Information Infrastructure and Networking Symposium (GIIS), Oct. 2018. p. 1\u20135.","DOI":"10.1109\/GIIS.2018.8635694"},{"issue":"5","key":"55_CR2","doi-asserted-by":"publisher","first-page":"918","DOI":"10.1109\/18.21216","volume":"34","author":"RR Rao","year":"1988","unstructured":"Rao RR, Ephremides A. On the stability of interacting queues in a multiple-access system. IEEE Trans Inf Theory. 1988;34(5):918\u201330.","journal-title":"IEEE Trans Inf Theory"},{"key":"55_CR3","doi-asserted-by":"crossref","unstructured":"Pappas N, Kountouris M, Ephremides A, The stability region of the two-user interference channel. In: IEEE Information Theory Workshop (ITW), Sep. 2013. p. 1\u20135.","DOI":"10.1109\/ITW.2013.6691293"},{"issue":"10","key":"55_CR4","first-page":"4611","volume":"66","author":"N Pappas","year":"2018","unstructured":"Pappas N, Kountouris M, Ephremides A, Angelakis V. Stable throughput region of the two-user broadcast channel. IEEE Trans Commun. 2018;66(10):4611\u201321.","journal-title":"IEEE Trans Commun"},{"issue":"9","key":"55_CR5","doi-asserted-by":"publisher","first-page":"2294","DOI":"10.1109\/TIFS.2018.2818076","volume":"13","author":"P Mohapatra","year":"2018","unstructured":"Mohapatra P, Pappas N, Lee J, Quek TQS, Angelakis V. Secure communications for the two-user broadcast channel with random traffic. IEEE Trans Inf Forensics Secur. 2018;13(9):2294\u2013309.","journal-title":"IEEE Trans Inf Forensics Secur"},{"issue":"5","key":"55_CR6","doi-asserted-by":"publisher","first-page":"3170","DOI":"10.1109\/TWC.2018.2808195","volume":"17","author":"I Dimitriou","year":"2018","unstructured":"Dimitriou I, Pappas N. Stable throughput and delay analysis of a random access network with queue-aware transmission. IEEE Trans Wirel Commun. 2018;17(5):3170\u201384.","journal-title":"IEEE Trans Wirel Commun"},{"issue":"3","key":"55_CR7","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1109\/TIT.1978.1055892","volume":"24","author":"I Csiszar","year":"1978","unstructured":"Csiszar I, Korner J. Broadcast channels with confidential messages. IEEE Trans Inf Theory. 1978;24(3):339\u201348.","journal-title":"IEEE Trans Inf Theory"},{"key":"55_CR8","doi-asserted-by":"crossref","unstructured":"Barros J, Rodrigues MRD, Secrecy capacity of wireless channels. In: ieee international symposium on information theory (ISIT), July 2006. p. 356\u2013360.","DOI":"10.1109\/ISIT.2006.261613"},{"issue":"1","key":"55_CR9","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1109\/TIT.2010.2090215","volume":"57","author":"E Ekrem","year":"2011","unstructured":"Ekrem E, Ulukus S. Secrecy in cooperative relay broadcast channels. IEEE Trans Inf Theory. 2011;57(1):137\u201355.","journal-title":"IEEE Trans Inf Theory"},{"issue":"3","key":"55_CR10","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1109\/TIT.1979.1056046","volume":"25","author":"K Marton","year":"1979","unstructured":"Marton K. A coding theorem for the discrete memoryless broadcast channel. IEEE Trans Inf Theory. 1979;25(3):306\u201311.","journal-title":"IEEE Trans Inf Theory"},{"issue":"3","key":"55_CR11","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1145\/322017.322019","volume":"24","author":"G Fayolle","year":"1977","unstructured":"Fayolle G, Gelenbe E, Labetoulle J. Stability and optimal control of the packet switching broadcast channel. J ACM. 1977;24(3):375\u201386.","journal-title":"J ACM"},{"key":"55_CR12","doi-asserted-by":"crossref","unstructured":"Jafarian A, Vishwanath S. The two-user Gaussian fading broadcast channel. In: IEEE international symposium on information theory, Jul. 2011. p. 2964\u20132968.","DOI":"10.1109\/ISIT.2011.6034121"},{"issue":"5","key":"55_CR13","doi-asserted-by":"publisher","first-page":"2655","DOI":"10.1109\/TWC.2015.2390234","volume":"14","author":"T Liu","year":"2015","unstructured":"Liu T, Mukherjee P, Ulukus S, Lin S, Hong YP. Secure degrees of freedom of mimo rayleigh block fading wiretap channels with no csi anywhere. IEEE Trans Wirel Commun. 2015;14(5):2655\u201369.","journal-title":"IEEE Trans Wirel Commun"},{"issue":"6","key":"55_CR14","doi-asserted-by":"publisher","first-page":"2453","DOI":"10.1109\/TIT.2008.921861","volume":"54","author":"A Khisti","year":"2008","unstructured":"Khisti A, Tchamkerten A, Wornell GW. Secure broadcasting over fading channels. IEEE Trans Inf Theory. 2008;54(6):2453\u201369.","journal-title":"IEEE Trans Inf Theory"},{"key":"55_CR15","doi-asserted-by":"crossref","unstructured":"Jiang K, Jing T, Li Z, Huo Y, Zhang F. Analysis of secrecy performance in fading multiple access wiretap channel with sic receiver. In: IEEE International Conference on Computer Communications (INFOCOM), May 2017. p. 1\u20139.","DOI":"10.1109\/INFOCOM.2017.8057121"},{"issue":"9","key":"55_CR16","doi-asserted-by":"publisher","first-page":"4005","DOI":"10.1109\/TIT.2008.928272","volume":"54","author":"L Lai","year":"2008","unstructured":"Lai L, Gamal HE. The relay-eavesdropper channel: cooperation for secrecy. IEEE Trans Inf Theory. 2008;54(9):4005\u201319.","journal-title":"IEEE Trans Inf Theory"},{"issue":"9","key":"55_CR17","doi-asserted-by":"publisher","first-page":"1889","DOI":"10.1109\/JSAC.2013.130920","volume":"31","author":"J Lee","year":"2013","unstructured":"Lee J, Conti A, Rabbachin A, Win MZ. Distributed network secrecy. IEEE J Sel Areas Commun. 2013;31(9):1889\u2013900.","journal-title":"IEEE J Sel Areas Commun"},{"issue":"8","key":"55_CR18","doi-asserted-by":"publisher","first-page":"2764","DOI":"10.1109\/TWC.2011.061511.102257","volume":"10","author":"X Zhou","year":"2011","unstructured":"Zhou X, Ganti RK, Andrews JG, Hjorungnes A. On the throughput cost of physical layer security in decentralized wireless networks. IEEE Trans Wirel Commun. 2011;10(8):2764\u201375.","journal-title":"IEEE Trans Wirel Commun"},{"key":"55_CR19","doi-asserted-by":"crossref","unstructured":"Vasudevan S, Goeckel D, Towsley DF. Security-capacity trade-off in large wireless networks using keyless secrecy. In: ACM international symposium on mobile ad hoc networking and computing (MobiHoc), 2010. p. 21\u201330.","DOI":"10.1145\/1860093.1860097"},{"key":"55_CR20","doi-asserted-by":"crossref","unstructured":"Pappas N, Ephremides A, Traganitis A. Relay-assisted multiple access with multi-packet reception capability and simultaneous transmission and reception. In: IEEE information theory workshop, Oct. 2011. p. 578\u2013582.","DOI":"10.1109\/ITW.2011.6089522"},{"issue":"11","key":"55_CR21","doi-asserted-by":"publisher","first-page":"4490","DOI":"10.1109\/TCOMM.2015.2465903","volume":"63","author":"Z Tong","year":"2015","unstructured":"Tong Z, Haenggi M. Throughput analysis for full-duplex wireless networks with imperfect self-interference cancellation. IEEE Trans Commun. 2015;63(11):4490\u2013500.","journal-title":"IEEE Trans Commun"},{"issue":"7","key":"55_CR22","doi-asserted-by":"publisher","first-page":"3544","DOI":"10.1109\/TWC.2015.2408319","volume":"14","author":"N Pappas","year":"2015","unstructured":"Pappas N, Kountouris M, Ephremides A, Traganitis A. Relay-assisted multiple access with full-duplex multi-packet reception. IEEE Trans Wirel Commun. 2015;14(7):3544\u201358.","journal-title":"IEEE Trans Wirel Commun"}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-019-0055-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s42979-019-0055-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-019-0055-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,20]],"date-time":"2020-12-20T00:35:19Z","timestamp":1608424519000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s42979-019-0055-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,21]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["55"],"URL":"https:\/\/doi.org\/10.1007\/s42979-019-0055-3","relation":{},"ISSN":["2662-995X","2661-8907"],"issn-type":[{"type":"print","value":"2662-995X"},{"type":"electronic","value":"2661-8907"}],"subject":[],"published":{"date-parts":[[2019,12,21]]},"assertion":[{"value":"22 July 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 December 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 December 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with Ethical Standards"}},{"value":"On behalf of all authors, the corresponding author states that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"53"}}