arXiv subjects

Makan Zamanipour

Publications and source records attributed to Makan Zamanipour.

9 recordsLinked to original sources

arXiv2022

Orbital Angular Momentum: From State Disentanglement Towards the Secrecy Outage Probability

How are we able to fix it so as to theoretically go over it, if the optimality and efficiency of the orbital angular momentum (OAM) multiplexing technique in a multi-input multi-output (MIMO) system fails in practice -- something that technically causes a considerable reduction in the maximum achievable value of the transceiver's degree-of-freedom? Is the aforementioned challenging issue theoretically interpretable? This paper considers the above mentioned challenge in the reconfigurable intelligent surface based systems -- as an exemplified system model -- and consequently proposes a Mendelain randomaisation (MR) technique through which we can further overcome the aforementioned challenge. Towards such end and in this paper, we take into account a Markov chain $\mathcal{G}-\circ-\mathcal{X}-\circ-\mathcal{Y}-\circ-\mathcal{V}$ while $\mathcal{G}$, $\mathcal{X}$, $\mathcal{Y}$ and $\mathcal{V}$ respectively denote transmit design parameters, quality of goods, error floor in data detection and non-orthogonality set in the OAM implementation -- arisen from other non-optimalities, disturbances and inefficiencies such as the atmospheric Kolmogorov turbulence. Furthermore, we consider a not-necessarily-Gaussian randomisation method according to which the resultant probability distribution function (PDF) is 2-D in relation to a definable outage probability in the design problem in relation to $\mathcal{Y}$ -- that is, in terms of $β_{\mathcal{X}}θ$ while the randomisation is applied to $θ$ as the control input which should be optimally derived as the graph-theoretically associating parameter between $\mathcal{X}$ and $\mathcal{Y}$, and $β_{\mathcal{X}}$ is the the associating parameter between $\mathcal{G}$ and the exposure $\mathcal{X}$.

cs.IT↗

arXiv2022

A Theoretically Novel Trade-off for Sparse Secret-key Generation

We in this paper theoretically go over a rate-distortion based sparse dictionary learning problem. We show that the Degrees-of-Freedom (DoF) interested to be calculated $-$ satnding for the minimal set that guarantees our rate-distortion trade-off $-$ are basically accessible through a \textit{Langevin} equation. We indeed explore that the relative time evolution of DoF, i.e., the transition jumps is the essential issue for a relaxation over the relative optimisation problem. We subsequently prove the aforementioned relaxation through the \textit{Graphon} principle w.r.t. a stochastic \textit{Chordal Schramm-Loewner} evolution etc {via a minimisation over a distortion between the relative realisation times of two given graphs $\mathscr{G}_1$ and $\mathscr{G}_2$ as $ \mathop{{\rm \mathbb{M}in}}\limits_{ \mathscr{G}_1, \mathscr{G}_2} {\rm \; } \mathcal{D} \Big( t\big( \mathscr{G}_1 , \mathscr{G} \big) , t\big( \mathscr{G}_2 , \mathscr{G} \big) \Big)$}. We also extend our scenario to the eavesdropping case. We finally prove the efficiency of our proposed scheme via simulations.

cs.IT↗

arXiv2022

Cyber-Physical-Systems and Secrecy Outage Probability: Revisited

This paper technically explores the secrecy rate $Λ$ and a maximisation problem over the concave version of the secrecy outage probability (SOP) as $\mathop{{\rm \mathbb{M}ax}}\limits_{Δ} {\rm \; } \mathbb{P}\mathscr{r} \big( Λ\ge λ\big) $. We do this from a generic viewpoint even though we use a traditional Wyner's wiretap channel for our system model $-$ something that can be extended to every kind of secrecy modeling and analysis. We consider a Riemannian mani-fold for it and we mathematically define a volume for it as $\mathbb{V}\mathscr{ol}\big \lbrace Λ\big \rbrace$. Through achieving a new bound for the Riemannian mani-fold and its volume, we subsequently relate it to the number of eigen-values existing in the relative probabilistic closure. We prove in-between some novel lemmas with the aid of some useful inequalities such as the \textit{Finsler's} lemma, the generalised \textit{Young's} inequality, the generalised \textit{Brunn-Minkowski} inequality, the \textit{Talagrand's} concentration inequality. We additionally propose a novel Markov decision process based reinforcement learning algorithm in order to find the optimal policy in relation to the eigenvalue distributions $-$ something that is extended to a possibilisitically semi-Markov decision process for the case of periodic attacks.

cs.IT↗

arXiv2022

Adversarial Robustness in Cognitive Radio Networks

