File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Edge Computing for Metaverse: Incentive Mechanism versus Semantic Communication

TitleEdge Computing for Metaverse: Incentive Mechanism versus Semantic Communication
Authors
KeywordsEdge computing
incentive mechanism
Metaverse
optimal auction
semantic communication
Issue Date2024
Citation
IEEE Transactions on Mobile Computing, 2024, v. 23, n. 5, p. 6196-6211 How to Cite?
AbstractWe investigate incentive mechanism designs for edge computing trading between virtual service providers (VSPs) and an edge computing provider (ECP). The VSPs deploy unmanned aerial vehicles (UAVs) to collect sensing data from physical objects for updating their digital twins (DTs). In the case with a single computing unit, we design a deep learning (DL)-based auction constructed from the Myerson theorem to maximize the ECP's revenue and guarantee incentive compatibility (IC) and individual rationality (IR). In the case of multiple computing units, a DL-based auction based on an augmented Lagrangian method is proposed that maximizes the ECP's revenue and guarantees IC, IR, and budget (BG) constraints. A semantic communication (SemCom) technique is employed to reduce the collected data and offloading cost for the VSPs. To train the deep learning algorithms, we use valuations of the computing resources to the VSPs, which particularly are a function of the age of DT, semantic symbol size, and communication time of the UAVs. We provide numerical results showing that the proposed auctions outperform the classical auctions in terms of ECP's revenue, IR, IC, BG, and their ability of preventing the false bid submissions. Also, SemCom reduces the offloading cost for the VSPs.
Persistent Identifierhttp://hdl.handle.net/10722/353111
ISSN
2023 Impact Factor: 7.7
2023 SCImago Journal Rankings: 2.755
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorLuong, Nguyen Cong-
dc.contributor.authorLe Van, Thuan-
dc.contributor.authorFeng, Shaohan-
dc.contributor.authorDu, Hongyang-
dc.contributor.authorNiyato, Dusit-
dc.contributor.authorKim, Dong In-
dc.date.accessioned2025-01-13T03:02:08Z-
dc.date.available2025-01-13T03:02:08Z-
dc.date.issued2024-
dc.identifier.citationIEEE Transactions on Mobile Computing, 2024, v. 23, n. 5, p. 6196-6211-
dc.identifier.issn1536-1233-
dc.identifier.urihttp://hdl.handle.net/10722/353111-
dc.description.abstractWe investigate incentive mechanism designs for edge computing trading between virtual service providers (VSPs) and an edge computing provider (ECP). The VSPs deploy unmanned aerial vehicles (UAVs) to collect sensing data from physical objects for updating their digital twins (DTs). In the case with a single computing unit, we design a deep learning (DL)-based auction constructed from the Myerson theorem to maximize the ECP's revenue and guarantee incentive compatibility (IC) and individual rationality (IR). In the case of multiple computing units, a DL-based auction based on an augmented Lagrangian method is proposed that maximizes the ECP's revenue and guarantees IC, IR, and budget (BG) constraints. A semantic communication (SemCom) technique is employed to reduce the collected data and offloading cost for the VSPs. To train the deep learning algorithms, we use valuations of the computing resources to the VSPs, which particularly are a function of the age of DT, semantic symbol size, and communication time of the UAVs. We provide numerical results showing that the proposed auctions outperform the classical auctions in terms of ECP's revenue, IR, IC, BG, and their ability of preventing the false bid submissions. Also, SemCom reduces the offloading cost for the VSPs.-
dc.languageeng-
dc.relation.ispartofIEEE Transactions on Mobile Computing-
dc.subjectEdge computing-
dc.subjectincentive mechanism-
dc.subjectMetaverse-
dc.subjectoptimal auction-
dc.subjectsemantic communication-
dc.titleEdge Computing for Metaverse: Incentive Mechanism versus Semantic Communication-
dc.typeArticle-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1109/TMC.2023.3317092-
dc.identifier.scopuseid_2-s2.0-85173033650-
dc.identifier.volume23-
dc.identifier.issue5-
dc.identifier.spage6196-
dc.identifier.epage6211-
dc.identifier.eissn1558-0660-
dc.identifier.isiWOS:001198016900002-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats