Sökning: onr:"swepub:oai:DiVA.org:liu-180862" > Secrecy in Congesti...
Fältnamn | Indikatorer | Metadata |
---|---|---|
000 | 03846naa a2200361 4500 | |
001 | oai:DiVA.org:liu-180862 | |
003 | SwePub | |
008 | 211106s2021 | |||||||||||000 ||eng| | |
024 | 7 | a https://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-1808622 URI |
024 | 7 | a https://doi.org/10.1109/WD52248.2021.95082872 DOI |
040 | a (SwePub)liu | |
041 | a engb eng | |
042 | 9 SwePub | |
072 | 7 | a ref2 swepub-contenttype |
072 | 7 | a kon2 swepub-publicationtype |
100 | 1 | a Arvanitaki, Antonia,d 1991-u Linköpings universitet,Programvara och system,Tekniska fakulteten4 aut0 (Swepub:liu)antar70 |
245 | 1 0 | a Secrecy in Congestion-Aware Broadcast Channels |
264 | 1 | b Institute of Electrical and Electronics Engineers (IEEE),c 2021 |
338 | a print2 rdacarrier | |
500 | a Funding Agencies|Swedish Research Council (VR)Swedish Research Council; CENIIT; Indo-Sweden Project, Department of Science and Technology, India | |
520 | a 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. | |
650 | 7 | a TEKNIK OCH TEKNOLOGIERx Elektroteknik och elektronikx Telekommunikation0 (SwePub)202042 hsv//swe |
650 | 7 | a ENGINEERING AND TECHNOLOGYx Electrical Engineering, Electronic Engineering, Information Engineeringx Telecommunications0 (SwePub)202042 hsv//eng |
650 | 7 | a TEKNIK OCH TEKNOLOGIERx Elektroteknik och elektronikx Kommunikationssystem0 (SwePub)202032 hsv//swe |
650 | 7 | a ENGINEERING AND TECHNOLOGYx Electrical Engineering, Electronic Engineering, Information Engineeringx Communication Systems0 (SwePub)202032 hsv//eng |
653 | a Broadcast channel; Delay; Queueing; Random access; Secrecy | |
700 | 1 | a Pappas, Nikolaos,d 1982-u Linköpings universitet,Kommunikations- och transportsystem,Tekniska fakulteten4 aut0 (Swepub:liu)nikpa02 |
700 | 1 | a Carlsson, Niklas,d 1977-u Linköpings universitet,Databas och informationsteknik,Tekniska fakulteten4 aut0 (Swepub:liu)nikca89 |
700 | 1 | a Mohapatra, Parthajitu Indian Institute of Technology, Tirupati, India4 aut |
710 | 2 | a Linköpings universitetb Programvara och system4 org |
773 | 0 | t Proc. Wireless Days Conference (WD) 2021d : Institute of Electrical and Electronics Engineers (IEEE)z 9781665425599z 9781665425605 |
856 | 4 8 | u https://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-180862 |
856 | 4 8 | u https://doi.org/10.1109/WD52248.2021.9508287 |
Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.
Kopiera och spara länken för att återkomma till aktuell vy