#### DMCA

## 1ITLinQ: A New Approach for Spectrum Sharing in Device-to-Device Communication Systems

### Citations

3242 | The capacity of wireless networks
- Gupta, Kumar
- 1998
(Show Context)
Citation Context ...viewed as a refinement of the conventional independent set scheduling which is based on using a conflict graph to model the interference among the links (see, e.g. [12]–[16] and the protocol model in =-=[17]-=-). In the independent set scheduling approach, two links (source-destination pairs) are considered to be mutually noninterfering, hence able to transmit data at the same time, if the interference that... |

478 |
A new achievable rate region for the interference channel
- Han, Kobayashi
- 1981
(Show Context)
Citation Context ... noise is known to be suboptimal for the general interference channel and numerous more sophisticated physical-layer coding schemes (such as message splitting and successive interference cancellation =-=[19,20]-=-, interference alignment [21,22], and structured coding [23]–[25]) have been proposed in order to improve it. However, the recent result in [18] proves that under a general condition in a network cons... |

447 | Gaussian interference channel capacity to within one bit
- Etkin, Tse, et al.
- 2008
(Show Context)
Citation Context ... noise is known to be suboptimal for the general interference channel and numerous more sophisticated physical-layer coding schemes (such as message splitting and successive interference cancellation =-=[19,20]-=-, interference alignment [21,22], and structured coding [23]–[25]) have been proposed in order to improve it. However, the recent result in [18] proves that under a general condition in a network cons... |

430 | Interference alignment and the degrees of freedom for the k-user interference channel
- Cadambe, Jafar
- 2008
(Show Context)
Citation Context ... for the general interference channel and numerous more sophisticated physical-layer coding schemes (such as message splitting and successive interference cancellation [19,20], interference alignment =-=[21,22]-=-, and structured coding [23]–[25]) have been proposed in order to improve it. However, the recent result in [18] proves that under a general condition in a network consisting of multiple sourcedestina... |

349 | The Impact of Imperfect Scheduling on CrossLayer Rate Control in Multihop Wireless Networks. - Lin, Shroff - 2005 |

292 | Wireless Network Information Flow: A Deterministic Approach
- Avestimehr, Diggavi, et al.
(Show Context)
Citation Context ...ignalto-noise ratio of link i and the interference-to-noise ratio of source j at destination i, respectively. Remark. This result can intuitively be explained under the deterministic channel model of =-=[26]-=- as follows. Consider the deterministic model for link i as shown in Figure 2. In this Ti : Signal levels of Siscausing interference atsother linkssRi : Signal levels of Disreceiving interferencesfrom... |

213 | Communication over MIMO X channels: Interference alignment, decomposition, and performance analysis
- Maddah-Ali, Motahari, et al.
- 2008
(Show Context)
Citation Context ... for the general interference channel and numerous more sophisticated physical-layer coding schemes (such as message splitting and successive interference cancellation [19,20], interference alignment =-=[21,22]-=-, and structured coding [23]–[25]) have been proposed in order to improve it. However, the recent result in [18] proves that under a general condition in a network consisting of multiple sourcedestina... |

133 | The approximate capacity of the many-to-one and one-to-many Gaussian interference channels
- Bresler, Parekh, et al.
- 2010
(Show Context)
Citation Context ...hannel and numerous more sophisticated physical-layer coding schemes (such as message splitting and successive interference cancellation [19,20], interference alignment [21,22], and structured coding =-=[23]-=-–[25]) have been proposed in order to improve it. However, the recent result in [18] proves that under a general condition in a network consisting of multiple sourcedestination pairs, treating interfe... |

129 | On the complexity of scheduling in wireless networks,”
- Sharma, Mazumdar, et al.
- 2006
(Show Context)
Citation Context ...ashLinQ scheduling can also be viewed as a refinement of the conventional independent set scheduling which is based on using a conflict graph to model the interference among the links (see, e.g. [12]–=-=[16]-=- and the protocol model in [17]). In the independent set scheduling approach, two links (source-destination pairs) are considered to be mutually noninterfering, hence able to transmit data at the same... |

111 | Throughput guarantees through maximal scheduling in wireless networks,” in - Chaporkar, Kar, et al. - 2005 |

