Sökning: WFRF:(Carlsson Niklas 1977 )
> (2020-2024) >
Secrecy in Congesti...
-
Arvanitaki, Antonia,1991-Linköpings universitet,Programvara och system,Tekniska fakulteten
(författare)
Secrecy in Congestion-Aware Broadcast Channels
- Artikel/kapitelEngelska2021
Förlag, utgivningsår, omfång ...
-
Institute of Electrical and Electronics Engineers (IEEE),2021
-
printrdacarrier
Nummerbeteckningar
-
LIBRIS-ID:oai:DiVA.org:liu-180862
-
https://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-180862URI
-
https://doi.org/10.1109/WD52248.2021.9508287DOI
Kompletterande språkuppgifter
-
Språk:engelska
-
Sammanfattning på:engelska
Ingår i deldatabas
Klassifikation
-
Ämneskategori:ref swepub-contenttype
-
Ämneskategori:kon swepub-publicationtype
Anmärkningar
-
Funding Agencies|Swedish Research Council (VR)Swedish Research Council; CENIIT; Indo-Sweden Project, Department of Science and Technology, India
-
Congestion-aware scheduling in the case of traditional downlink cellular communication has neglected the heterogeneity in terms of secrecy among different clients. In this paper, we study a two-user congestion-aware broadcast channel with heterogeneous traffic and different security requirements. The traffic with security requirements is intended for a legitimate user and it has bursty nature. The incoming packets are stored in a queue at the source. Furthermore, there is a second traffic flow intended for another user, it is delay tolerant and does not have secrecy constraints. The receiver which needs to be served with confidential data has full-duplex capabilities, and it can send a jamming signal to hinder eavesdropping of its data at the other user. We consider two randomized policies for selecting which packets to transmit, one is congestion-aware by taking into consideration the queue size, whereas the other one is non-congestion-aware. We analyse the throughput and the delay performance under two decoding schemes at the receivers and provide insights into their relative security performance and into how congestion control at the queue holding confidential information can help decrease the average delay per packet. We show that the two policies have the same secrecy performance for large random access probabilities. The derived results also take account of the self-interference caused at the receiver for whom confidential data is intended due to its full-duplex operation while jamming the communication at the other user.
Ämnesord och genrebeteckningar
Biuppslag (personer, institutioner, konferenser, titlar ...)
-
Pappas, Nikolaos,1982-Linköpings universitet,Kommunikations- och transportsystem,Tekniska fakulteten(Swepub:liu)nikpa02
(författare)
-
Carlsson, Niklas,1977-Linköpings universitet,Databas och informationsteknik,Tekniska fakulteten(Swepub:liu)nikca89
(författare)
-
Mohapatra, ParthajitIndian Institute of Technology, Tirupati, India
(författare)
-
Linköpings universitetProgramvara och system
(creator_code:org_t)
Sammanhörande titlar
-
Ingår i:Proc. Wireless Days Conference (WD) 2021: Institute of Electrical and Electronics Engineers (IEEE)97816654255999781665425605
Internetlänk
Hitta via bibliotek
Till lärosätets databas