Incremental Relaying for the Gaussian Interference Channel with a Degraded Broadcasting Relay

This paper studies incremental relay strategies for a two-user Gaussian relay-interference channel with an in-band-reception and out-of-band-transmission relay, where the link between the relay and the two receivers is modelled as a degraded broadcast channel. It is shown that generalized hash-and-forward (GHF) can achieve the capacity region of this channel to within a constant number of bits in a certain weak relay regime, where the transmitter-to-relay link gains are not unboundedly stronger than the interference links between the transmitters and the receivers. The GHF relaying strategy is ideally suited for the broadcasting relay because it can be implemented in an incremental fashion, i.e., the relay message to one receiver is a degraded version of the message to the other receiver. A generalized-degree-of-freedom (GDoF) analysis in the high signal-to-noise ratio (SNR) regime reveals that in the symmetric channel setting, each common relay bit can improve the sum rate roughly by either one bit or two bits asymptotically depending on the operating regime, and the rate gain can be interpreted as coming solely from the improvement of the common message rates, or alternatively in the very weak interference regime as solely coming from the rate improvement of the private messages. Further, this paper studies an asymmetric case in which the relay has only a single single link to one of the destinations. It is shown that with only one relay-destination link, the approximate capacity region can be established for a larger regime of channel parameters. Further, from a GDoF point of view, the sum-capacity gain due to the relay can now be thought as coming from either signal relaying only, or interference forwarding only.Comment: To appear in IEEE Trans. on Inf. Theor

Asymmetric LOCO Codes: Constrained Codes for Flash Memories

In data storage and data transmission, certain patterns are more likely to be subject to error when written (transmitted) onto the media. In magnetic recording systems with binary data and bipolar non-return-to-zero signaling, patterns that have insufficient separation between consecutive transitions exacerbate inter-symbol interference. Constrained codes are used to eliminate such error-prone patterns. A recent example is a new family of capacity-achieving constrained codes, named lexicographically-ordered constrained codes (LOCO codes). LOCO codes are symmetric, that is, the set of forbidden patterns is closed under taking pattern complements. LOCO codes are suboptimal in terms of rate when used in Flash devices where block erasure is employed since the complement of an error-prone pattern is not detrimental in these devices. This paper introduces asymmetric LOCO codes (A-LOCO codes), which are lexicographically-ordered constrained codes that forbid only those patterns that are detrimental for Flash performance. A-LOCO codes are also capacity-achieving, and at finite-lengths, they offer higher rates than the available state-of-the-art constrained codes designed for the same goal. The mapping-demapping between the index and the codeword in A-LOCO codes allows low-complexity encoding and decoding algorithms that are simpler than their LOCO counterparts.Comment: 9 pages (double column), 0 figures, accepted at the Annual Allerton Conference on Communication, Control, and Computin

Final report on the evaluation of RRM/CRRM algorithms

Deliverable public del projecte EVERESTThis deliverable provides a definition and a complete evaluation of the RRM/CRRM algorithms selected in D11 and D15, and evolved and refined on an iterative process. The evaluation will be carried out by means of simulations using the simulators provided at D07, and D14.Preprin

Stochastic Geometry Based Performance Study in 5G Wireless Networks

