| 1. |
- Arvanitaki, Antonia, et al.
(författare)
-
Delay Performance of a Two-User Broadcast Channel with Security Constraints
- 2018
-
Ingår i: 2018 GLOBAL INFORMATION INFRASTRUCTURE AND NETWORKING SYMPOSIUM (GIIS). - : IEEE. - 9781538672723
-
Konferensbidrag (refereegranskat)abstract
- In this paper we consider the two-user broadcast channel with security constraints. We assume that one of the receivers has a secrecy constraint; i.e., its packets need to be kept secret from the other receiver. The receiver with secrecy constraint has full-duplex capability to transmit a jamming signal to increase its secrecy. We derive the average delay per packet and provide simulation and numerical results, where we compare different performance metrics for the cases when the legitimate receiver performs successive decoding and when both receivers treat interference as noise.
|
|
| 2. |
- Arvanitaki, Antonia, 1991-, et al.
(författare)
-
Delay Performance of a Two-User Broadcast Channel with Security Constraints
- 2020
-
Ingår i: SN Computer Science. - : Springer. - 2661-8907 .- 2662-995X. ; 1:1
-
Tidskriftsartikel (refereegranskat)abstract
- 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.
|
|
| 3. |
- Arvanitaki, Antonia, et al.
(författare)
-
Modeling of a UAV-based Data Collection System
- 2017
-
Ingår i: 2017 IEEE 22ND INTERNATIONAL WORKSHOP ON COMPUTER AIDED MODELING AND DESIGN OF COMMUNICATION LINKS AND NETWORKS (CAMAD). - : IEEE. - 9781509063024
-
Konferensbidrag (refereegranskat)abstract
- Unmanned Aerial Vehicles (UAVs) have been extensively studied the past years for various applications. In this work, we propose a Markov chain to model the movement of a single FAY deployed for data collection from remote sensors. Furthermore, we introduce a second Markov chain to model the irregularities of the UAVs movement when it is in transit. We investigate the impact of the distance of the FAV from the sensor on the success probability of information transmission. We provide numerical evaluation of the theoretical results.
|
|
| 4. |
- Arvanitaki, Antonia, et al.
(författare)
-
Performance analysis of congestion-aware secure broadcast channels
- 2021
-
Ingår i: EURASIP Journal on Wireless Communications and Networking. - : Springer. - 1687-1472 .- 1687-1499. ; 2021:1
-
Tidskriftsartikel (refereegranskat)abstract
- Congestion-aware scheduling in case of downlink cellular communication has ignored the distribution of diverse content to different clients with heterogeneous secrecy requirements. Other possible application areas that encounter the preceding issue are secure offloading in mobile-edge computing, and vehicular communication. In this paper, we extend the work in Arvanitaki et al. (SN Comput Sci 1(1):53, 2019) by taking into consideration congestion and random access. Specifically, we study a two-user congestion-aware broadcast channel with heterogeneous traffic and different security requirements. 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 congestion-agnostic. 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 congestion-aware policy provides better delay, throughput, and secrecy performance for large arrival packet probabilities at the queue holding the confidential information. 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. Finally, for two decoding schemes, we formulate our problems in terms of multi-objective optimization, which allows for finding a trade-off between the average packet delay for packets intended for the legitimate user and the throughput for the other user under congestion-aware policy.
|
|
| 5. |
- Arvanitaki, Antonia, 1991-, et al.
(författare)
-
Secrecy in Congestion-Aware Broadcast Channels
- 2021
-
Ingår i: Proc. Wireless Days Conference (WD) 2021. - : Institute of Electrical and Electronics Engineers (IEEE). - 9781665425599 - 9781665425605
-
Konferensbidrag (refereegranskat)abstract
- 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.
|
|
