Residential College | false |
Status | 已發表Published |
Spectral graph theory based resource allocation for IRS-assisted multi-hop edge computing | |
Zhang, Huilian1; He, Xiaofan1; Wu, Qingqing2![]() ![]() | |
2021-05-10 | |
Conference Name | IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) |
Source Publication | IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops, INFOCOM WKSHPS 2021
![]() |
Pages | 9484578 |
Conference Date | 9 May 2021 to 12 May 2021 |
Conference Place | Vancouver, BC, Canada |
Country | Canada |
Publication Place | IEEE, 345 E 47TH ST, NEW YORK, NY 10017 USA |
Publisher | IEEE |
Abstract | 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. |
DOI | 10.1109/INFOCOMWKSHPS51825.2021.9484578 |
URL | View the original |
Indexed By | CPCI-S |
Language | 英語English |
WOS Research Area | Computer Science ; Telecommunications |
WOS Subject | Computer Science, Artificial Intelligence ; Telecommunications |
WOS ID | WOS:000844130800135 |
Scopus ID | 2-s2.0-85113332276 |
Fulltext Access | |
Citation statistics | |
Document Type | Conference paper |
Collection | THE STATE KEY LABORATORY OF INTERNET OF THINGS FOR SMART CITY (UNIVERSITY OF MACAU) |
Corresponding Author | Dai, Huaiyu |
Affiliation | 1.School of Electronic Information, Wuhan University, Wuhan 430072, China 2.State Key Laboratory of Internet of Things for Smart City, University of Macau, Macao 999078, China 3.Department of Electrical and Computer Engineering, North Carolina State University, Raleigh, NC 27606, USA |
Recommended Citation GB/T 7714 | Zhang, Huilian,He, Xiaofan,Wu, Qingqing,et al. Spectral graph theory based resource allocation for IRS-assisted multi-hop edge computing[C], IEEE, 345 E 47TH ST, NEW YORK, NY 10017 USA:IEEE, 2021, 9484578. |
APA | Zhang, Huilian., He, Xiaofan., Wu, Qingqing., & Dai, Huaiyu (2021). Spectral graph theory based resource allocation for IRS-assisted multi-hop edge computing. IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops, INFOCOM WKSHPS 2021, 9484578. |
Files in This Item: | There are no files associated with this item. |
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment