Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userEfficient Interference Management Policies for Femtocell Networks
116
0
0.0
(
0
)
Added by
Kartik Ahuja
Publication date
2015
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
Managing interference in a network of macrocells underlaid with femtocells presents an important, yet challenging problem. A majority of spatial (frequency/time) reuse based approaches partition the users based on coloring the interference graph, which is shown to be suboptimal. Some spatial time reuse based approaches schedule the maximal independent sets (MISs) in a cyclic, (weighted) round-robin fashion, which is inefficient for delay-sensitive applications. Our proposed policies schedule the MISs in a non-cyclic fashion, which aim to optimize any given network performance criterion for delay-sensitive applications while fulfilling minimum throughput requirements of the users. Importantly, we do not take the interference graph as given as in existing works; we propose an optimal construction of the interference graph. We prove that under certain conditions, the proposed policy achieves the optimal network performance. For large networks, we propose a low-complexity algorithm for computing the proposed policy. We show that the policy computed achieves a constant competitive ratio (with respect to the optimal network performance), which is independent of the network size, under wide range of deployment scenarios. The policy can be implemented in a decentralized manner by the users. Compared to the existing policies, our proposed policies can achieve improvement of up to 130 % in large-scale deployments.
rate research
Read More
We study the problem of interference management in large-scale small cell networks, where each user equipment (UE) needs to determine in a distributed manner when and at what power level it should transmit to its serving small cell base station (SBS) such that a given network performance criterion is maximized subject to minimum quality of service (QoS) requirements by the UEs. We first propose a distributed algorithm for the UE-SBS pairs to find a subset of weakly interfering UE-SBS pairs, namely the maximal independent sets (MISs) of the interference graph in logarithmic time (with respect to the number of UEs). Then we propose a novel problem formulation which enables UE-SBS pairs to determine the optimal fractions of time occupied by each MIS in a distributed manner. We analytically bound the performance of our distributed policy in terms of the competitive ratio with respect to the optimal network performance, which is obtained in a centralized manner with NP (non-deterministic polynomial time) complexity. Remarkably, the competitive ratio is independent of the network size, which guarantees scalability in terms of performance for arbitrarily large networks. Through simulations, we show that our proposed policies achieve significant performance improvements (from 150% to 700%) over the existing policies.
We study in this paper optimal control strategy for Advanced Sleep Modes (ASM) in 5G networks. ASM correspond to different levels of sleep modes ranging from deactivation of some components of the base station for several micro-seconds to switching off of almost all of them for one second or more. ASMs are made possible in 5G networks thanks to the definition of so-called lean carrier radio access which allows for configurable signaling periodicities. We model such a system using Markov Decision Processes (MDP) and find optimal sleep policy in terms of a trade-off between saved power consumption versus additional incurred delay for user traffic which has to wait for the network components to be woken-up and serve it. Eventually, for the system not to oscillate between sleep levels, we add a switching component in the cost function and show its impact on the energy reduction versus delay trade-off.
Wireless power transfer (WPT) is a viable source of energy for wirelessly powered communication networks (WPCNs). In this paper, we first consider WPT from an energy access point (E-AP) to multiple energy receivers (E-Rs) to obtain the optimal policy that maximizes the WPT efficiency. For this purpose, we formulate the problem of maximizing the total average received power of the E-Rs subject to the average and peak power level constraints of the E-AP. The formulated problem is a non-convex stochastic optimization problem. Using some stochastic optimization techniques, we tackle the challenges of this problem and derive a closed-form expression for the optimal solution, which requires the explicit knowledge of the distribution of channel state information (CSI) in the network. We then propose a near-optimal algorithm that does not require any explicit knowledge of the CSI distribution and prove that the proposed algorithm attains a near-optimal solution within a guaranteed gap to the optimal solution. We next consider fairness among the E-Rs and propose a quality of service (QoS) aware fair policy that maximizes a generic network utility function while guaranteeing the required QoS of each E-R. Finally, we study a practical wirelessly powered communication scenario in which the E-Rs utilize their energy harvested through WPT to transmit information to the E-AP. We optimize the received information at the E-AP under its average and peak transmission power constraints and the fairness constraints of the E-Rs. Numerical results show the significant performance of our proposed solutions compared to the state-of-the-art baselines.
In this paper, we consider the topological interference management (TIM) problem in a dynamic setting, where an adversary perturbs network topology to prevent the exploitation of sophisticated coding opportunities (e.g., interference alignment). Focusing on a special class of network topology - chordal networks - we investigate algorithmic aspects of the TIM problem under adversarial topology perturbation. In particular, given the adversarial perturbation with respect to edge insertion/deletion, we propose a dynamic graph coloring algorithm that allows for a constant number of re-coloring updates against each inserted/deleted edge to achieve the information-theoretic optimality. This is a sharp reduction of the general graph re-coloring, whose optimal number of updates scales as the size of the network, thanks to the delicate exploitation of the structural properties of weakly chordal graphs.
A simple line network model is proposed to study the downlink cellular network. Without base station cooperation, the system is interference-limited. The interference limitation is overcome when the base stations are allowed to jointly encode the user signals, but the capacity-achieving dirty paper coding scheme can be too complex for practical implementation. A new linear precoding technique called soft interference nulling (SIN) is proposed, which performs at least as well as zero-forcing (ZF) beamforming under full network coordination. Unlike ZF, SIN allows the possibility of but over-penalizes interference. The SIN precoder is computed by solving a convex optimization problem, and the formulation is extended to multiple-antenna channels. SIN can be applied when only a limited number of base stations cooperate; it is shown that SIN under partial network coordination can outperform full network coordination ZF at moderate SNRs.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