As the complexity of modern cellular networks continuously increases along with the evolution of technologies and the quick explosion of mobile data traffic, conventional large scale system level simulations and analytical tools become either too complicated or less tractable and accurate. Therefore, novel analytical models are actively pursued. In recent years, stochastic geometry models have been recognized as powerful tools to analyze the key performance metrics of cellular networks. In this dissertation, stochastic geometry based analytical models are developed to analyze the performance of some key technologies proposed for 5G mobile networks. Particularly, Device-to-Device (D2D) communication, Non-orthogonal multiple access (NOMA), and ultra-dense networks (UDNs) are investigated and analyzed by stochastic geometry models, more specifically, Poisson Point Process (PPP) models. D2D communication enables direct communication between mobile users in proximity to each other bypassing base station (BS). Embedding D2D communication into existing cellular networks brings many benefits such as improving spectrum efficiency, decreasing power energy consumption, and enabling novel location-based services. However, these benefits may not be fully exploited if the co-channel interference among D2D users and cellular users is not properly tackled. In this dissertation, various frequency reuse and power control schemes are proposed, aiming at mitigating the interference between D2D users and conventional cellular users. The performance gain of proposed schemes is analyzed on a system modeled by a 2-tier PPP and validated by numerical simulations. NOMA is a promising radio access technology for 5G cellular networks. Different with widely applied orthogonal multiple access (OMA) such as orthogonal frequency division multiple access (OFDMA) and single carrier frequency division multiple access (SC-FDMA), NOMA allows multiple users to use the same frequency/time resource and offers many advantages such as improving spectral efficiency, enhancing connectivity, providing higher cell-edge throughput, and reducing transmission latency. Although some initial performance analysis has been done on NOMA with single cell scenario, the system level performance of NOMA in a multi-cell scenario is not investigated in existing work. In this dissertation, analytical frameworks are developed to evaluate the performance of a wireless network with NOMA on both downlink and uplink. Distinguished from existing publications on NOMA, the framework developed in this dissertation is the first one that takes inter-cell interference into consideration. UDN is another key technology for 5G wireless networks to achieve high capacity and coverage. Due to the existence of line-of-sight (LoS)/non-line-of-sight (NLoS) propagation and bounded path loss behavior in UDN networks, the tractability of the original PPP model diminishes when analyzing the performance of UDNs. Therefore, a dominant BS (base station)-based approximation model is developed in this dissertation. By applying reasonable mathematical approximations, the tractability of the PPP model is preserved and the closed form solution can be derived. The numerical results demonstrate that the developed analytical model is accurate in a wide range of network densities. The analysis conducted in this dissertation demonstrates that stochastic geometry models can serve as powerful tools to analyze the performance of 5G technologies in a dense wireless network deployment. The frameworks developed in this dissertation provide general yet powerful analytical tools that can be readily extended to facilitate other research in wireless networks

Riemann solvers with non-ideal thermodynamics: exact, approximate, and machine learning solutions

The Riemann problem is an important topic in the numerical simulation of compressible flows, aiding the design and verification of numerical codes. A limitation of many of the existing studies is the perfect gas assumption. Over the past century, flow technology has tended toward higher pressures and temperatures such that non-ideal state equations are required along with specific heats, enthalpy, and speed of sound dependent on the full thermodynamic state. The complexity of the resulting physics has compelled researchers to compromise on rigour in favour of computational efficiency when studying non-ideal shock and expansion waves. This thesis proposes exact, approximate, and machine learning approaches that balance accuracy and computational efficiency to varying degrees when solving the Riemann problem with non-ideal thermodynamics. A longstanding challenge in the study of trans- and supercritical flows is that numerical simulations are often validated against prior numerical simulations or inappropriate ideal-gas shock tube test cases. The lack of suitable experimental data or adequate reference solutions means that existing studies face difficulties distinguishing numerical inaccuracies from the physics of the problem itself. To address these shortcomings, a novel derivation of exact solutions to shock and expansion waves with arbitrary equation of state is performed. The derivation leverages a domain mapping from space-time coordinates to characteristic wave coordinates. The solutions may be integrated into a suitable Riemann solution algorithm to produce exact reference solutions that do not require numerical integration. The study of wave structures is also pertinent to the development of practical Riemann solvers for finite volume codes, which must be computationally simple yet entropy-stable. Using the earlier derivations, the idea of structurally complete approximate Riemann solvers (StARS) is proposed. StARS provides an efficient means for analytically restoring the isentropic expansion wave to pre-existing three-wave solvers with arbitrary thermodynamics. The StARS modification is applied to a Roe scheme and shown to have improved accuracy but comparable computational speed to the popular Harten-Hyman entropy fix. Four test cases are examined: a transcritical shock tube, a shock tube with periodic bounds that produce interfering waves, a two-dimensional Riemann problem, and a gradient Riemann problem---a variant on the traditional Riemann problem featuring an initial gradient of varying slope rather than an initial step function. Additionally, a scaling analysis shows that entropy violations are most prevalent and yield the greatest errors in trans- and supercritical flows with large gradients. The final area of inquiry focuses on FluxNets, that is, learning-based Riemann solvers whose accuracy and efficiency fall in between those of exact and approximate solvers. Various approaches to the design and training of fully connected neural networks are assessed. By comparing data-driven versus physics-informed loss functions, as well as neural networks of varying size, the results show that order-of-magnitude reductions in error compared to the Roe solver can be achieved with relatively compact architectures. Numerical validation on a transcritical shock tube test case and two-dimensional Riemann problem further reveal that a physics-informed approach is critical to ensuring smoothness, generalizability, and physical consistency of the resulting numerical solutions. Additionally, parallelization can be leveraged to accelerate inference such that the significant gains in accuracy are achieved at one quarter the runtime of exact solvers. The trade-off in accuracy versus efficiency may be justified in the case of non-ideal flows where even minor errors can result in spurious oscillations and destabilized solutions

