English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In this paper a $K$-user fading multiple access channel with and withoutsecurity constraints is studied. First we consider a F-MAC without the securityconstraints. Under the assumption of individual CSI of users, we propose theproblem of power allocation as a stochastic game when the receiver sends an ACKor a NACK depending on whether it was able to decode the message or not. Wehave used Multiplicative weight no-regret algorithm to obtain a CoarseCorrelated Equilibrium (CCE). Then we consider the case when the users candecode ACK/NACK of each other. In this scenario we provide an algorithm tomaximize the weighted sum-utility of all the users and obtain a Pareto optimalpoint. PP is socially optimal but may be unfair to individual users. Next weconsider the case where the users can cooperate with each other so as todisagree with the policy which will be unfair to individual user. We thenobtain a Nash bargaining solution, which in addition to being Pareto optimal,is also fair to each user.  Next we study a $K$-user fading multiple access wiretap Channel with CSI ofEve available to the users. We use the previous algorithms to obtain a CCE, PPand a NBS.  Next we consider the case where each user does not know the CSI of Eve butonly its distribution. In that case we use secrecy outage as the criterion forthe receiver to send an ACK or a NACK. Here also we use the previous algorithmsto obtain a CCE, PP or a NBS. Finally we show that our algorithms can beextended to the case where a user can transmit at different rates. At the endwe provide a few examples to compute different solutions and compare them underdifferent CSI scenarios.

Resource Allocation in a MAC with and without security via Game Theoretic Learning