اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدNon-atomic Games for Multi-User Systems
237
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this contribution, the performance of a multi-user system is analyzed in the context of frequency selective fading channels. Using game theoretic tools, a useful framework is provided in order to determine the optimal power allocation when users know only their own channel (while perfect channel state information is assumed at the base station). We consider the realistic case of frequency selective channels for uplink CDMA. This scenario illustrates the case of decentralized schemes, where limited information on the network is available at the terminal. Various receivers are considered, namely the Matched filter, the MMSE filter and the optimum filter. The goal of this paper is to derive simple expressions for the non-cooperative Nash equilibrium as the number of mobiles becomes large and the spreading length increases. To that end two asymptotic methodologies are combined. The first is asymptotic random matrix theory which allows us to obtain explicit expressions of the impact of all other mobiles on any given tagged mobile. The second is the theory of non-atomic games which computes good approximations of the Nash equilibrium as the number of mobiles grows.
قيم البحث
اقرأ أيضاً
In this letter, a novel framework is proposed for analyzing data offloading in a multi-access edge computing system. Specifically, a two-phase algorithm, is proposed, including two key phases: user association phase and task offloading phase. In the
first phase, a ruin theory-based approach is developed to obtain the users association considering the users transmission reliability. Meanwhile, in the second phase, an optimization-based algorithm is used to optimize the data offloading process. In particular, ruin theory is used to manage the user association phase, and a ruin probability-based preference profile is considered to control the priority of proposing users. Here, ruin probability is derived by the surplus buffer space of each edge node at each time slot. Giving the association results, an optimization problem is formulated to optimize the amount of offloaded data aiming at minimizing the energy consumption of users. Simulation results show that the developed solutions guarantee system reliability under a tolerable value of surplus buffer size and minimize the total energy consumption of all users.
We investigate the joint uplink-downlink design for time-division-duplexing (TDD) and frequency-division-duplexing (FDD) multi-user systems aided by an intelligent reflecting surface (IRS). We formulate and solve a multi-objective optimization proble
m to maximize uplink and downlink rates as a weighted-sum problem (WSP) that captures the trade-off between achievable uplink and downlink rates. We propose a resource allocation design that optimizes the WSP by jointly optimizing the beamforming vectors, power control and IRS phase shifts where the same IRS configuration is used for assisting uplink and downlink transmissions. In TDD, the proposed IRS design reduces the overhead associated with IRS configuration and the need for quiet periods while updating the IRS. In addition, a joint IRS design is critical for supporting concurrent uplink and downlink transmissions in FDD. We investigate the effect of different user-weighting strategies and different parameters on the performance of the joint IRS design and the resultant uplink-downlink trade-off regions. In all FDD scenarios and some TDD scenarios, the joint design significantly outperforms the heuristic of using the IRS configuration optimized for uplink (respectively, downlink) to assist the downlink (respectively, uplink) transmissions and substantially bridges the gap to the upper bound of allowing different IRS configurations in uplink and downlink.
This paper introduces a novel approach of utilizing the reconfigurable intelligent surface (RIS) for joint data modulation and signal beamforming in a multi-user downlink cellular network by leveraging the idea of backscatter communication. We presen
t a general framework in which the RIS, referred to as modulating intelligent surface (MIS) in this paper, is used to: i) beamform the signals for a set of users whose data modulation is already performed by the base station (BS), and at the same time, ii) embed the data of a different set of users by passively modulating the deliberately sent carrier signals from the BS to the RIS. To maximize each users spectral efficiency, a joint non-convex optimization problem is formulated under the sum minimum mean-square error (MMSE) criterion. Alternating optimization is used to divide the original joint problem into two tasks of: i) separately optimizing the MIS phase-shifts for passive beamforming along with data embedding for the BS- and MIS-served users, respectively, and ii) jointly optimizing the active precoder and the receive scaling factor for the BS- and MIS-served users, respectively. While the solution to the latter joint problem is found in closed-form using traditional optimization techniques, the optimal phase-shifts at the MIS are obtained by deriving the appropriate optimization-oriented vector approximate message passing (OOVAMP) algorithm. Moreover, the original joint problem is solved under both ideal and practical constraints on the MIS phase shifts, namely, the unimodular constraint and assuming each MIS element to be terminated by a variable reactive load. The proposed MIS-assisted scheme is compared against state-of-the-art RIS-assisted wireless communication schemes and simulation results reveal that it brings substantial improvements in terms of system throughput while supporting a much higher number of users.
We consider a discrete-time nonatomic routing game with variable demand and uncertain costs. Given a routing network with single origin and destination, the cost function of each edge depends on some uncertain persistent state parameter. At every per
iod, a random traffc demand is routed through the network according to a Bayes-Wardrop equilibrium. The realized costs are publicly observed and the Bayesian belief about the state parameter is updated. We say that there is strong learning when beliefs converge to the truth and weak learning when the equilibrium flow converges to the complete-information flow. We characterize the networks for which learning occurs. We prove that these networks have a series-parallel structure and provide a counterexample to prove that the condition is necessary.
Security Games employ game theoretical tools to derive resource allocation strategies in security domains. Recent works considered the presence of alarm systems, even suffering various forms of uncertainty, and showed that disregarding alarm signals
may lead to arbitrarily bad strategies. The central problem with an alarm system, unexplored in other Security Games, is finding the best strategy to respond to alarm signals for each mobile defensive resource. The literature provides results for the basic single-resource case, showing that even in that case the problem is computationally hard. In this paper, we focus on the challenging problem of designing algorithms scaling with multiple resources. First, we focus on finding the minimum number of resources assuring non-null protection to every target. Then, we deal with the computation of multi-resource strategies with different degrees of coordination among resources. For each considered problem, we provide a computational analysis and propose algorithmic methods.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
