Correction to: Multi-relay selection in energy-harvesting cooperative wireless networks: game-theoretic modeling and analysis

Baidas, Mohammed W.; Alsusa, Emad; Al-Farra, Motassim; Al-Mubarak, Mubarak

doi:10.1007/s11235-019-00627-y

Cited by 1 publication

(1 citation statement)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…C. Stable and energy-efficient matching In order to match B2B pairs and user equipments, the study proposed Algorithm 2, which employs the GS method after obtaining P(m i ) and P(n k ) , ∀m i ∈ M , ∀n k ∈ N [29,30]. In the initial iteration, each m i ∈ M sends a collaboration request to its most preferred user equipment…”

Section: Definitionmentioning

confidence: 99%

Non-orthogonal multiple access-based MEC for energy-efficient task offloading in e-commerce systems

Zheng,

Tahir,

Aurangzeb

et al. 2024

J Cloud Comp

View full text Add to dashboard Cite

Mobile edge computing (MEC) reduces the latency for end users to access applications deployed at the edge by offloading tasks to the edge. With the popularity of e-commerce and the expansion of business scale, server load continues to increase, and energy efficiency issues gradually become more prominent. Computation offloading has received widespread attention as a technology that effectively reduces server load. However, how to improve energy efficiency while ensuring computing requirements is an important challenge facing computation offloading. To solve this problem, using non-orthogonal multiple access (NOMA) to increase the efficiency of multi-access wireless transmission, MEC supporting NOMA is investigated in the research. Computing resources will be divided into separate sub-computing that will be handled via e-commerce terminals or transferred to edge sides by reutilizing radio resources, we put forward a Group Switching Matching Algorithm Based on Resource Unit Allocation (GSM-RUA) algorithm that is multi-dimensional. To this end, we first formulate this task allocation problem as a long-term stochastic optimization problem, which we then convert to three short-term deterministic sub-programming problems using Lyapunov optimization, namely, radio resource allocation in a large timescale, computation resource allocating and splitting in a small-time frame. Of the 3 short-term deterministic sub-programming problems, the first sub-programming problem can be remodeled into a 1 to n matching problem, which can be solved using the block-shift-matching-based radio resource allocation method. The latter two sub-programming problems are then transformed into two continuous convex problems by relaxation and then solved easily. We then use simulations to prove that our GSM-RUA algorithm is superior to the state-of-the-art resource management algorithms in terms of energy consumption, efficiency and complexity for e-commerce scenarios.

show abstract

Section: Definitionmentioning

confidence: 99%