Degrees of freedom of MISO broadcast channel with perfect delayed and imperfect current CSIT

Author(s):  
Sheng Yang ◽  
Mari Kobayashi ◽  
David Gesbert ◽  
Xinping Yi
2013 ◽  
Vol 59 (1) ◽  
pp. 315-328 ◽  
Author(s):  
Sheng Yang ◽  
Mari Kobayashi ◽  
David Gesbert ◽  
Xinping Yi

Entropy ◽  
2019 ◽  
Vol 21 (10) ◽  
pp. 945
Author(s):  
Karim Banawan ◽  
Sennur Ulukus

We investigate the secure degrees of freedom (s.d.o.f.) of three new channel models: broadcast channel with combating helpers, interference channel with selfish users, and multiple access wiretap channel with deviating users. The goal of introducing these channel models is to investigate various malicious interactions that arise in networks, including active adversaries. That is in contrast with the common assumption in the literature that the users follow a certain protocol altruistically and transmit both message-carrying and cooperative jamming signals in an optimum manner. In the first model, over a classical broadcast channel with confidential messages (BCCM), there are two helpers, each associated with one of the receivers. In the second model, over a classical interference channel with confidential messages (ICCM), there is a helper and users are selfish. By casting each problem as an extensive-form game and applying recursive real interference alignment, we show that, for the first model, the combating intentions of the helpers are neutralized and the full s.d.o.f. is retained; for the second model, selfishness precludes secure communication and no s.d.o.f. is achieved. In the third model, we consider the multiple access wiretap channel (MAC-WTC), where multiple legitimate users wish to have secure communication with a legitimate receiver in the presence of an eavesdropper. We consider the case when a subset of users deviate from the optimum protocol that attains the exact s.d.o.f. of this channel. We consider two kinds of deviation: when some of the users stop transmitting cooperative jamming signals, and when a user starts sending intentional jamming signals. For the first scenario, we investigate possible responses of the remaining users to counteract such deviation. For the second scenario, we use an extensive-form game formulation for the interactions of the deviating and well-behaving users. We prove that a deviating user can drive the s.d.o.f. to zero; however, the remaining users can exploit its intentional jamming signals as cooperative jamming signals against the eavesdropper and achieve an optimum s.d.o.f.


2017 ◽  
Vol 63 (6) ◽  
pp. 3823-3853 ◽  
Author(s):  
Pritam Mukherjee ◽  
Ravi Tandon ◽  
Sennur Ulukus

Electronics ◽  
2020 ◽  
Vol 9 (3) ◽  
pp. 496
Author(s):  
Gustavo Anjos ◽  
Daniel Castanheira ◽  
Adão Silva ◽  
Atílio Gameiro

This work addresses the security of a two-user broadcast channel. The challenge of protecting a broadcast channel is associated with the necessity of securing the system, not only against eavesdropping attacks originating from external nodes, but also to ensure that the inside users do not eavesdrop on each other’s information. To address this issue, the present work proposes a cooperative jamming scheme that provides protection against eavesdropping attacks carried out simultaneously by inside users and external eavesdroppers. To achieve this goal, the developed scheme combines real interference alignment with a blind cooperative jamming technique defined in the literature. An information theoretical analysis shows that positive secure degrees of freedom are achievable using the proposed solution.


Sign in / Sign up

Export Citation Format

Share Document