Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userEfficient, Fair and QoS-Aware Policies for Wirelessly Powered Communication Networks
62
0
0.0
(
0
)
Added by
Roohollah Rezaei
Publication date
2019
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
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.
rate research
Read More
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.
The vision of seamlessly integrating information transfer (IT) and microwave based power transfer (PT) in the same system has led to the emergence of a new research area, called wirelessly power communications (WPC). Extensive research has been conducted on developing WPC theory and techniques, building on the extremely rich wireless communications litera- ture covering diversified topics such as transmissions, resource allocations, medium access control and network protocols and architectures. Despite these research efforts, transforming WPC from theory to practice still faces many unsolved prob- lems concerning issues such as mobile complexity, power transfer efficiency, and safety. Furthermore, the fundamental limits of WPC remain largely unknown. Recent attempts to address these open issues has resulted in the emergence of numerous new research trends in the WPC area. A few promising trends are introduced in this article. From the practical perspective, the use of backscatter antennas can support WPC for low-complexity passive devices, the design of spiky waveforms can improve the PT efficiency, and analog spatial decoupling is proposed for solving the PT-IT near-far problem in WPC. From the theoretic perspective, the fundamental limits of WPC can be quantified by leveraging recent results on super-directivity and the limit can be improved by the deployment of large-scale distributed antenna arrays. Specific research problems along these trends are discussed, whose solutions can lead to significant advancements in WPC.
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.
Assuming non-ideal circuit power consumption at the energy harvesting (EH) nodes, we propose two practical protocols that optimize the performance of the harvest-then-transmit wireless powered communication networks (WPCNs) under two different objectives: (1) proportional fair (PF) resource allocation, and (2) sum rate maximization. These objectives lead to optimal allocations for the transmit power by the base station (BS), which broadcasts RF radiation over the downlink, and optimal durations of the EH phase and the uplink information transmission phases within the dynamic time-division multiple access (TDMA) frame. Compared to the max-sum-rate protocol, the PF protocol attains a higher level of system fairness at the expense of the sum rate degradation. The PF protocol is advantageous over the max-sum-rate protocol in terms of system fairness regardless of the circuit power consumption, whereas the uplink sum rates of both protocols converge when this power consumption increases.
This paper analyzes the effective capacity of delay constrained machine type communication (MTC) networks operating in the finite blocklength regime. First, we derive a closed-form mathematical approximation for the effective capacity in quasi-static Rayleigh fading channels. We characterize the optimum error probability to maximize the concave effective capacity function with reliability constraint and study the effect of signal-to-interference-plus-noise ratio (SINR) variations for different delay constraints. The trade off between reliability and effective capacity maximization reveals that we can achieve higher reliability with limited sacrifice in effective capacity specially when the number of machines is small. Our analysis reveals that SINR variations have less impact on effective capacity for strict delay constrained networks. We present an exemplary scenario for massive MTC access to analyze the interference effect proposing three methods to restore the effective capacity for a certain node which are power control, graceful degradation of delay constraint and joint compensation. Joint compensation combines both power control and graceful degradation of delay constraint, where we perform maximization of an objective function whose parameters are determined according to delay and SINR priorities. Our results show that networks with stringent delay constraints favor power controlled compensation and compensation is generally performed at higher costs for shorter packets.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
