Topological interference management with reconfigurable antennas

@article{Yang2016TopologicalIM,
  title={Topological interference management with reconfigurable antennas},
  author={Heecheol Yang and Navid Naderializadeh and Amir Salman Avestimehr and Jungwoo Lee},
  journal={2016 IEEE International Symposium on Information Theory (ISIT)},
  year={2016},
  pages={555-559}
}
We study the symmetric degrees-of-freedom (DoF) of partially connected interference networks under linear coding strategies without channel state information at the transmitters beyond topology. We assume that the receivers are equipped with reconfigurable antennas that can switch among their preset modes. In such a network setting, we characterize the class of network topologies in which half linear symmetric DoF is achievable. Moreover, we derive a general upper bound on the linear symmetric… 

Figures from this paper

On the Impact of Normalized Interference Threshold for Topological Interference Management
TLDR
This paper presents a new formulation to build an interference topology for the multi-user unicast Topological Interference Management (TIM) based wireless network problem and limits the search space in the normalized interference threshold parameter range, to find half-DoF-feasible interference topologies having the possibility to be the best topologies in terms of the achievable rate.
Opportunistic Topological Interference Management
TLDR
Under this opportunistic TIM setting, a multi-state conflict graph is constructed to capture the mutual conflict of messages over <inline-formula> <tex-math notation="LaTeX">$M$ </tex- Math> states, and characterize the optimal DoF region of two classes of network topologies via polyhedral combinatorics.
Topological Interference Management for Wireless Networks
TLDR
A review of the family of TIM schemes, discussing the attainable degrees of freedom (DoFs) under the condition that the channel coefficient values are either constant or time varying, and identifying promising research directions for TIM schemes.
Topological interference management with decoded message passing: A polyhedral approach
  • Xinping Yi, G. Caire
  • Computer Science
    2017 IEEE International Symposium on Information Theory (ISIT)
  • 2017
TLDR
With the aid of polyhedral combinatorics, the structural properties of certain classes of network topologies are identified for which orthogonal access achieves the optimal degrees-of-freedom (DoF) region in the information-theoretic sense.
Application of the Topological Interference Management Method in Practical Scenarios
  • S. Doumiati, H. Artail, M. Assaad
  • Computer Science
    2019 International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob)
  • 2019
TLDR
This work defines the conditions under which TIM should be applied in order to save processing time when mobility is taken into account, and shows the implication of these scenarios in constraining the degrees-of-freedom (DoF) achieved.
TDMA is Optimal for All-Unicast DoF Region of TIM if and only if Topology is Chordal Bipartite
The main result of this paper is that an orthogonal access scheme, such as time division multiple access achieves the all-unicast degrees of freedom (DoF) region of the topological interference
Multilevel Topological Interference Management: A TIM-TIN Perspective
TLDR
An analytical baseline approach is proposed, which decomposes a network into TIN and TIM components, and a distributed numerical algorithm called ZEST is developed, leading to the duality of the TIM-TIN problem in terms of generalized degrees-of-freedom (GDoF).
A Framework of Topological Interference Management and Clustering for D2D Networks
TLDR
Simulation results show that the joint clustering-TIM framework can help, in some cases, improve the system degrees-of-freedom (DoF), especially in large D2D networks.
Topological Interference Management with Adversarial Perturbation
TLDR
A dynamic graph coloring algorithm is proposed that allows for a constant number of re-coloring updates against each inserted/deleted edge to achieve the information-theoretic optimality of the general graph recoloring.
Topological Interference Management with Adversarial Topology Perturbation: An Algorithmic Perspective
TLDR
A dynamic graph coloring algorithm that allows for a constant number of re-coloring updates against each inserted/deleted edge to achieve the information-theoretic optimality is proposed.
...
...

References

SHOWING 1-10 OF 21 REFERENCES
Impact of topology on interference networks with no CSIT
TLDR
The bounds for a class of networks are evaluated, showing that the bounds are tight for most topologies in that class, and the gains obtained over benchmark schemes are quantified.
Topological interference management with multiple antennas
  • Hua Sun, S. Jafar
  • Computer Science
    2014 IEEE International Symposium on Information Theory
  • 2014
TLDR
In this work, the implications of multiple inputs and multiple outputs (MIMO) are explored, highlighting fundamental differences and new phenomena.
Topological Interference Management With Transmitter Cooperation
TLDR
It is shown that the topological information can also be exploited in this case to strictly improve the degrees of freedom (DoF) as long as the network is not fully connected, which is a reasonable assumption in practice.
Topological interference management with alternating connectivity
TLDR
This work highlights the synergistic benefits of coding across alternating topologies, and explores the implications of varying connectivity, through a series of simple and conceptually representative examples.
Interference Networks With no CSIT: Impact of Topology
TLDR
This work evaluates bounds for two classes of networks to demonstrate their tightness for most networks in these classes, and quantifies the gain of the inner bounds over benchmark interference management strategies, and illustrates the effect of network topology on these gains.
Topological interference management with just retransmission: What are the “Best” topologies?
TLDR
This work considers a class of retransmission-based schemes, where transmitters in the network are only allowed to resend their symbols in order to assist with the neutralization of interference at the receivers, and introduces a necessary and sufficient condition on the network topology, under which half symmetric degrees-of-freedom (DoF) is achievable through the considered retransmissions- based schemes.
Topological Interference Management Through Index Coding
  • S. Jafar
  • Computer Science
    IEEE Transactions on Information Theory
  • 2014
This paper studies linear interference networks, both wired and wireless, with no channel state information at the transmitters except a coarse knowledge of the end-to-end one-hop topology of the
Degrees of freedom for K-user SISO interference channels with blind interference alignment
TLDR
The linear sum DoF is upper-bounded by K/K+n*(n*-1), n* where n* is the optimal number of preset modes among N and a linear scheme that achieves the upper-bound if K/n* is an integer is proposed.
Interference alignment through staggered antenna switching for MIMO BC with no CSIT
TLDR
It is shown that if N &#60; M, then a total of MNKoverM+KN−N DoF are achievable, almost surely, and the key to this interference alignment scheme is the ability of the receivers to switch between reconfigurable antenna modes to create short term channel fluctuation patterns that are exploited by the transmitter.
Linear Degrees of Freedom of MIMO Broadcast Channels With Reconfigurable Antennas in the Absence of CSIT
TLDR
Under general antenna configurations, the sum linear degrees of freedom (DoFs) of the user MIMO BC with reconfigurable antennas are completely characterized, which corresponds to the maximum sum DoF achievable by linear coding strategies.
...
...