Farhad Shirani
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Farhad Shirani has a total of 32 co-authors. Here are the top co-authors by number of shared publications:
- S. Sandeep Pradhan
Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI 48109, USA
10 shared publications - Elza Erkip
Department of Electrical and Computer Engineering, New York University, Brooklyn, NY, USA
8 shared publications - Mohsen Heidari
Department of Computer Science, Indiana University, Bloomington, USA
3 shared publications Siddharth Garg
Department of Electrical and Computer Engineering New York University New York, New York, 11201
3 shared publications- Siddharth Garg
New York University
3 shared publications - Hojat Allah Salehi
Florida International University
2 shared publications
Latest Publications
- 4 May 2026
- Published byĀ Institute of Electrical and Electronics Engineers (IEEE)Ā inĀ IEEE Transactions on Pattern Analysis and Machine Intelligence
- Vol.Ā PP Ā (01628828) , 1-16
Addressing Structural Distribution Shift in Explanations for Graph Neural Networks
Graph Neural Networks (GNNs) are essential for processing graph-structured data and have wide applications in critical domains. The increasing use of GNNs in high-stakes scenarios requires robust explainability to ensure trust and transparency in decision-making. A common approach to explaining GNNs is to identify subgraphs, a.k.a. explanations, that significantly influence model predictions. However, this task is challenging due to the distribution shifts from the original training graphs to the explanation subgraphs, a factor that is largely overlooked in the existing research. These shifts arise because GNNs are trained on original graphs, while explanation subgraphs often differ in properties such as the number of nodes or structural patterns. As a result, GNNs may struggle to generalize to explanation subgraphs with a different distribution from its training data. In this paper, we systematically investigate the Out-Of-Distribution (OOD) problem through theoretical analysis and empirical studies. To address this challenge, we first develop a theoretical framework that formalizes the notion of explanation subgraphs through sufficiency and minimality criteria, ensuring both prediction preservation and structural compactness. Our analysis reveals a fundamental distributional disparity between explanation subgraphs and original graphs, leading to a novel concept of proxy graphs proposed in this work. Proxy graphs maintain the essential explanatory information while conforming to the original data distribution through a combination of parametric and non-parametric optimization approaches. Empirical evaluations on diverse datasets show that our method improves the quality and reliability of GNN explanations, advancing the field of GNN explainability.
- 4 May 2026
- Published byĀ Institute of Electrical and Electronics Engineers (IEEE)Ā inĀ IEEE Transactions on Pattern Analysis and Machine Intelligence
- Vol.Ā PP Ā (01628828) , 1-16
Addressing Structural Distribution Shift in Explanations for Graph Neural Networks
Graph Neural Networks (GNNs) are essential for processing graph-structured data and have wide applications in critical domains. The increasing use of GNNs in high-stakes scenarios requires robust explainability to ensure trust and transparency in decision-making. A common approach to explaining GNNs is to identify subgraphs, a.k.a. explanations, that significantly influence model predictions. However, this task is challenging due to the distribution shifts from the original training graphs to the explanation subgraphs, a factor that is largely overlooked in the existing research. These shifts arise because GNNs are trained on original graphs, while explanation subgraphs often differ in properties such as the number of nodes or structural patterns. As a result, GNNs may struggle to generalize to explanation subgraphs with a different distribution from its training data. In this paper, we systematically investigate the Out-Of-Distribution (OOD) problem through theoretical analysis and empirical studies. To address this challenge, we first develop a theoretical framework that formalizes the notion of explanation subgraphs through sufficiency and minimality criteria, ensuring both prediction preservation and structural compactness. Our analysis reveals a fundamental distributional disparity between explanation subgraphs and original graphs, leading to a novel concept of proxy graphs proposed in this work. Proxy graphs maintain the essential explanatory information while conforming to the original data distribution through a combination of parametric and non-parametric optimization approaches. Empirical evaluations on diverse datasets show that our method improves the quality and reliability of GNN explanations, advancing the field of GNN explainability.
- 11 August 2025
- Published byĀ Institute of Electrical and Electronics Engineers (IEEE)Ā inĀ IEEE Transactions on Information Theory
- Vol.Ā 71 Ā (10) , 8048-8079
On Non-Interactive Simulation of Distributed Sources With Finite Alphabets
This work presents a Fourier analysis framework for the non-interactive source simulation (NISS) problem. Two distributed agents observe a pair of sequences$X^{d}$ and$Y^{d}$ drawn according to a joint distribution$P_{X^{d}Y^{d}}$ . The agents aim to generate outputs$U=f_{d}(X^{d})$ and$V=g_{d}(Y^{d})$ with a joint distribution sufficiently close in total variation to a target distribution$Q_{UV}$ . Existing works have shown that the NISS problem with finite-alphabet outputs is decidable. For the binary-output NISS, an upper-bound to the input complexity was derived which is$O\left ({{\exp \mathrm {poly}\left ({{\frac {1}{\epsilon }}}\right)}}\right)$ . In this work, the input complexity and algorithm design are addressed in several classes of NISS scenarios. For binary-output NISS scenarios with doubly-symmetric binary inputs, it is shown that the input complexity is$\Theta \left ({{\log {\frac {1}{\epsilon }}}}\right)$ , thus providing a super-exponential improvement in input complexity. An explicit characterization of the simulating pair of functions is provided. For general finite-input scenarios, a constructive algorithm is introduced that explicitly finds the simulating functions$(f_{d}(X^{d}),g_{d}(Y^{d}))$ . The approach relies on a novel Fourier analysis framework. Various numerical simulations of NISS scenarios with IID inputs are provided. Furthermore, to illustrate the general applicability of the Fourier framework, several examples with non-IID inputs, including entanglement-assisted NISS and NISS with Markovian inputs are provided.- 11 August 2025
- Published byĀ Institute of Electrical and Electronics Engineers (IEEE)Ā inĀ IEEE Transactions on Information Theory
- Vol.Ā 71 Ā (10) , 8048-8079
On Non-Interactive Simulation of Distributed Sources With Finite Alphabets
This work presents a Fourier analysis framework for the non-interactive source simulation (NISS) problem. Two distributed agents observe a pair of sequences$X^{d}$ and$Y^{d}$ drawn according to a joint distribution$P_{X^{d}Y^{d}}$ . The agents aim to generate outputs$U=f_{d}(X^{d})$ and$V=g_{d}(Y^{d})$ with a joint distribution sufficiently close in total variation to a target distribution$Q_{UV}$ . Existing works have shown that the NISS problem with finite-alphabet outputs is decidable. For the binary-output NISS, an upper-bound to the input complexity was derived which is$O\left ({{\exp \mathrm {poly}\left ({{\frac {1}{\epsilon }}}\right)}}\right)$ . In this work, the input complexity and algorithm design are addressed in several classes of NISS scenarios. For binary-output NISS scenarios with doubly-symmetric binary inputs, it is shown that the input complexity is$\Theta \left ({{\log {\frac {1}{\epsilon }}}}\right)$ , thus providing a super-exponential improvement in input complexity. An explicit characterization of the simulating pair of functions is provided. For general finite-input scenarios, a constructive algorithm is introduced that explicitly finds the simulating functions$(f_{d}(X^{d}),g_{d}(Y^{d}))$ . The approach relies on a novel Fourier analysis framework. Various numerical simulations of NISS scenarios with IID inputs are provided. Furthermore, to illustrate the general applicability of the Fourier framework, several examples with non-IID inputs, including entanglement-assisted NISS and NISS with Markovian inputs are provided.- 17 July 2025
- Published byĀ Institute of Electrical and Electronics Engineers (IEEE)Ā inĀ IEEE BITS the Information Theory Magazine
- Vol.Ā 4 Ā (2) , 39-42
Unconference on Generative AI and LLMs Session At ISIT 2023 and ISIT 2024
In an era marked by the rapid and transformative rise of generative AI, professionals, researchers, and students alike are compelled to engage in meaningful discussions with their peers to navigate the profound changes and opportunities this technology brings. Reflecting this shared sentiment, the inaugural unconference event on Generative AI and Large Language Models (LLMs) was held at ISIT 2023, followed by its second edition in 2024. Key discussions covered the integration of AI into academic tasks, its transformative effects on education, its influence on research methodologies, and career implications. Reflective conversations highlighted ethical concerns and the evolving academic landscape that accompanies them. The unconference format, characterized by a lack of a strict structure, encouraged participants to engage in free-flowing discussions and share their insights openly. This year's unconference event at ISIT 2024 concluded with a call to action for participants to contribute to the ethical and effective use of generative AI.
- 17 July 2025
- Published byĀ Institute of Electrical and Electronics Engineers (IEEE)Ā inĀ IEEE BITS the Information Theory Magazine
- Vol.Ā 4 Ā (2) , 39-42
Unconference on Generative AI and LLMs Session At ISIT 2023 and ISIT 2024
In an era marked by the rapid and transformative rise of generative AI, professionals, researchers, and students alike are compelled to engage in meaningful discussions with their peers to navigate the profound changes and opportunities this technology brings. Reflecting this shared sentiment, the inaugural unconference event on Generative AI and Large Language Models (LLMs) was held at ISIT 2023, followed by its second edition in 2024. Key discussions covered the integration of AI into academic tasks, its transformative effects on education, its influence on research methodologies, and career implications. Reflective conversations highlighted ethical concerns and the evolving academic landscape that accompanies them. The unconference format, characterized by a lack of a strict structure, encouraged participants to engage in free-flowing discussions and share their insights openly. This year's unconference event at ISIT 2024 concluded with a call to action for participants to contribute to the ethical and effective use of generative AI.
- 15 July 2025
- Published byĀ Institute of Electrical and Electronics Engineers (IEEE)Ā inĀ IEEE Transactions on Vehicular Technology
- Vol.Ā 74 Ā (12) , 19436-19451
Deep Learning for Multi-Modal Sensor Fusion and CSI Compression in Vehicular Communications
Vehicle-to-infrastructure (V2I) communications requires accurate channel state information (CSI) estimation with strict latency constraints, which is challenging in dynamic vehicular environments. This paper introduces a novel multi-modal fusion framework that leverages radar, camera, and GPS data to enhance CSI compression in V2I networks. We design a distributed deep learning architecture comprising an encoder at the vehicle, a sensor fusion network at the base station (BS), and a decoder that jointly optimizes CSI reconstruction under rate-limited feedback constraints. Our key innovations include: (1) systematic integration of three complementary sensing modalities, quantifying their individual and combined contributions; (2) a temporal correlation model that leverages both multi-modal data and historical CSI estimates; and (3) a comprehensive evaluation framework using our newly introduced DeepVerse 6G dataset. Extensive experiments demonstrate significant performance improvements, e.g., GPS data alone enhances CSI estimates by approximately 67% in static scenarios and 69% in dynamic scenarios compared to conventional approaches. Our analysis across varying traffic densities provides valuable design guidelines for practical deployment in diverse vehicular environments.
- 15 July 2025
- Published byĀ Institute of Electrical and Electronics Engineers (IEEE)Ā inĀ IEEE Transactions on Vehicular Technology
- Vol.Ā 74 Ā (12) , 19436-19451
Deep Learning for Multi-Modal Sensor Fusion and CSI Compression in Vehicular Communications
Vehicle-to-infrastructure (V2I) communications requires accurate channel state information (CSI) estimation with strict latency constraints, which is challenging in dynamic vehicular environments. This paper introduces a novel multi-modal fusion framework that leverages radar, camera, and GPS data to enhance CSI compression in V2I networks. We design a distributed deep learning architecture comprising an encoder at the vehicle, a sensor fusion network at the base station (BS), and a decoder that jointly optimizes CSI reconstruction under rate-limited feedback constraints. Our key innovations include: (1) systematic integration of three complementary sensing modalities, quantifying their individual and combined contributions; (2) a temporal correlation model that leverages both multi-modal data and historical CSI estimates; and (3) a comprehensive evaluation framework using our newly introduced DeepVerse 6G dataset. Extensive experiments demonstrate significant performance improvements, e.g., GPS data alone enhances CSI estimates by approximately 67% in static scenarios and 69% in dynamic scenarios compared to conventional approaches. Our analysis across varying traffic densities provides valuable design guidelines for practical deployment in diverse vehicular environments.
- 1 June 2024
- Published byĀ Institute of Electrical and Electronics Engineers (IEEE)Ā inĀ IEEE BITS the Information Theory Magazine
- Vol.Ā 4 Ā (2) , 32-38
IEEE ISIT 2024 āBits and Botsā CompetitionāFostering Innovation and Learning Through Bot Detection Challenges
Large Language Models (LLMs) such as GPT and similar architectures have revolutionized artificial intelligence by enabling machines to understand and generate human-like text. However, these models are inherently statistical predictors rather than real-time reasoning systems, leading to fundamental limitations in accessing up-to-date information and verifying factual accuracy. This issue is particularly critical in high-stakes domains such as cryptocurrency markets, decentralized finance (DeFi), and autonomous AI agents, where real-time, verifiable, and tamper-proof information is essential for decision-making.In this paper, we introduce AI Oracle, a novel framework that integrates blockchain-powered oracles with LLMs and autonomous agents to ensure real-time access to cryptographically verified knowledge. We compare AI Oracle with both standalone LLMs and retrieval-based systems using the Model Context Protocol (MCP), highlighting significant advantages in factual reliability, adversarial robustness, and interpretability. AI Oracle combines decentralized consensus, immutable storage, and cryptographic attestation to equip AI agents with enhanced resistance to manipulation, hallucination, and misinformation.Beyond architectural improvements, we explore the broader applicability of AI Oracle across domains that require provable correctness and trustāranging from real-world asset (RWA) tokenization to autonomous agent coordination and decentralized governance. By positioning AI Oracle as a trust-minimized epistemic infrastructure, we propose a new paradigm in AI systems: the fusion of decentralized trust with autonomous reasoning, enabling agents to operate with resilience, transparency, and embedded verifiability across dynamic environments.
- 1 June 2024
- Published byĀ Institute of Electrical and Electronics Engineers (IEEE)Ā inĀ IEEE BITS the Information Theory Magazine
- Vol.Ā 4 Ā (2) , 32-38
IEEE ISIT 2024 āBits and Botsā CompetitionāFostering Innovation and Learning Through Bot Detection Challenges
Large Language Models (LLMs) such as GPT and similar architectures have revolutionized artificial intelligence by enabling machines to understand and generate human-like text. However, these models are inherently statistical predictors rather than real-time reasoning systems, leading to fundamental limitations in accessing up-to-date information and verifying factual accuracy. This issue is particularly critical in high-stakes domains such as cryptocurrency markets, decentralized finance (DeFi), and autonomous AI agents, where real-time, verifiable, and tamper-proof information is essential for decision-making.In this paper, we introduce AI Oracle, a novel framework that integrates blockchain-powered oracles with LLMs and autonomous agents to ensure real-time access to cryptographically verified knowledge. We compare AI Oracle with both standalone LLMs and retrieval-based systems using the Model Context Protocol (MCP), highlighting significant advantages in factual reliability, adversarial robustness, and interpretability. AI Oracle combines decentralized consensus, immutable storage, and cryptographic attestation to equip AI agents with enhanced resistance to manipulation, hallucination, and misinformation.Beyond architectural improvements, we explore the broader applicability of AI Oracle across domains that require provable correctness and trustāranging from real-world asset (RWA) tokenization to autonomous agent coordination and decentralized governance. By positioning AI Oracle as a trust-minimized epistemic infrastructure, we propose a new paradigm in AI systems: the fusion of decentralized trust with autonomous reasoning, enabling agents to operate with resilience, transparency, and embedded verifiability across dynamic environments.
- 15 December 2023
- Published byĀ Institute of Electrical and Electronics Engineers (IEEE)Ā inĀ IEEE Transactions on Information Theory
- Vol.Ā 70 Ā (3) , 1629-1651
A Structured Coding Framework for Communication and Computation Over Continuous Networks
This work considers an information-theoretic characterization of the set of achievable rates, costs, and distortions in a broad class of distributed communication and function computation scenarios with general continuous-valued sources and channels. A framework is presented which involves fine discretization of the source and channel variables followed by communication over the resulting discretized network. In order to evaluate the resulting achievable regions, convergence results for information measures are provided under the proposed discretization process. Prior works have considered such convergence results for mutual information quantities written in terms of univariate functions of random variables, and sums of independent random variables. These convergence results have been used to derive achievable regions in point-to-point communication scenarios and specific multiterminal scenarios with continuous alphabets. However, the best-known achievability results for distributed communication and function computation scenarios, which are based on structured coding strategies, involve mutual information quantities written in terms of bivariate functions of random variables, e.g., sum of two (not necessarily independent) random variables. A main contribution of this work is to show the convergence of mutual information quantities written in terms of sums of quantized random variables. This is an essential step in evaluating the achievable regions in continuous distributed computation scenarios by generalizing the structured coding strategies which have been previously used to derive the best-known achievable regions in discrete networks. The framework is used to provide achievability results for the problems of function computation over multiple-access channels, distributed source coding, function reconstruction (two-help-one), and multiple-descriptions source coding. In each scenario, discrete structured coding strategies along with the aforementioned convergence results are used to derive inner bounds to set of achievable rates, costs, and distortions. Furthermore, structured coding strategies are considered for distributed function computation scenarios involving computation of non-additive functions. The techniques are used to study an example where the objective is to compute the product of channel inputs over a multiple access channel, and an inner bound to the achievable rate region is evaluated. It is shown that, in contrast to many well-studied scenarios in multiterminal information theory, Gaussian input distribution is outperformed by the uniform input distribution.
- 15 December 2023
- Published byĀ Institute of Electrical and Electronics Engineers (IEEE)Ā inĀ IEEE Transactions on Information Theory
- Vol.Ā 70 Ā (3) , 1629-1651
A Structured Coding Framework for Communication and Computation Over Continuous Networks
This work considers an information-theoretic characterization of the set of achievable rates, costs, and distortions in a broad class of distributed communication and function computation scenarios with general continuous-valued sources and channels. A framework is presented which involves fine discretization of the source and channel variables followed by communication over the resulting discretized network. In order to evaluate the resulting achievable regions, convergence results for information measures are provided under the proposed discretization process. Prior works have considered such convergence results for mutual information quantities written in terms of univariate functions of random variables, and sums of independent random variables. These convergence results have been used to derive achievable regions in point-to-point communication scenarios and specific multiterminal scenarios with continuous alphabets. However, the best-known achievability results for distributed communication and function computation scenarios, which are based on structured coding strategies, involve mutual information quantities written in terms of bivariate functions of random variables, e.g., sum of two (not necessarily independent) random variables. A main contribution of this work is to show the convergence of mutual information quantities written in terms of sums of quantized random variables. This is an essential step in evaluating the achievable regions in continuous distributed computation scenarios by generalizing the structured coding strategies which have been previously used to derive the best-known achievable regions in discrete networks. The framework is used to provide achievability results for the problems of function computation over multiple-access channels, distributed source coding, function reconstruction (two-help-one), and multiple-descriptions source coding. In each scenario, discrete structured coding strategies along with the aforementioned convergence results are used to derive inner bounds to set of achievable rates, costs, and distortions. Furthermore, structured coding strategies are considered for distributed function computation scenarios involving computation of non-additive functions. The techniques are used to study an example where the objective is to compute the product of channel inputs over a multiple access channel, and an inner bound to the achievable rate region is evaluated. It is shown that, in contrast to many well-studied scenarios in multiterminal information theory, Gaussian input distribution is outperformed by the uniform input distribution.
- Open Access
MIMO Systems with One-bit ADCs: Capacity Gains using Nonlinear Analog Operations
Analog to Digital Converters (ADCs) are a major contributor to the energy consumption on the receiver side of millimeter-wave multiple-input multiple-output (MIMO) systems with large antenna arrays. Consequently, there has been significant interest in using low-resolution ADCs along with hybrid beam-forming at MIMO receivers for energy efficiency. However, decreasing the ADC resolution results in performance loss -- in terms of achievable rates -- due to increased quantization error. In this work, we study the application of practically implementable nonlinear analog operations, prior to sampling and quantization at the ADCs, as a way to mitigate the aforementioned rate-loss. A receiver architecture consisting of linear analog combiners, implementable nonlinear analog operators, and one-bit threshold ADCs is designed. The fundamental information theoretic performance limits of the resulting communication system, in terms of achievable rates, are investigated under various assumptions on the set of implementable nonlinear analog functions. In order to justify the feasibility of the nonlinear operations in the proposed receiver architecture, an analog circuit is introduced, and circuit simulations exhibiting the generation of the desired nonlinear analog operations are provided.
Open AccessMIMO Systems with One-bit ADCs: Capacity Gains using Nonlinear Analog Operations
Analog to Digital Converters (ADCs) are a major contributor to the energy consumption on the receiver side of millimeter-wave multiple-input multiple-output (MIMO) systems with large antenna arrays. Consequently, there has been significant interest in using low-resolution ADCs along with hybrid beam-forming at MIMO receivers for energy efficiency. However, decreasing the ADC resolution results in performance loss -- in terms of achievable rates -- due to increased quantization error. In this work, we study the application of practically implementable nonlinear analog operations, prior to sampling and quantization at the ADCs, as a way to mitigate the aforementioned rate-loss. A receiver architecture consisting of linear analog combiners, implementable nonlinear analog operators, and one-bit threshold ADCs is designed. The fundamental information theoretic performance limits of the resulting communication system, in terms of achievable rates, are investigated under various assumptions on the set of implementable nonlinear analog functions. In order to justify the feasibility of the nonlinear operations in the proposed receiver architecture, an analog circuit is introduced, and circuit simulations exhibiting the generation of the desired nonlinear analog operations are provided.
- 14 January 2022
- Published byĀ Institute of Electrical and Electronics Engineers (IEEE)Ā inĀ IEEE Journal on Selected Areas in Communications
- Vol.Ā 40 Ā (5) , 1632-1651
Opportunistic Temporal Fair Mode Selection and User Scheduling in Full-Duplex Systems
In-band full-duplex (FD) communication has emerged as one of the promising techniques to improve data rates in next generation wireless systems. Typical FD scenarios considered in the literature assume FD base stations (BSs) and half-duplex (HD) users activated either in uplink (UL) or downlink (DL), where inter-user interference (IUI) is treated as noise at the DL user. This paper considers more general FD scenarios where an arbitrary fraction of the users are capable of FD and/or they can perform successive interference cancellation (SIC) to mitigate IUI. Consequently, one user can be activated in either UL or DL (HD-UL and HD-DL modes), or simultaneously in both directions requiring self-interference mitigation (SIM) at that user (FD-SIM mode). Furthermore, two users can be scheduled, one in UL and the other in DL (both operating in HD), where the DL user can treat IUI as noise (FD-IN mode) or perform SIC to mitigate IUI (FD-SIC mode). This paper studies opportunistic mode selection and user scheduling under long-term and short-term temporal fairness in single-carrier and multi-carrier (OFDM) FD systems, with the goal of maximizing system utility (e.g. sum-rate). First, the feasible region of temporal demands is characterized for both long-term and short-term fairness. Subsequently, optimal temporal fair schedulers as well as practical low-complexity online algorithms are devised. Simulation results demonstrate that using SIC to mitigate IUI as well as having FD capability at users can improve FD throughput gains significantly especially, when user distribution is concentrated around a few hotspots.
- 14 January 2022
- Published byĀ Institute of Electrical and Electronics Engineers (IEEE)Ā inĀ IEEE Journal on Selected Areas in Communications
- Vol.Ā 40 Ā (5) , 1632-1651
Opportunistic Temporal Fair Mode Selection and User Scheduling in Full-Duplex Systems
In-band full-duplex (FD) communication has emerged as one of the promising techniques to improve data rates in next generation wireless systems. Typical FD scenarios considered in the literature assume FD base stations (BSs) and half-duplex (HD) users activated either in uplink (UL) or downlink (DL), where inter-user interference (IUI) is treated as noise at the DL user. This paper considers more general FD scenarios where an arbitrary fraction of the users are capable of FD and/or they can perform successive interference cancellation (SIC) to mitigate IUI. Consequently, one user can be activated in either UL or DL (HD-UL and HD-DL modes), or simultaneously in both directions requiring self-interference mitigation (SIM) at that user (FD-SIM mode). Furthermore, two users can be scheduled, one in UL and the other in DL (both operating in HD), where the DL user can treat IUI as noise (FD-IN mode) or perform SIC to mitigate IUI (FD-SIC mode). This paper studies opportunistic mode selection and user scheduling under long-term and short-term temporal fairness in single-carrier and multi-carrier (OFDM) FD systems, with the goal of maximizing system utility (e.g. sum-rate). First, the feasible region of temporal demands is characterized for both long-term and short-term fairness. Subsequently, optimal temporal fair schedulers as well as practical low-complexity online algorithms are devised. Simulation results demonstrate that using SIC to mitigate IUI as well as having FD capability at users can improve FD throughput gains significantly especially, when user distribution is concentrated around a few hotspots.
- 12 January 2022
- Published byĀ Institute of Electrical and Electronics Engineers (IEEE)Ā inĀ IEEE Journal on Selected Areas in Communications
- Vol.Ā 40 Ā (3) , 940-954
Fundamental Privacy Limits in Bipartite Networks Under Active Attacks
We introduce a new mathematical formulation for the problem of de-anonymizing social network users by actively querying their group memberships. In this formulation, the attacker has access to a noisy observation of the group membership of each user in the social network. When an unidentified victim visits a malicious website, the attacker uses browser history sniffing to make queries regarding the userās social media activity. Particularly, she can query the victimās group memberships and the victimās identity. The attacker receives noisy responses to her queries. The goal is to de-anonymize the victim with the minimum number of queries. Starting with a rigorous mathematical model for this active de-anonymization problem, we determine a bound on the attackerās expected query cost, and propose three algorithms that achieve this bound but with different computational cost and applicability in the presence of noise. Our results prove the sub-optimality of prior heuristic approaches to this problem. Finally, we conduct a worst case analysis of the active de-anonymization problem. We show that the maximum number of queries necessary for de-anonymization grows logarithmically in the number of users as well. We also show that the problem is closely connected to the minimum set covering problem.
- 12 January 2022
- Published byĀ Institute of Electrical and Electronics Engineers (IEEE)Ā inĀ IEEE Journal on Selected Areas in Communications
- Vol.Ā 40 Ā (3) , 940-954
Fundamental Privacy Limits in Bipartite Networks Under Active Attacks
We introduce a new mathematical formulation for the problem of de-anonymizing social network users by actively querying their group memberships. In this formulation, the attacker has access to a noisy observation of the group membership of each user in the social network. When an unidentified victim visits a malicious website, the attacker uses browser history sniffing to make queries regarding the userās social media activity. Particularly, she can query the victimās group memberships and the victimās identity. The attacker receives noisy responses to her queries. The goal is to de-anonymize the victim with the minimum number of queries. Starting with a rigorous mathematical model for this active de-anonymization problem, we determine a bound on the attackerās expected query cost, and propose three algorithms that achieve this bound but with different computational cost and applicability in the presence of noise. Our results prove the sub-optimality of prior heuristic approaches to this problem. Finally, we conduct a worst case analysis of the active de-anonymization problem. We show that the maximum number of queries necessary for de-anonymization grows logarithmically in the number of users as well. We also show that the problem is closely connected to the minimum set covering problem.
- 6 December 2021
- Published byĀ Institute of Electrical and Electronics Engineers (IEEE)Ā inĀ IEEE Transactions on Communications
- Vol.Ā 70 Ā (3) , 1580-1594
MIMO Networks With One-Bit ADCs: Receiver Design and Communication Strategies
High resolution analog to digital converters (ADCs) are conventionally used at the receiver terminals to store an accurate digital representation of the received signal, thereby allowing for reliable decoding of transmitted messages. However, in a wide range of applications, such as communication over millimeter wave and massive multiple-input multiple-output (MIMO) systems, the use of high resolution ADCs is not feasible due to power budget limitations. In the conventional fully digital receiver design, where each receiver antenna is connected to a distinct ADC, reducing the ADC resolution leads to performance loss in terms of achievable rates. One proposed method to mitigate the rate-loss is to use analog linear combiners leading to design of hybrid receivers. Here, the hybrid framework is augmented by the addition of delay elements to allow for temporal analog processing. Two new classes of receivers consisting of delay elements, analog linear combiners, and one-bit ADCs are proposed. The fundamental limits of communication in single and multi-user (uplink and downlink) MIMO systems employing the proposed receivers are investigated. In the high signal to noise ratio regime, it is shown that the proposed receivers achieve the maximum achievable rates among all receivers with the same number of one-bit ADCs.
- 6 December 2021
- Published byĀ Institute of Electrical and Electronics Engineers (IEEE)Ā inĀ IEEE Transactions on Communications
- Vol.Ā 70 Ā (3) , 1580-1594
MIMO Networks With One-Bit ADCs: Receiver Design and Communication Strategies
High resolution analog to digital converters (ADCs) are conventionally used at the receiver terminals to store an accurate digital representation of the received signal, thereby allowing for reliable decoding of transmitted messages. However, in a wide range of applications, such as communication over millimeter wave and massive multiple-input multiple-output (MIMO) systems, the use of high resolution ADCs is not feasible due to power budget limitations. In the conventional fully digital receiver design, where each receiver antenna is connected to a distinct ADC, reducing the ADC resolution leads to performance loss in terms of achievable rates. One proposed method to mitigate the rate-loss is to use analog linear combiners leading to design of hybrid receivers. Here, the hybrid framework is augmented by the addition of delay elements to allow for temporal analog processing. Two new classes of receivers consisting of delay elements, analog linear combiners, and one-bit ADCs are proposed. The fundamental limits of communication in single and multi-user (uplink and downlink) MIMO systems employing the proposed receivers are investigated. In the high signal to noise ratio regime, it is shown that the proposed receivers achieve the maximum achievable rates among all receivers with the same number of one-bit ADCs.