اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSpectral Graph Theory Based Resource Allocation for IRS-Assisted Multi-Hop Edge Computing
85
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The performance of mobile edge computing (MEC) depends critically on the quality of the wireless channels. From this viewpoint, the recently advocated intelligent reflecting surface (IRS) technique that can proactively reconfigure wireless channels is anticipated to bring unprecedented performance gain to MEC. In this paper, the problem of network throughput optimization of an IRS-assisted multi-hop MEC network is investigated, in which the phase-shifts of the IRS and the resource allocation of the relays need to be jointly optimized. However, due to the coupling among the transmission links of different hops caused by the utilization of the IRS and the complicated multi-hop network topology, it is difficult to solve the considered problem by directly applying existing optimization techniques. Fortunately, by exploiting the underlying structure of the network topology and spectral graph theory, it is shown that the network throughput can be well approximated by the second smallest eigenvalue of the network Laplacian matrix. This key finding allows us to develop an effective iterative algorithm for solving the considered problem. Numerical simulations are performed to corroborate the effectiveness of the proposed scheme.
قيم البحث
اقرأ أيضاً
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.
In this article, we consider the problem of relay assisted computation offloading (RACO), in which user A aims to share the results of computational tasks with another user B through wireless exchange over a relay platform equipped with mobile edge c
omputing capabilities, referred to as a mobile edge relay server (MERS). To support the computation offloading, we propose a hybrid relaying (HR) approach employing two orthogonal frequency bands, where the amplify-and-forward scheme is used in one band to exchange computational results, while the decode-and-forward scheme is used in the other band to transfer the unprocessed tasks. The motivation behind the proposed HR scheme for RACO is to adapt the allocation of computing and communication resources both to dynamic user requirements and to diverse computational tasks. Within this framework, we seek to minimize the weighted sum of the execution delay and the energy consumption in the RACO system by jointly optimizing the computation offloading ratio, the bandwidth allocation, the processor speeds, as well as the transmit power levels of both user $A$ and the MERS, under practical constraints on the available computing and communication resources. The resultant problem is formulated as a non-differentiable and nonconvex optimization program with highly coupled constraints. By adopting a series of transformations and introducing auxiliary variables, we first convert this problem into a more tractable yet equivalent form. We then develop an efficient iterative algorithm for its solution based on the concave-convex procedure. By exploiting the special structure of this problem, we also propose a simplified algorithm based on the inexact block coordinate descent method, with reduced computational complexity. Finally, we present numerical results that illustrate the advantages of the proposed algorithms over state-of-the-art benchmark schemes.
In this letter, we study the resource allocation for a multiuser intelligent reflecting surface (IRS)-aided simultaneous wireless information and power transfer (SWIPT) system. Specifically, a multi-antenna base station (BS) transmits energy and info
rmation signals simultaneously to multiple energy harvesting receivers (EHRs) and information decoding receivers (IDRs) assisted by an IRS. Under this setup, we introduce a multi-objective optimization (MOOP) framework to investigate the fundamental trade-off between the data sum-rate maximization and the total harvested energy maximization, by jointly optimizing the energy/information beamforming vectors at the BS and the phase shifts at the IRS. This MOOP problem is first converted to a single-objective optimization problem (SOOP) via the $epsilon$-constraint method and then solved by majorization minimization (MM) and inner approximation (IA) techniques. Simulation results unveil a non-trivial trade-off between the considered competing objectives, as well as the superior performance of the proposed scheme as compared to various baseline schemes.
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.
It is known that the capacity of the intelligent reflecting surface (IRS) aided cellular network can be effectively improved by reflecting the incident signals from the transmitter in a low-cost passive reflecting way. Nevertheless, in the actual net
work operation, the base station (BS) and IRS may belong to different operators, consequently, the IRS is reluctant to help the BS without any payment. Therefore, this paper investigates price-based reflection resource (elements) allocation strategies for an IRS-aided multiuser multiple-input and single-output (MISO) downlink communication systems, in which all transmissions over the same frequency band. Assuming that the IRS is composed with multiple modules, each of which is attached with a smart controller, thus, the states (active/idle) of module can be operated by its controller, and all controllers can be communicated with each other via fiber links. A Stackelberg game-based alternating direction method of multipliers (ADMM) is proposed to jointly optimize the transmit beamforming at the BS and the passive beamforming of the active modules. Numerical examples are presented to verify the proposed algorithm. It is shown that the proposed scheme is effective in the utilities of both the BS and IRS.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