\textit{When an adversary gets access to the data sample in the adversarial robustness models and can make data-dependent changes, how has the decision maker consequently, relying deeply upon the adversarially-modified data, to make statistical inference? How can the resilience and elasticity of the network be literally justified $-$ if there exists a tool to measure the aforementioned elasticity?} The principle of byzantine resilience distributed hypothesis testing (BRDHT) is considered in this paper for cognitive radio networks (CRNs) $-$ without-loss-of-generality, something that can be extended to any type of homogeneous or heterogeneous networks $-$ while the byzantine primary user (PU) has a signal-to-noise-ratio (SNR) including the coefficient of $\frac{d\ell \big ( θ| \mathscr{s}_0 \big )}{d\ell \big ( θ\big )} $ which is in relation to the temporal rate of the $α-$leakage as the appropriate tool to measure the aforementioned resilience. Our novel online algorithm $-$ which is named $\mathbb{OBRDHT}$ $-$ and solution are both unique and generic over which an evaluation is finally performed by simulations $-$ e.g. an evaluation of the total error as the false alarm probability in addition to the miss detection probability versus the sensing time.

cs.IT↗

arXiv2022

A Game Theoretical Analysis on the Gray-Wyner System and Generalised Common Information

We analyse the common information problem for the generalised Gray-Wyner problem. We aim to explore the problem and solution in relation to the non-orthogonality among the source decoders' components. We consider a simple networked control system consisting of 2 groups of users: (i) one sender or Observer named Alice; and (ii) a group of multiple receivers or Controllers, named Bobs. In order to tackle the possible risk arisen from the common information among Bobs, Alice provides a redundancy creating some virtual messages which are in the null of each specific Bob, but not for others. The aforementioned possible risk is inevitable since, non-impossibly speaking, some/all of them may instantaneously act as potential Eavesdropper(s) with the abuse of the aforementioned common information. This novel discipline, which has not been investigated yet to the best of our knowledge, is theoretically interpreted from a mirror-game-theoretical point-of-view. Novel mathematical problems are derived specifically including some proofs for the information-theoretic relaxations and non-stationarity as well as the existence of the Nash equiblirium. Finally speaking, simulations approve our scheme.

cs.IT↗

arXiv2022

Novel Information-theoretic Game-theoretical Insights to Broadcasting in Internet-of-UAVs

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.

cs.IT↗

arXiv2020

A Survey on Deep-Learning based Techniques for Modeling and Estimation of MassiveMIMO Channels

\textit{Why does the literature consider the channel-state-information (CSI) as a 2/3-D image? What are the pros-and-cons of this consideration for accuracy-complexity trade-off?} Next generations of wireless communications require innumerable disciplines according to which a low-latency, low-traffic, high-throughput, high spectral-efficiency and low energy-consumption are guaranteed. Towards this end, the principle of massive multi-input multi-output (MaMIMO) is emerging which is conveniently deployed for millimeter wave (mmWave) bands. However, practical and realistic MaMIMO transceivers suffer from a huge range of challenging bottlenecks in design the majority of which belong to the issue of channel-estimation. Channel modeling and prediction in MaMIMO particularly suffer from computational complexity due to a high number of antenna sets and supported users. This complexity lies dominantly upon the feedback-overhead which even degrades the pilot-data trade-off in the uplink (UL)/downlink (DL) design. This comprehensive survey studies the novel deep-learning (DLg) driven techniques recently proposed in the literature which tackle the challenges discussed-above - which is for the first time. In addition, we consequently propose 7 open trends e.g. in the context of the lack of Q-learning in MaMIMO detection - for which we talk about a possible solution to the saddle-point in the 2-D pilot-data axis for a \textit{Stackelberg game} based scenario.

cs.IT↗

arXiv2015

A New Coordinated Beamformer for MIMO-based Ad Hoc Networks

The study proposes a new scheme for MIMO-based ad hoc networks. This is accomplished, while using the Interference Driving Technique (IDT) over Nakagami-m fading channels with perfect channel state information at both the transmitter and receiver. The use of this technique is proposed to decrease the impact of all the unwanted interferences, routinely caused by the overlap of the defined radio transmission ranges related to the used nodes. Indeed, IDT is utilized as a coordinated beamformer in a cooperative scheme, according to mean squared error criterion. The methodology and also analytical results are conducted to prove the aptitude of the paper.

cs.IT↗

arXiv2015

MIMO CDMA-based Optical SATCOMs: A New Solution

A new scheme for MIMO CDMA-based optical satellite communications (OSATCOMs) is presented. Three independent problems are described for up-link and down- link in terms of two distinguished optimization problems. At first, in up-link, Pulse-width optimization is proposed to reduce dispersions over fibers as the terrestrial part. This is performed for return-to-zero (RZ) modulation that is supposed to be used as an example in here. This is carried out by solving the first optimization problem, while minimizing the probability of overlapping for the Gaussian pulses that are used to produce RZ. Some constraints are assumed such as a threshold for the peak-to-average power ratio (PAPR). In down-link, the second and the third problems are discussed as follows, jointly as a closed-form solution. Solving the second optimization problem, an objective function is obtained, namely the MIMO CDMA-based satellite weight-matrix as a conventional adaptive beam-former. The Satellite link is stablished over flat un-correlated Nakagami-m/Suzuki fading channels as the second problem. On the other hand, the mentioned optimization problem is robustly solved as the third important problem, while considering inter-cell interferences in the multi-cell scenario. Robust solution is performed due to the partial knowledge of each cell from the others in which the link capacity is maximized. Analytical results are conducted to investigate the merit of system.

cs.NI↗