80 | Device-to-device communication as an underlay to LTEadvanced networks,” - Doppler, Rinne, et al. - 2009 |

76 |
On the Statistical Treatment of Linear Stochastic Difference Equations.
- Mann, Wald
- 1943
(Show Context)
Citation Context ... 1 ) = 1. The proof of Theorem 2 then follows immediately from Lemmas 1, 3 and 4 and also the fact that the continuous function f(x) = 1x preserves almost-sure convergence (continuous mapping theorem =-=[28]-=-). 2) Impact of Rayleigh Fading on the Capacity Analysis: One of the most important phenomena in wireless networks is the concept of channel fading. Even though fading seems to be a detrimental aspect... |

53 | Design aspects of network assisted device-to-device communications,” - Fodor, Dahlman, et al. - 2012 |

47 |
Flashlinq: A synchronous distributed scheduler for peer-topeer ad hoc networks,”
- Wu, Tavildar, et al.
- 2013
(Show Context)
Citation Context ...ivated a more recent approach that is based on a minimal level of coordination among the links which also maintains its promising performance for large numbers of links. This scheme, called FlashLinQ =-=[11]-=-, is a distributed scheduling scheme which demonstrates considerable improvement over pure CSMA/CA. In a system of multiple source-destination pairs (links), this scheduling algorithm first orders the... |

46 | Jointly optimal routing and scheduling in packet ratio networks,” - Tassiulas, Ephremides - 1992 |

36 |
Operator Controlled Device-to-Device Communications in LTE-Advanced Networks
- Lei, Zhong, et al.
- 2012
(Show Context)
Citation Context ...h functionality can also enable higher data rates and system capacity by leveraging the underlying peer-to-peer wireless network that can be created via local communication among the users (see, e.g. =-=[5]-=-– [9]). Moreover, incorporating caching capability into D2D communication networks have been shown to also significantly enhance the system throughput for applications that follow a popularity pattern... |

30 | Topological interference management through index coding - Jafar |

27 | Efficient Resource Allocation for Device-to-Device Communication Underlaying LTE Network - Zulhasnine, Huang, et al. - 2010 |

21 | Maximum weighted matching with interference constraints - Mazumar, Sharma, et al. - 2006 |

18 | The approximate sum capacity of the symmetric Gaussian K-user interference channel,” arXiv:1206.0197 - Ordentlich, Erez, et al. - 2012 |

18 | Avestimehr, “Degrees of freedom of two-hop wireless networks: “Everyone gets the entire cake
- Shomorony, S
- 2013
(Show Context)
Citation Context ...varying topology that allow links to dynamically share the spectrum might be of interest. Third, one can think about generalizing the ITLinQ scheme to multihop D2D networks. Especially, the result in =-=[32]-=- shows that coupling between interference management and relaying strategies can provide significant gains. Hence, it would be worth figuring out the performance improvement that ITLinQ is able to gua... |

14 |
ITLinQ: A new approach for spectrum sharing in device-to-device communication systems,”
- NaderiAlizadeh, Avestimehr
- 2014
(Show Context)
Citation Context ...and Verizon via the 5G project, and a gift from Qualcomm. This work has been presented in part at the IEEE International Symposium on Dynamic Spectrum Access Networks (DySPAN), McLean, VA, April 2014 =-=[1]-=- and will also be presented in part at the IEEE International Symposium on Information Theory (ISIT), Honolulu, HI, July 2014 [2]. The authors are with the Department of Electrical Engineering, Univer... |

14 | Wireless Device-to-Device Caching Networks:
- Ji, Caire, et al.
- 2013
(Show Context)
Citation Context ...rical Engineering, University of Southern California, Los Angeles, CA 90089, USA (emails: naderial@usc.edu, avestimehr@ee.usc.edu). which a few dominant videos account for a large part of the traffic =-=[10]-=-. However, considering the increasing density of mobile users in wireless networks, the problem of spectrum sharing and interference management inside D2D communication networks becomes of vital impor... |

12 |
Spectrum sharing for device-to-device communication in cellular networks
- Lin, Andrews, et al.
- 2014
(Show Context)
Citation Context ...rs is drawing considerable attention for the development of next-generation wireless communication systems. The D2D communication functionality can enable various applications and services (see, e.g. =-=[3,4]-=-), such as proximity-based applications involving discovering and communicating with nearby devices (e.g., Internet of Things). Such functionality can also enable higher data rates and system capacity... |

