Collaborative Data Aggregation Algorithm Considering User Preferences for Opportunistic Edge Computing

ABSTRACT In dynamic and unpredictable environments, opportunistic edge computing has emerged as a novel paradigm. It aims to leverage temporarily available computational resources to enable efficient data processing. To tackle the challenges of mobile group collaborative data aggregation in such contexts, this paper proposes a Multi‐Preference Redundant Data Collaborative Aggregation algorithm (MPRDCA), which jointly optimizes channel state and data preference weighting, and pioneers three key innovations: (a) a novel binary decision factor integrating dynamic user preferences with channel states, (b) a time‐varying utility function incorporating preference weights, and (c) Lyapunov‐based energy constraint transformation. Performance was rigorously evaluated via parameterized stochastic simulations incorporating probabilistic channel states and hierarchical preference coefficients, modeling a dynamic edge group. Key results demonstrate that under stringent energy constraints, MPRDCA achieves higher overall transmission utility while enhancing effective transmission volume of the most urgently required data by up to 41.99% compared to benchmarks. Theoretical and empirical results validate MPRDCA as a highly adaptive solution for resource‐constrained edge scenarios, achieving optimal utility‐efficiency trade‐offs.

Authors

Institutions

Publication Details

Journal
Concurrency and Computation Practice and Experience
Published
2025-11-23
DOI
https://doi.org/10.1002/cpe.70302
Primary Topic
IoT and Edge/Fog Computing
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Collaborative Data Aggregation Algorithm Considering User Preferences for Opportunistic Edge Computing

Wenhua Xiao, M. Wang, Yusong Tan, Bixin Liu
Concurrency and Computation Practice and Experience
IoT and Edge/Fog Computing
article

Collaborative Data Aggregation Algorithm Considering User Preferences for Opportunistic Edge Computing

Wenhua Xiao, M. Wang, Yusong Tan, Bixin Liu
article en

Abstract

ABSTRACT In dynamic and unpredictable environments, opportunistic edge computing has emerged as a novel paradigm. It aims to leverage temporarily available computational resources to enable efficient data processing. To tackle the challenges of mobile group collaborative data aggregation in such contexts, this paper proposes a Multi‐Preference Redundant Data Collaborative Aggregation algorithm (MPRDCA), which jointly optimizes channel state and data preference weighting, and pioneers three key innovations: (a) a novel binary decision factor integrating dynamic user preferences with channel states, (b) a time‐varying utility function incorporating preference weights, and (c) Lyapunov‐based energy constraint transformation. Performance was rigorously evaluated via parameterized stochastic simulations incorporating probabilistic channel states and hierarchical preference coefficients, modeling a dynamic edge group. Key results demonstrate that under stringent energy constraints, MPRDCA achieves higher overall transmission utility while enhancing effective transmission volume of the most urgently required data by up to 41.99% compared to benchmarks. Theoretical and empirical results validate MPRDCA as a highly adaptive solution for resource‐constrained edge scenarios, achieving optimal utility‐efficiency trade‐offs.

Concurrency and Computation Practice and ExperienceVol. 37(27-28)
PLA Information Engineering University (CN), National University of Defense Technology (CN)
Openalex Percentile: Top 58%
IoT and Edge/Fog Computing
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.