اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAuction-based Resource Allocation for Multi-relay Asynchronous Cooperative Networks
82
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Resource allocation is considered for cooperative transmissions in multiple-relay wireless networks. Two auction mechanisms, SNR auctions and power auctions, are proposed to distributively coordinate the allocation of power among multiple relays. In the SNR auction, a user chooses the relay with the lowest weighted price. In the power auction, a user may choose to use multiple relays simultaneously, depending on the network topology and the relays prices. Sufficient conditions for the existence (in both auctions) and uniqueness (in the SNR auction) of the Nash equilibrium are given. The fairness of the SNR auction and efficiency of the power auction are further discussed. It is also proven that users can achieve the unique Nash equilibrium distributively via best response updates in a completely asynchronous manner.
قيم البحث
اقرأ أيضاً
Cooperative transmission can greatly improve communication system performance by taking advantage of the broadcast nature of wireless channels. Most previous work on resource allocation for cooperation transmission is based on centralized control. In
this paper, we propose two share auction mechanisms, the SNR auction and the power auction, to distributively coordinate the resource allocation among users. We prove the existence, uniqueness and effectiveness of the auction results. In particular, the SNR auction leads to a fair resource allocation among users, and the power auction achieves a solution that is close to the efficient allocation.
In this paper, we study the resource allocation problem for a cooperative device-to-device (D2D)-enabled wireless caching network, where each user randomly caches popular contents to its memory and shares the contents with nearby users through D2D li
nks. To enhance the throughput of spectrum sharing D2D links, which may be severely limited by the interference among D2D links, we enable the cooperation among some of the D2D links to eliminate the interference among them. We formulate a joint link scheduling and power allocation problem to maximize the overall throughput of cooperative D2D links (CDLs) and non-cooperative D2D links (NDLs), which is NP-hard. To solve the problem, we decompose it into two subproblems that maximize the sum rates of the CDLs and the NDLs, respectively. For CDL optimization, we propose a semi-orthogonal-based algorithm for joint user scheduling and power allocation. For NDL optimization, we propose a novel low-complexity algorithm to perform link scheduling and develop a Difference of Convex functions (D.C.) programming method to solve the non-convex power allocation problem. Simulation results show that the cooperative transmission can significantly increase both the number of served users and the overall system throughput.
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.
This paper deals with the problem of multicasting a set of discrete memoryless correlated sources (DMCS) over a cooperative relay network. Necessary conditions with cut-set interpretation are presented. A emph{Joint source-Wyner-Ziv encoding/sliding
window decoding} scheme is proposed, in which decoding at each receiver is done with respect to an ordered partition of other nodes. For each ordered partition a set of feasibility constraints is derived. Then, utilizing the sub-modular property of the entropy function and a novel geometrical approach, the results of different ordered partitions are consolidated, which lead to sufficient conditions for our problem. The proposed scheme achieves operational separation between source coding and channel coding. It is shown that sufficient conditions are indeed necessary conditions in two special cooperative networks, namely, Aref network and finite-field deterministic network. Also, in Gaussian cooperative networks, it is shown that reliable transmission of all DMCS whose Slepian-Wolf region intersects the cut-set bound region within a constant number of bits, is feasible. In particular, all results of the paper are specialized to obtain an achievable rate region for cooperative relay networks which includes relay networks and two-way relay networks.
In this paper, we propose an optimal relay power allocation of an Amplify-and-Forward relay networks with non-linear power amplifiers. Based on Bussgang Linearization Theory, we depict the non-linear amplifying process into a linear system, which let
s analyzing system performance easier. To obtain spatial diversity, we design a complete practical framework of a non-linear distortion aware receiver. Consider a total relay power constraint, we propose an optimal power allocation scheme to maximum the receiver signal-to-noise ratio. Simulation results show that proposed optimal relay power allocation indeed can improve the system capacity and resist the non-linear distortion. It is also verified that the proposed transmission scheme outperforms other transmission schemes without considering non-linear distortion.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