A Study about Heterogeneous Network Issues Management based on Enhanced Inter-cell Interference Coordination and Machine Learning Algorithms

Under the circumstance of fast growing demands for mobile data, Heterogeneous Networks (HetNets) has been considered as one of the key technologies to solve 1000 times mobile data challenge in the coming decade. Although the unique multi-tier topology of HetNets has achieved high spectrum efficiency and enhanced Quality of Service (QoS), it also brings a series of critical issues. In this thesis, we present an investigation on understanding the cause of HetNets challenges and provide a research on state of arts techniques to solve three major issues: interference, offloading and handover. The first issue addressed in the thesis is the cross-tier interference of HetNets. We introduce Almost Blank Subframes (ABS) to free small cell UEs from cross-tier interference, which is the key technique of enhanced Inter-Cell Interference Coordination (eICIC). Nash Bargain Solution (NBS) is applied to optimize ABS ratio and UE partition. Furthermore, we propose a power based multi-layer NBS Algorithm to obtain optimal parameters of Further enhanced Inter-cell Interference Coordination (FeICIC), which significantly improve macrocell efficiency compared to eICIC. This algorithm not only introduces dynamic power ratio but also defined opportunity cost for each layer instead of conventional zero-cost partial fairness. Simulation results show the performance of proposed algorithm may achieve up to 31.4% user throughput gain compared to eICIC and fixed power ratio FeICIC. This thesis’ second focusing issue is offloading problem of HetNets. This includes (1) UE offloading from macro cell and (2) small cell backhaul offloading. For first aspect, we have discussed the capability of machine learning algorithms tackling this challenge and propose the User-Based K-means Algorithm (UBKCA). The proposed algorithm establishes a closed loop Self-Organization system on our HetNets scenario to maintain desired offloading factor of 50%, with cell edge user factor 17.5% and CRE bias of 8dB. For second part, we further apply machine learning clustering method to establish cache system, which may achieve up to 70.27% hit-ratio and reduce request latency by 60.21% for Youtube scenario. K-Nearest Neighbouring (KNN) is then applied to predict new users’ content preference and prove our cache system’s suitability. Besides that, we have also proposed a system to predict users’ content preference even if the collected data is not complete. The third part focuses on offloading phase within HetNets. This part detailed discusses CRE’s positive effect on mitigating ping-pong handover during UE offloading, and CRE’s negative effect on increasing cross-tier interference. And then a modified Markov Chain Process is established to map the handover phases for UE to offload from macro cell to small cell and vice versa. The transition probability of MCP has considered both effects of CRE so that the optimal CRE value for HetNets can be achieved, and result for our scenario is 7dB. The combination of CRE and Handover Margin is also discussed