1,087 research outputs found
Wireless Cellular Networks
When aiming for achieving high spectral efficiency in wireless cellular networks, cochannel interference (CCI) becomes the dominant performancelimiting factor. This article provides a survey of CCI mitigation techniques, where both active and passive approaches are discussed in the context of both open- and closed-loop designs.More explicitly, we considered both the family of flexible frequency-reuse (FFR)-aided and dynamic channel allocation (DCA)-aided interference avoidance techniques as well as smart antenna-aided interference mitigation techniques, which may be classified as active approach
Opportunistic Interference Mitigation Achieves Optimal Degrees-of-Freedom in Wireless Multi-cell Uplink Networks
We introduce an opportunistic interference mitigation (OIM) protocol, where a
user scheduling strategy is utilized in -cell uplink networks with
time-invariant channel coefficients and base stations (BSs) having
antennas. Each BS opportunistically selects a set of users who generate the
minimum interference to the other BSs. Two OIM protocols are shown according to
the number of simultaneously transmitting users per cell: opportunistic
interference nulling (OIN) and opportunistic interference alignment (OIA).
Then, their performance is analyzed in terms of degrees-of-freedom (DoFs). As
our main result, it is shown that DoFs are achievable under the OIN
protocol with selected users per cell, if the total number of users in
a cell scales at least as . Similarly, it turns out that
the OIA scheme with () selected users achieves DoFs, if scales
faster than . These results indicate that there exists a
trade-off between the achievable DoFs and the minimum required . By deriving
the corresponding upper bound on the DoFs, it is shown that the OIN scheme is
DoF optimal. Finally, numerical evaluation, a two-step scheduling method, and
the extension to multi-carrier scenarios are shown.Comment: 18 pages, 3 figures, Submitted to IEEE Transactions on Communication
Rate Splitting for MIMO Wireless Networks: A Promising PHY-Layer Strategy for LTE Evolution
MIMO processing plays a central part towards the recent increase in spectral
and energy efficiencies of wireless networks. MIMO has grown beyond the
original point-to-point channel and nowadays refers to a diverse range of
centralized and distributed deployments. The fundamental bottleneck towards
enormous spectral and energy efficiency benefits in multiuser MIMO networks
lies in a huge demand for accurate channel state information at the transmitter
(CSIT). This has become increasingly difficult to satisfy due to the increasing
number of antennas and access points in next generation wireless networks
relying on dense heterogeneous networks and transmitters equipped with a large
number of antennas. CSIT inaccuracy results in a multi-user interference
problem that is the primary bottleneck of MIMO wireless networks. Looking
backward, the problem has been to strive to apply techniques designed for
perfect CSIT to scenarios with imperfect CSIT. In this paper, we depart from
this conventional approach and introduce the readers to a promising strategy
based on rate-splitting. Rate-splitting relies on the transmission of common
and private messages and is shown to provide significant benefits in terms of
spectral and energy efficiencies, reliability and CSI feedback overhead
reduction over conventional strategies used in LTE-A and exclusively relying on
private message transmissions. Open problems, impact on standard specifications
and operational challenges are also discussed.Comment: accepted to IEEE Communication Magazine, special issue on LTE
Evolutio
Information Exchange Limits in Cooperative MIMO Networks
Concurrent presence of inter-cell and intra-cell interferences constitutes a
major impediment to reliable downlink transmission in multi-cell multiuser
networks. Harnessing such interferences largely hinges on two levels of
information exchange in the network: one from the users to the base-stations
(feedback) and the other one among the base-stations (cooperation). We
demonstrate that exchanging a finite number of bits across the network, in the
form of feedback and cooperation, is adequate for achieving the optimal
capacity scaling. We also show that the average level of information exchange
is independent of the number of users in the network. This level of information
exchange is considerably less than that required by the existing coordination
strategies which necessitate exchanging infinite bits across the network for
achieving the optimal sum-rate capacity scaling. The results provided rely on a
constructive proof.Comment: 35 pages, 5 figur
Resource allocation and feedback in wireless multiuser networks
This thesis focuses on the design of algorithms for resource allocation and feedback in wireless multiuser and heterogeneous networks. In particular, three key design challenges expected to have a major impact on future wireless networks are considered: cross-layer scheduling; structured quantization codebook design for MU-MIMO networks with limited feedback; and resource allocation to provide physical layer security. The first design challenge is cross-layer scheduling, where policies are proposed for two network architectures: user scheduling in single-cell multiuser networks aided by a relay; and base station (BS) scheduling in CoMP. These scheduling policies are then analyzed to guarantee satisfaction of three performance metrics: SEP; packet delay; and packet loss probability (PLP) due to buffer overflow. The concept of the Ï„-achievable PLP region is also introduced to explicitly describe the tradeoff in PLP between different users. The second design challenge is structured quantization codebook design in wireless networks with limited feedback, for both MU-MIMO and CoMP. In the MU-MIMO network, two codebook constructions are proposed, which are based on structured transformations of a base codebook. In the CoMP network, a low-complexity construction is proposed to solve the problem of variable codebook dimensions due to changes in the number of coordinated BSs. The proposed construction is shown to have comparable performance with the standard approach based on a random search, while only requiring linear instead of exponential complexity. The final design challenge is resource allocation for physical layer security in MU-MIMO. To guarantee physical layer security, the achievable secrecy sum-rate is explicitly derived for the regularized channel inversion (RCI) precoder. To improve performance, power allocation and precoder design are jointly optimized using a new algorithm based on convex optimization techniques
Partitioning of Distributed MIMO Systems based on Overhead Considerations
Distributed-Multiple Input Multiple Output (DMIMO) networks is a promising
enabler to address the challenges of high traffic demand in future wireless
networks. A limiting factor that is directly related to the performance of
these systems is the overhead signaling required for distributing data and
control information among the network elements. In this paper, the concept of
orthogonal partitioning is extended to D-MIMO networks employing joint
multi-user beamforming, aiming to maximize the effective sum-rate, i.e., the
actual transmitted information data. Furthermore, in order to comply with
practical requirements, the overhead subframe size is considered to be
constrained. In this context, a novel formulation of constrained orthogonal
partitioning is introduced as an elegant Knapsack optimization problem, which
allows the derivation of quick and accurate solutions. Several numerical
results give insight into the capabilities of D-MIMO networks and the actual
sum-rate scaling under overhead constraints.Comment: IEEE Wireless Communications Letter
Resource allocation and feedback in wireless multiuser networks
This thesis focuses on the design of algorithms for resource allocation and feedback in wireless multiuser and heterogeneous networks. In particular, three key design challenges expected to have a major impact on future wireless networks are considered: cross-layer scheduling; structured quantization codebook design for MU-MIMO networks with limited feedback; and resource allocation to provide physical layer security. The first design challenge is cross-layer scheduling, where policies are proposed for two network architectures: user scheduling in single-cell multiuser networks aided by a relay; and base station (BS) scheduling in CoMP. These scheduling policies are then analyzed to guarantee satisfaction of three performance metrics: SEP; packet delay; and packet loss probability (PLP) due to buffer overflow. The concept of the Ï„-achievable PLP region is also introduced to explicitly describe the tradeoff in PLP between different users. The second design challenge is structured quantization codebook design in wireless networks with limited feedback, for both MU-MIMO and CoMP. In the MU-MIMO network, two codebook constructions are proposed, which are based on structured transformations of a base codebook. In the CoMP network, a low-complexity construction is proposed to solve the problem of variable codebook dimensions due to changes in the number of coordinated BSs. The proposed construction is shown to have comparable performance with the standard approach based on a random search, while only requiring linear instead of exponential complexity. The final design challenge is resource allocation for physical layer security in MU-MIMO. To guarantee physical layer security, the achievable secrecy sum-rate is explicitly derived for the regularized channel inversion (RCI) precoder. To improve performance, power allocation and precoder design are jointly optimized using a new algorithm based on convex optimization techniques
- …