12 |
On achieving local view capacity via maximal independent graph scheduling,” Information Theory
- Aggarwal, Avestimehr, et al.
- 2011
(Show Context)
Citation Context ... Fourth, it would be interesting to investigate the impact of more advanced interference management techniques, such as successive interference cancellation, on ITLinQ. For example, recent results in =-=[33]-=-–[35] demonstrate that by a careful use of repetition coding at the transmitters and temporal interference neutralization at the receivers, one can achieve spectral efficiency gains that are considera... |

11 |
Worst-case additive noise in wireless networks
- Shomorony, Avestimehr
- 2013
(Show Context)
Citation Context ... communication when Rayleigh fading is also included in the channel model. In this case, the faded interference may no longer be Gaussian, but we can circumvent this issue due to the recent result in =-=[29]-=-. In [29], the authors show that in a multi-user network, Gaussian noise is the worstcase additive noise in the sense that any rate tuple that can be achieved under the assumption of Gaussian noise ca... |

8 |
Interference networks with no csit: Impact of topology,” arXiv
- Naderializadeh, Avestimehr
(Show Context)
Citation Context ...th, it would be interesting to investigate the impact of more advanced interference management techniques, such as successive interference cancellation, on ITLinQ. For example, recent results in [33]–=-=[35]-=- demonstrate that by a careful use of repetition coding at the transmitters and temporal interference neutralization at the receivers, one can achieve spectral efficiency gains that are considerably b... |

7 |
On the Optimality of Treating Interference as Noise,” e-print ArXiv:1305.4610
- Geng, Naderializadeh, et al.
- 2013
(Show Context)
Citation Context ...ceiver we can achieve the entire information-theoretic capacity region of that subset of links (to within a constant gap). We use the recent optimality condition for treating interference as noise in =-=[18]-=- to provide a description of ITIS based on the channel gains among the links in the network. In fact, as we will see later, a subset of links is defined to create an ITIS if for any link in the subset... |

7 |
Jr., “Power control for D2D underlaid cellular networks: Modeling, algorithms and analysis,” Available online: http://arxiv.org/abs/1305.6161
- Lee, Lin, et al.
- 2013
(Show Context)
Citation Context ... of the scheme. However, due to the complication in implementing power control among the links in a distributed way, we disregard it in our scheme and use full power at all the transmitters. See e.g. =-=[30]-=- on power control algorithms in D2D underlaid cellular networks. As it is obvious, the complexity of our distributed signaling mechanism is completely comparable to that of the FlashLinQ algorithm. IV... |

4 | Achievable rates for K-user Gaussian interference channels
- Jafarian, Vishwanath
- 2012
(Show Context)
Citation Context ...l and numerous more sophisticated physical-layer coding schemes (such as message splitting and successive interference cancellation [19,20], interference alignment [21,22], and structured coding [23]–=-=[25]-=-) have been proposed in order to improve it. However, the recent result in [18] proves that under a general condition in a network consisting of multiple sourcedestination pairs, treating interference... |

2 |
Distance-Based Interference Coordination for Device-to-Device Communications in Cellular Networks
- Duong, Shin
- 2013
(Show Context)
Citation Context ...ctionality can also enable higher data rates and system capacity by leveraging the underlying peer-to-peer wireless network that can be created via local communication among the users (see, e.g. [5]– =-=[9]-=-). Moreover, incorporating caching capability into D2D communication networks have been shown to also significantly enhance the system throughput for applications that follow a popularity pattern, suc... |

1 |
On the Chromatic Number of Random Geometric
- Mcdiarmid, Müller
- 2011
(Show Context)
Citation Context ...ources is no larger than the threshold distance dth,n. We call the resultant graph Gn the information-theoretic conflict graph of the original network. Clearly, this graph is a random geometric graph =-=[27]-=-. To return to our original problem, note that we needed to find an upper bound on κn. The following lemma provides such an upper bound. Lemma 3. κn ≤ χ(Gn), where χ(.) denotes the chromatic number. P... |