اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدCompletion Time Minimization and Robust Power Control in Wireless Packet Networks
308
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
A wireless packet network is considered in which each user transmits a stream of packets to its destination. The transmit power of each user interferes with the transmission of all other users. A convex cost function of the completion times of the user packets is minimized by optimally allocating the users transmission power subject to their respective power constraints. At all ranges of SINR, completion time minimization can be formulated as a convex optimization problem and hence can be efficiently solved. In particular, although the feasible rate region of the wireless network is non-convex, its corresponding completion time region is shown to be convex. When channel knowledge is imperfect, robust power control is considered based on the channel fading distribution subject to outage probability constraints. The problem is shown to be convex when the fading distribution is log-concave in exponentiated channel power gains; e.g., when each user is under independent Rayleigh, Nakagami, or log-normal fading. Applying the optimization frameworks in a wireless cellular network, the average completion time is significantly reduced as compared to full power transmission.
قيم البحث
اقرأ أيضاً
We consider a new approach to power control in decentralized wireless networks, termed fractional power control (FPC). Transmission power is chosen as the current channel quality raised to an exponent -s, where s is a constant between 0 and 1. The ch
oices s = 1 and s = 0 correspond to the familiar cases of channel inversion and constant power transmission, respectively. Choosing s in (0,1) allows all intermediate policies between these two extremes to be evaluated, and we see that usually neither extreme is ideal. We derive closed-form approximations for the outage probability relative to a target SINR in a decentralized (ad hoc or unlicensed) network as well as for the resulting transmission capacity, which is the number of users/m^2 that can achieve this SINR on average. Using these approximations, which are quite accurate over typical system parameter values, we prove that using an exponent of 1/2 minimizes the outage probability, meaning that the inverse square root of the channel strength is a sensible transmit power scaling for networks with a relatively low density of interferers. We also show numerically that this choice of s is robust to a wide range of variations in the network parameters. Intuitively, s=1/2 balances between helping disadvantaged users while making sure they do not flood the network with interference.
We address the optimization of the sum rate performance in multicell interference-limited singlehop networks where access points are allowed to cooperate in terms of joint resource allocation. The resource allocation policies considered here combine
power control and user scheduling. Although very promising from a conceptual point of view, the optimization of the sum of per-link rates hinges, in principle, on tough issues such as computational complexity and the requirement for heavy receiver-to-transmitter channel information feedback across all network cells. In this paper, we show that, in fact, distributed algorithms are actually obtainable in the asymptotic regime where the numbers of users per cell is allowed to grow large. Additionally, using extreme value theory, we provide scaling laws for upper and lower bounds for the network capacity (sum of single user rates over all cells), corresponding to zero-interference and worst-case interference scenarios. We show that the scaling is either dominated by path loss statistics or by small-scale fading, depending on the regime and user location scenario. We show that upper and lower rate bounds behave in fact identically, asymptotically. This remarkable result suggests not only that distributed resource allocation is practically possible but also that the impact of multicell interference on the capacity (in terms of scaling) actually vanishes asymptotically.
In this paper, we consider a scenario where an unmanned aerial vehicle (UAV) collects data from a set of sensors on a straight line. The UAV can either cruise or hover while communicating with the sensors. The objective is to minimize the UAVs total
flight time from a starting point to a destination while allowing each sensor to successfully upload a certain amount of data using a given amount of energy. The whole trajectory is divided into non-overlapping data collection intervals, in each of which one sensor is served by the UAV. The data collection intervals, the UAVs speed and the sensors transmit powers are jointly optimized. The formulated flight time minimization problem is difficult to solve. We first show that when only one sensor is present, the sensors transmit power follows a water-filling policy and the UAVs speed can be found efficiently by bisection search. Then, we show that for the general case with multiple sensors, the flight time minimization problem can be equivalently reformulated as a dynamic programming (DP) problem. The subproblem involved in each stage of the DP reduces to handle the case with only one sensor node. Numerical results present insightful behaviors of the UAV and the sensors. Specifically, it is observed that the UAVs optimal speed is proportional to the given energy of the sensors and the inter-sensor distance, but inversely proportional to the data upload requirement.
This paper studies an unmanned aerial vehicle (UAV)-enabled multicasting system, where a UAV is dispatched to disseminate a common file to a number of geographically distributed ground terminals (GTs). Our objective is to design the UAV trajectory to
minimize its mission completion time, while ensuring that each GT is able to successfully recover the file with a high probability required. We consider the use of practical random linear network coding (RLNC) for UAV multicasting, so that each GT is able to recover the file as long as it receives a sufficiently large number of coded packets. However, the formulated UAV trajectory optimization problem is non-convex and difficult to be directly solved. To tackle this issue, we first derive an analytical lower bound for the success probability of each GTs file recovery. Based on this result, we then reformulate the problem into a more tractable form, where the UAV trajectory only needs to be designed to meet a set of constraints each on the minimum connection time with a GT, during which their distance is below a designed threshold. We show that the optimal UAV trajectory only needs to constitute connected line segments, thus it can be obtained by determining first the optimal set of waypoints and then UAV speed along the lines connecting the waypoints. We propose practical schemes for the waypoints design based on a novel concept of virtual base station (VBS) placement and by applying convex optimization techniques. Furthermore, for given set of waypoints, we obtain the optimal UAV speed over the resulting path efficiently by solving a linear programming (LP) problem. Numerical results show that the proposed UAV-enabled multicasting with optimized trajectory design achieves significant performance gains as compared to benchmark schemes.
A fundamental challenge in wireless heterogeneous networks (HetNets) is to effectively utilize the limited transmission and storage resources in the presence of increasing deployment density and backhaul capacity constraints. To alleviate bottlenecks
and reduce resource consumption, we design optimal caching and power control algorithms for multi-hop wireless HetNets. We formulate a joint optimization framework to minimize the average transmission delay as a function of the caching variables and the signal-to-interference-plus-noise ratios (SINR) which are determined by the transmission powers, while explicitly accounting for backhaul connection costs and the power constraints. Using convex relaxation and rounding, we obtain a reduced-complexity formulation (RCF) of the joint optimization problem, which can provide a constant factor approximation to the globally optimal solution. We then solve RCF in two ways: 1) alternating optimization of the power and caching variables by leveraging biconvexity, and 2) joint optimization of power control and caching. We characterize the necessary (KKT) conditions for an optimal solution to RCF, and use strict quasi-convexity to show that the KKT points are Pareto optimal for RCF. We then devise a subgradient projection algorithm to jointly update the caching and power variables, and show that under appropriate conditions, the algorithm converges at a linear rate to the local minima of RCF, under general SINR conditions. We support our analytical findings with results from extensive numerical experiments.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
