Secure Communications for the Two-User Broadcast Channel With Random Traffic

Abstract

In this work, we study the stability region of the two-user broadcast channel (BC) with bursty data arrivals and security constraints. We consider the scenario, where one of the receivers has a secrecy constraint and its packets need to be kept secret from the other receiver. This is achieved by employing fullduplexing at the receiver with the secrecy constraint, so that it transmits a jamming signal to impede the reception of the other receiver. In this context, the stability region of the two-user BC is characterized for the general decoding case. Then, assuming two different decoding schemes the respective stability regions are derived. The effect of self-interference due to the full-duplex operation on the stability region is also investigated. The stability region of the BC with a secrecy constraint, where the receivers do not have full duplex capability can be obtained as a special case of the results derived in this paper. In addition, the paper considers the problem of maximizing the saturated throughput of the queue, whose packets does not require to be kept secret under minimum service guarantees for the other queue. The results provide new insights on the effect of the secrecy constraint on the stability region of the BC. In particular, it is shown that the stability region with secrecy constraint is sensitive to the coefficient of self-interference cancelation under certain cases.

Performance Analysis of a Cache-Aided Wireless Heterogeneous Network With Secrecy Constraints

“…Data arrival at the service nodes in wireless networks is bursty however, a large number of research works in information theory assumes the presence of backlogged users [8]- [7], [9]- [13]. In [21] the stability region of a broadcast channel for two users was examined taking into consideration the security of a single link and the bursty nature of packet arrival at the sender node. The secrecy constraints of a wireless broadcast channel were exploited in [22] and [23], where a confidential broadcast transmission is directed to multiple users that need to decode their dedicated packets to remain secret from the other users.…”

“…Based on the analysis in [21], we cannot perform successive decoding at both users simultaneously because this will result in infeasible power allocations for the packet transmissions. We consider the following scenarios based on different decoding ability at the users 1) Both the users D and U treat interference as noise.…”

“…where θ D is the SINR threshold for successful decoding. In this work, we consider packet with finite length and hence, SINR based secrecy metric is used [21], [34]- [36]. The commonly used metrics such as secrecy capacity, secrecy outage probability and ergodic secrecy rate are difficult to compute when length of the packet is short.…”

Delay Performance of a Two-User Broadcast Channel with Security Constraints

“…1 The system model where queue Q 1 has bursty traffic with arrival rate 1 and a queue Q 2 which is saturated. Receiver D 1 transmits a jamming signal of power P J to receiver D 2 to hinder eavesdropping different traffic assumptions at Q 1 and Q 2 , in contrast with [5], where the case where one queue has bursty traffic and other queue has saturated traffic is not considered.…”

“…Most of the works in physical layer secrecy assume that users have always data to transmit. However, in many practical scenarios, the arrival of data is bursty in nature and the notion of stable throughput or region becomes a meaningful measure for such scenarios [2][3][4][5][6]. However, the exact characterization of delay is rather difficult, even in small multiple access networks, and remains unexplored in most cases [6].…”