论文标题
新颖的信息理论游戏理论见解,以在UAV中广播
Novel Information-theoretic Game-theoretical Insights to Broadcasting in Internet-of-UAVs
论文作者
论文摘要
对于无人驾驶飞机(UAVS),广播中的一些挑战以及从新的角度探讨了一些挑战。首先,在本文中,我们研究了一个广播收发器。从嘈杂的通道视点的控件中,我们考虑:(\ textit {i})爱丽丝将$ \ nathcal {x} $发送给鲍勃,以更多\ textcolor {black} {效率} {有效},而她希望鲍勃不愿访问私人消息$ \ nathcal $ \ nathcal {s} $ {s s \ nath $ { $ \ MATHCAL {X} $ $ - $,即,Alice有目的地将信息的\ textit {turbulent-flow}发送给bob; (\ textIt {ii})$ \ big(θ_1;θ_2\ big)$是control-action-air,它实现了\ textit {pursuit-evasion}。由于与以前的状态有关的内存效应,我们在系统中考虑\ textIt {dispaipativity}。 We thus propose a federated-learning based \textit{Blahut-Arimoto} algorithm while a 2-D \textit{dissipativity}-theoretic continuous-Mean-Field-Game (MFG) is proposed with regard to (w.r.t.) a joint probability-distribution-function (PDF) of the population distribution $-$ relating to a continuous-control-law.我们还分析了在多用户场景中欠多个鲍勃的爱丽丝,我们将基于破产的$ 3- $级别的嵌套游戏应用。
For the Internet-of-unmanned aerial vehicles (UAVs) some challenges in broadcasting and from new points of view are explored. In this paper, first, we investigate a single broadcast transceiver. From a control of noisy-channel viewpoint, we consider: (\textit{i}) Alice sends $\mathcal{X}$ to Bob as more \textcolor{black}{efficient} as possible while she wishes Bob not to get access to the private message $\mathcal{S}$ regarding the correlation between $\mathcal{S}$ and $\mathcal{X}$ $-$ i.e., Alice purposefully sends a \textit{turbulent-flow} of the information to Bob; and (\textit{ii}) where $\big (Θ_1;Θ_2 \big)$ is the control-action-pair which actualise a \textit{pursuit-Evasion}. We consider \textit{dissipativity} in our system due to the memory effect relating to the previous states. We thus propose a federated-learning based \textit{Blahut-Arimoto} algorithm while a 2-D \textit{dissipativity}-theoretic continuous-Mean-Field-Game (MFG) is proposed with regard to (w.r.t.) a joint probability-distribution-function (PDF) of the population distribution $-$ relating to a continuous-control-law. We also analyse what if Alice is owed to multiple Bobs in a multi-user scenario which we apply a bankruptcy based $3-$level nested game for.