Skip to content
#edge computing Open access

Cooperative Computation for Multiuser Task Offloading in Wireless-Powered MEC Systems

Sep 2026 · Italian National Conference on Sensors · Vol 26, pp. 5568 · 0 citations · 21 references
Medicine

TL;DR

The numerical results show that the proposed joint computing-and-relaying scheme consistently outperforms computing-only, relaying-only, and dedicated-helper cooperation.

Abstract

This paper investigates joint computing and relaying for multiuser task offloading in a wireless-powered mobile edge computing (MEC) system comprising an energy node (EN), an edge server (ES), and multiple energy-harvesting users. One user is selected as the helper for the remaining task users. Each task user partitions its workload among local computing, cooperative computing at the helper, and remote execution at the ES. During a parallel cooperation stage, the helper computes one portion of the uploaded tasks locally while forwarding the remaining portion to the ES and also processes its own task through local computing or edge offloading. The weighted sum computation rate (WSCR) is maximized by jointly optimizing helper selection, task partitioning, time allocation, transmission-energy allocation, and CPU-resource allocation under frame-duration, energy-neutrality, communication, and computation constraints. For each candidate helper, transmission-energy variables are introduced to decouple transmission time and power, and the perspective structure of the achievable-rate functions is exploited to reformulate the continuous resource-allocation problem as an equivalent convex problem. By solving the convex problem for all the candidate helpers, the globally optimal helper selection and resource allocation are obtained. The numerical results show that the proposed joint computing-and-relaying scheme consistently outperforms computing-only, relaying-only, and dedicated-helper cooperation. The performance gain stems from adaptively balancing helper computing and ES processing according to the prevailing communication, computation, and energy bottlenecks.

Read PDF

Similar papers

Open access 2026

Task Offloading and Resource Allocation in Mobile Edge Computing Using Improved Deep Reinforcement Online Offloading

—Mobile Edge Computing (MEC) is a technology that enables mobile devices to transfer computationally demanding tasks to nearby servers. MEC significantly lowers the local processing load by allowing a variety of complicated mobile devices tasks to be transferred to the network system’s edge so that they can be executed...

S. Dash, Jibitesh Mishra, S. Dash et al. · 0 citations
Open access Jan 2017

WIRELESS INFORMATION AND ENERGY TRANSFER: TRADEOFF FOR FAIR RESOURCE ALLOCATION

This paper study two schemes for the fair resource allocation in wireless powered communication networks: a non-orthogonal multiple access (NOMA) scheme, and a proportional fair (PF) scheduling scheme, which significantly improve the system fairness at the expense of minor (or nonexistent) rate degradation.

Hristina Cingoska, Zoran Hadzi-Velkov, I. Nikoloska · 0 citations
#edge computing Open access Oct 2026

Lyapunov Optimization with Virtual Queues for adaptive task offloading in multi access edge computing

Multi-access edge computing (MEC) enhances the performance of resource-constrained devices by offloading computation to nearby edge servers, but simultaneously achieving energy efficiency and low latency under dynamic conditions remains challenging. This paper proposes Lyapunov Optimization with Virtual Queues (LOVQ),...

V. Verma, Pushkar, Bablu Kumar et al. · 0 citations
#edge computing Preprint Sep 2026

Delay and Throughput Analysis of Computation Offloading in Mobile Edge Computing: A Queueing Network Approach

A product-form queueing-network (PFQN) model with an approximation to capture the computation and communication dynamics of tree-structured task execution in a multi-tier MEC system is developed and results show that the proposed PFQN approximation provides accurate delay estimates.

Amirparsa Bahrami, Farid Ashtiani · 0 citations
2026

Green MEC-Enabled Cell-Free Massive MIMO: Co-Design of Power Allocation, Computation Offloading, and NOMA User Clustering

Future wireless networks demand extremely low latency and high energy efficiency to support emerging applications in industrial automation and real-time communications. This paper proposes a green mobile edge computing (MEC) enabled cell-free massive MIMO (CF-mMIMO) framework that co-designs power allocation, computati...

Tien V. Thai, Hieu V. Nguyen, C. V. Nguyen et al. · 0 citations
2026

Cost-Aware Collaborative Task Offloading in Computation Reuse-Enabled Industrial Edge Networks

Collaborative edge computing (CEC) enables edge servers to cooperatively process computation-intensive tasks from industrial Internet of Things devices, while computation reuse (CR) leverages cached task results to reduce response delay and energy consumption for similar tasks. However, existing studies fail to adequat...

Bei-Bei Zhang, Zi-Xuan He, Yan-Jing Sun et al. · 0 citations

Related blog posts

Microsoft Research Blog Oct 29, 2026

Microsoft Research Focus – Edition #97

Host Sowbhagya Suresh shares some of the latest news and cutting-edge research from across Microsoft—from understanding the challenges facing coding agents to uncovering how people use AI at work and improving extended-range weather forecasting. The post Microsoft Research Focus – Edition #97 appeared first on Microsoft Research.

MIT News · Artificial Intelligence Oct 28, 2026

Making machines that can listen

Professor Paris Smaragdis develops computers with superhuman hearing for applications like speech recognition, music understanding, and environmental monitoring.

Microsoft Research Blog Oct 21, 2026

Solving a 31-year-old grand challenge in mathematics – the KLS conjecture

For decades, a fundamental question about the difficulty of computing in high-dimensional spaces has resisted proof. New research resolves this question, removing a major theoretical obstacle to understanding the efficiency of randomized algorithms used across science and computing. The Kannan–Lovász–Simonovits (KLS) conjecture was proposed in 1995. It asks whether, for a broad class of high-dimensional […] The post Solving a 31-year-old grand challenge in mathematics – the KLS conjecture appear…

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.