20 May 2009 in Wireless Networks
21 June 2017 in IEEE Transactions on Wireless Communications
The growing demand on data to enhance the user experience has motivated research toward increasing the efficiency of spectrum utilization by extending cellular technology, such as LTE, toward unlicensed bands. In order to study the fair coexistence of LTE and Wi-Fi, we consider the IEEE 802.11ax Wi-Fi standard, where we use stochastic geometry to model and analyze the coexistence of LTE with simultaneous uplink and downlink IEEE 802.11ax transmissions. Mainly, we consider LTE with continuous transmissions (no protocol change), LTE with discontinuous transmissions (LTE-U), and licensed-assisted access (LAA) coexistence mechanisms. In addition, we focus on single unlicensed frequency band transmissions, where the locations of Wi-Fi access points, Wi-Fi stations (users), and LTE eNodeBs (eNBs) are modeled as three independent homogeneous Poisson point processes. Then, we derive analytical expressions for a set of performance metrics, which are the medium access probability, signal-to-interference-plus-noise ratio coverage probability, density of successful transmissions, and Shannon throughput probability for both uplink and downlink of IEEE 802.11ax in addition to LTE. Our analysis quantifies both single-user and multi-user operation modes of the IEEE802.11ax and show that LTE-U or LAA can be a good neighbor for IEEE 802.11ax for different traffic types.
26 July 2019 in IEEE Transactions on Communications
In this paper, we develop a joint clustering and topological interference management (TIM) framework for a Device-to-Device (D2D) network. This scheme divides the whole network into multiple groups, each served on a different frequency, and the interference within each group is managed by TIM, based only on the connectivity pattern and not on the instantaneous channel state information (CSI). To this end, we model TIM as a low-rank-matrix-completion problem (LRMC) problem and solve it using a novel and low-complex scheme based on semidefinite programming (SDP). As for the clustering part, we develop a clustering algorithm that is suited for the LRMC approach to solve TIM, while building on the SDP relaxation of the maximum-k-cut algorithm, and extending it to account for each cluster’s capacity. This clustering problem turns out to be a capacitated maximum-k-cut problem, for which we derive relatively tight upper bound, that helps in determining the performance guarantee of many clustering algorithms. The simulation results show that the joint clustering-TIM can help, in some cases, improve the system degrees-of-freedom (DoF), especially in large D2D networks. Our proposed scheme also reduces the computation time of the LRMC-based TIM approach.
17 May 2013 in Wireless Networks
1 February 2018 in IEEE Wireless Communications Letters
This letter considers the topological interference management (TIM) problem in a partially connected network where Device-to-Device (D2D) enabled devices are not aware of the surrounding devices' channel state information but only of the network connectivity to cancel the interference occurred. We model TIM as a low-rank-matrix-completion problem and solve it using a novel scheme based on semidefinite programming while overcoming TIM matrix special structure with hard constraints. Our simulations show a matrix rank reduction ability that outperforms other existing methods, and thus corresponds to a lessening in signal interference: a key need in D2D networks.