# On the optimality of treating interference as noise: A combinatorial optimization perspective

@article{Yi2015OnTO, title={On the optimality of treating interference as noise: A combinatorial optimization perspective}, author={Xinping Yi and G. Caire}, journal={2015 IEEE International Symposium on Information Theory (ISIT)}, year={2015}, pages={1721-1725} }

For single-antenna Gaussian interference channels, we re-formulate the problem of determining the Generalized Degrees of Freedom (GDoF) region achievable by treating interference as noise (TIN) with proper power control from a combinatorial optimization perspective. We show that the TIN power control problem can be cast into an assignment problem, such that the globally optimal power allocation variables can be obtained by well-known polynomial time algorithms. Furthermore, the expression of… Expand

#### 10 Citations

Optimality of Treating Interference as Noise: A Combinatorial Perspective

- Mathematics, Computer Science
- IEEE Transactions on Information Theory
- 2016

A low-complexity GDoF-based distributed link scheduling and power control mechanism (ITLinQ+) is proposed that improves upon the ITLinQ scheme proposed by Naderializadeh and Avestimehr and further improves over the heuristic approach known as FlashLinQ. Expand

On the Optimality of Treating Interference as Noise

- Computer Science, Mathematics
- IEEE Transactions on Information Theory
- 2015

The generalized degrees of freedom region under this condition is a polyhedron, which is shown to be fully achieved by the same scheme, without the need for time-sharing, by first deriving a polyhedral relaxation of the GDoF region achieved by TIN and then providing a dual characterization of this polyhedral region via the use of potential functions. Expand

On the optimality of zero-forcing and treating interference as noise for K-user MIMO interference channels

- Mathematics, Computer Science
- 2016 IEEE International Symposium on Information Theory (ISIT)
- 2016

It is demonstrated that for K-user MIMO interference channels with different antenna numbers for transmitters and receivers, there exist non-trivial parameter regimes where a simple scheme of zero-forcing strong interference and treating the others as noise achieves the sum GDoF. Expand

Provably near optimal link scheduling and power control for wireless device-to-device networks

- Computer Science
- 2016 Australian Communications Theory Workshop (AusCTW)
- 2016

This paper provides a link scheduling method that has the dual benefits of being based on the characteristics of real-life RF front-ends used in practical wireless networks and at the same time being analytically tractable and analyze its performance characteristics. Expand

Practical interference management strategies in Gaussian networks

- Computer Science
- 2016

This thesis works on the theme of designing and characterizing the performance of conceptually simple transmission schemes that are robust and achieve performance that is close to optimal in cognitive radio networks. Expand

Secure GDoF of $K$-User Gaussian Interference Channels: When Secrecy Incurs No Penalty

- Computer Science
- IEEE Communications Letters
- 2015

This work shows that for TIN-optimal interference channels identified by Geng et al., secrecy constraints on unintended messages incur no GDoF penalty, which leads to a secure capacity region characterization within a constant gap. Expand

Analytical Characterization of ITLinQ: Channel Allocation for Device-to-Device Communication Networks

- Computer Science
- IEEE Transactions on Wireless Communications
- 2016

An analytical characterization of ITLinQ is presented, one of the principal D2D channelization schemes proposed to date, and a stochastic geometry setting is utilized for this analysis, enabling gleaning insights on how IT LinQ avoids situations of excessive interference. Expand

Allocations de ressources dans les réseaux sans fils énergétiquement efficaces.

- Political Science
- 2015

Dans le cadre de cette these, nous nous interessons plus particulierement adeux techniques permettant d’ameliorer l’efficacite energetique ou spectrale desreseaux sans fil. Dans la premiere partie de… Expand

#### References

SHOWING 1-10 OF 18 REFERENCES

On the Optimality of Treating Interference as Noise: Compound Interference Networks

- Mathematics, Computer Science
- IEEE Transactions on Information Theory
- 2016

This paper generalizes the optimality of TIN to compound networks and develops a centralized power control scheme for K-user compound interference channels that requires at most K updates to obtain the globally optimal power allocation for any feasible GDoF tuple. Expand

On the Optimality of Treating Interference as Noise

- Computer Science, Mathematics
- IEEE Transactions on Information Theory
- 2015

The generalized degrees of freedom region under this condition is a polyhedron, which is shown to be fully achieved by the same scheme, without the need for time-sharing, by first deriving a polyhedral relaxation of the GDoF region achieved by TIN and then providing a dual characterization of this polyhedral region via the use of potential functions. Expand

On the Optimality of Treating Interference as Noise: General Message Sets

- Mathematics, Computer Science
- IEEE Trans. Inf. Theory
- 2015

This paper shows that for such TIN-optimal interference channels, even if the message set is expanded to include an independent message from each transmitter to each receiver, operating the new channel as the original interference channel and treating interference as noise is still optimal for the sum capacity up to a constant gap. Expand

On the Optimality of Treating Interference as Noise for $K$ -User Parallel Gaussian Interference Networks

- Mathematics, Computer Science
- IEEE Transactions on Information Theory
- 2016

The explicit characterization of the sum capacity/sum GDoF of a TIN optimal network (without parallel channels) is interpreted as a minimum weighted matching problem in combinatorial optimization, and a simple characterization in terms of a partition of the interference network into vertex-disjoint cycles is obtained. Expand

Topological Interference Management With Transmitter Cooperation

- Mathematics, Computer Science
- IEEE Trans. Inf. Theory
- 2015

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. Expand

A New Outer Bound and the Noisy-Interference Sum–Rate Capacity for Gaussian Interference Channels

- Physics, Computer Science
- IEEE Transactions on Information Theory
- 2009

It is shown that if the channel crosstalk coefficient magnitudes lie below thresholds defined by the power constraints then single-user detection at each receiver is sum-rate optimal, i.e., treating the interference as noise incurs no loss in performance. Expand

The Hungarian Method for the Assignment Problem

- Computer Science
- 50 Years of Integer Programming
- 2010

This paper has always been one of my favorite “children,” combining as it does elements of the duality of linear programming and combinatorial tools from graph theory. It may be of some interest to… Expand

The auction algorithm: A distributed relaxation method for the assignment problem

- Mathematics
- 1988

We propose a massively parallelizable algorithm for the classical assignment problem. The algorithm operates like an auction whereby unassigned persons bid simultaneously for objects thereby raising… Expand

Assignment Problems

- Computer Science
- IFIP Congress: Fundamentals - Foundations of Computer Science
- 1998

This book provides a comprehensive treatment of assignment problems from their conceptual beginnings in the 1920s through present-day theoretical, algorithmic, and practical developments and can serve as a text for advanced courses in discrete mathematics, integer programming, combinatorial optimization, and algorithmic computer science. Expand

Combinatorial optimization. Polyhedra and efficiency.

- Computer Science
- 2003

This book shows the combinatorial optimization polyhedra and efficiency as your friend in spending the time in reading a book. Expand