Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userOn Tractability Aspects of Optimal Resource Allocation in OFDMA Systems
210
0
0.0
(
0
)
Added by
Di Yuan Ph.D.
Publication date
2011
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
Joint channel and rate allocation with power minimization in orthogonal frequency-division multiple access (OFDMA) has attracted extensive attention. Most of the research has dealt with the development of sub-optimal but low-complexity algorithms. In this paper, the contributions comprise new insights from revisiting tractability aspects of computing optimum. Previous complexity analyses have been limited by assumptions of fixed power on each subcarrier, or power-rate functions that locally grow arbitrarily fast. The analysis under the former assumption does not generalize to problem tractability with variable power, whereas the latter assumption prohibits the result from being applicable to well-behaved power-rate functions. As the first contribution, we overcome the previous limitations by rigorously proving the problems NP-hardness for the representative logarithmic rate function. Next, we extend the proof to reach a much stronger result, namely that the problem remains NP-hard, even if the channels allocated to each user is restricted to a consecutive block with given size. We also prove that, under these restrictions, there is a special case with polynomial-time tractability. Then, we treat the problem class where the channels can be partitioned into an arbitrarily large but constant number of groups, each having uniform gain for every individual user. For this problem class, we present a polynomial-time algorithm and prove optimality guarantee. In addition, we prove that the recognition of this class is polynomial-time solvable.
rate research
Read More
We consider the scheduling and resource allocation problem in AP-initiated uplink OFDMA transmissions of IEEE 802.11ax networks. The uplink OFDMA resource allocation problem is known to be non-convex and difficult to solve in general. However, due to the special subcarrier allocation model of IEEE 802.11ax, the utility maximization problem involving the instantaneous rates of stations can be formulated as an assignment problem, and hence can be solved using the Hungarian method. In this paper, we address the more general problem of stochastic network utility maximization. Specifically, we maximize the utility of long-term average rates of stations subject to average rate and power constraints using Lyapunov optimization. The resulting resource allocation policies perform arbitrarily close to optimal and have polynomial time complexity. An important advantage of the proposed framework is that it can be used along with the target wake time mechanism of IEEE 802.11ax to provide guarantees on the average power consumption and/or achievable rates of stations whenever possible. Two key applications of such a design approach are power-constrained IoT networks and battery-powered sensor networks. We complement the theoretical study with computer simulations that evaluate our approach against other existing methods.
Support of real-time applications that impose strict requirements on packet loss ratio and latency is an essential feature of the next generation Wi-Fi networks. Initially introduced in the 802.11ax amendment to the Wi-Fi standard, uplink OFDMA seems to be a promising solution for supported low-latency data transmission from the numerous stations to an access point. In this paper, we study how to allocate OFDMA resources in an 802.11ax network and propose an algorithm aimed at providing the delay less than one millisecond and reliability up to 99.999% as required by numerous real-time applications. We design a resource allocation algorithm and with extensive simulation, show that it decreases delays for real-time traffic by orders of magnitude, while the throughput for non-real-time traffic is reduced insignificantly.
Multi-access edge computing (MEC) can enhance the computing capability of mobile devices, while non-orthogonal multiple access (NOMA) can provide high data rates. Combining these two strategies can effectively benefit the network with spectrum and energy efficiency. In this paper, we investigate the task delay minimization in multi-user NOMA-MEC networks, where multiple users can offload their tasks simultaneously through the same frequency band. We adopt the partial offloading policy, in which each user can partition its computation task into offloading and locally computing parts. We aim to minimize the task delay among users by optimizing their tasks partition ratios and offloading transmit power. The delay minimization problem is first formulated, and it is shown that it is a nonconvex one. By carefully investigating its structure, we transform the original problem into an equivalent quasi-convex. In this way, a bisection search iterative algorithm is proposed in order to achieve the minimum task delay. To reduce the complexity of the proposed algorithm and evaluate its optimality, we further derive closed-form expressions for the optimal task partition ratio and offloading power for the case of two-user NOMA-MEC networks. Simulations demonstrate the convergence and optimality of the proposed algorithm and the effectiveness of the closed-form analysis.
Heterogeneous wireless networks with small-cell deployments in licensed and unlicensed spectrum bands are a promising approach for expanding wireless connectivity and service. As a result, wireless service providers (SPs) are adding small-cells to augment their existing macro-cell deployments. This added flexibility complicates network management, in particular, service pricing and spectrum allocations across macro- and small-cells. Further, these decisions depend on the degree of competition among SPs. Restrictions on shared spectrum access imposed by regulators, such as low power constraints that lead to small-cell deployments, along with the investment cost needed to add small cells to an existing network, also impact strategic decisions and market efficiency. If the revenue generated by small-cells does not cover the investment cost, then there will be no deployment even if it increases social welfare. We study the implications of such spectrum constraints and investment costs on resource allocation and pricing decisions by competitive SPs, along with the associated social welfare. Our results show that while the optimal resource allocation taking constraints and investment into account can be uniquely determined, adding those features with strategic SPs can have a substantial effect on the equilibrium market structure.
In this paper, we consider a single-cell multi-user orthogonal frequency division multiple access (OFDMA) network with one unmanned aerial vehicle (UAV), which works as an amplify-and-forward relay to improve the quality-of-service (QoS) of the user equipments (UEs) in the cell edge. Aiming to improve the throughput while guaranteeing the user fairness, we jointly optimize the communication mode, subchannel allocation, power allocation, and UAV trajectory, which is an NP-hard problem. To design the UAV trajectory and resource allocation efficiently, we first decompose the problem into three subproblems, i.e., mode selection and subchannel allocation, trajectory optimization, and power allocation, and then solve these subproblems iteratively. Simulation results show that the proposed algorithm outperforms the random algorithm and the cellular scheme.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
