Resource-Aware Hierarchical Federated Learning for Video Caching in Wireless Networks

• URL: http://arxiv.org/abs/2311.06918v3
• Date: Sun, 25 Feb 2024 22:51:18 GMT
• Title: Resource-Aware Hierarchical Federated Learning for Video Caching in Wireless Networks
• Authors: Md Ferdous Pervej and Andreas F Molisch
• Abstract summary: A privacy-preserving method is desirable to learn how users' demands change over time. This paper proposes a novel resource-aware hierarchical federated learning (RawHFL) solution to predict users' future content requests. Our simulation results show that the proposed solution significantly outperforms the considered baselines in terms of prediction accuracy and total energy expenditure.
• Score: 29.137803674759848
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Video caching can significantly improve backhaul traffic congestion by locally storing the popular content that users frequently request. A privacy-preserving method is desirable to learn how users' demands change over time. As such, this paper proposes a novel resource-aware hierarchical federated learning (RawHFL) solution to predict users' future content requests under the realistic assumptions that content requests are sporadic and users' datasets can only be updated based on the requested content's information. Considering a partial client participation case, we first derive the upper bound of the global gradient norm that depends on the clients' local training rounds and the successful reception of their accumulated gradients over the wireless links. Under delay, energy and radio resource constraints, we then optimize client selection and their local rounds and central processing unit (CPU) frequencies to minimize a weighted utility function that facilitates RawHFL's convergence in an energy-efficient way. Our simulation results show that the proposed solution significantly outperforms the considered baselines in terms of prediction accuracy and total energy expenditure.

Related papers

• Resource-Aware Hierarchical Federated Learning in Wireless Video Caching Networks [24.664469755746463]
  Backhaul traffic congestion caused by the video traffic of a few popular files can be alleviated by storing the to-be-requested content. We propose a novel resource-aware hierarchical federated learning (RawHFL) solution for predicting user's future content requests.
  arXiv  Detail & Related papers  (2024-02-06T18:17:02Z)
• Client Orchestration and Cost-Efficient Joint Optimization for NOMA-Enabled Hierarchical Federated Learning [55.49099125128281]
  We propose a non-orthogonal multiple access (NOMA) enabled HFL system under semi-synchronous cloud model aggregation. We show that the proposed scheme outperforms the considered benchmarks regarding HFL performance improvement and total cost reduction.
  arXiv  Detail & Related papers  (2023-11-03T13:34:44Z)
• DeePref: Deep Reinforcement Learning For Video Prefetching In Content Delivery Networks [0.06138671548064355]
  We propose DeePref, a Deep Reinforcement Learning agent for online video content prefetching in Content Delivery Networks. Our results show that DeePref DRQN, using a real-world dataset, achieves a 17% increase in prefetching accuracy and a 28% increase in prefetching coverage on average.
  arXiv  Detail & Related papers  (2023-10-11T20:45:46Z)
• Vision-based Semantic Communications for Metaverse Services: A Contest Theoretic Approach [66.10465001046762]
  In Metaverse, avatars must be updated and rendered to reflect users' behaviour. We propose a semantic communication framework to model the interactions between users and MSPs. We use the semantic communication technique to reduce the amount of data to be transmitted.
  arXiv  Detail & Related papers  (2023-08-15T07:56:33Z)
• Improving information retention in large scale online continual learning [99.73847522194549]
  Online continual learning aims to adapt efficiently to new data while retaining existing knowledge. Recent work suggests that information retention remains a problem in large scale OCL even when the replay buffer is unlimited. We propose using a moving average family of methods to improve optimization for non-stationary objectives.
  arXiv  Detail & Related papers  (2022-10-12T16:59:43Z)
• Mobility-Aware Cooperative Caching in Vehicular Edge Computing Based on Asynchronous Federated and Deep Reinforcement Learning [28.564236336847138]
  vehicular edge computing (VEC) can cache contents in different RSUs at the network edge to support the real-time vehicular applications. Traditional federated learning (FL) needs to update the global model synchronously through aggregating all users' local models to protect users' privacy. We propose a cooperative Caching scheme in the VEC based on Asynchronous Federated and deep Reinforcement learning (CAFR)
  arXiv  Detail & Related papers  (2022-08-02T03:09:08Z)
• Content Popularity Prediction in Fog-RANs: A Clustered Federated Learning Based Approach [66.31587753595291]
  We propose a novel mobility-aware popularity prediction policy, which integrates content popularities in terms of local users and mobile users. For local users, the content popularity is predicted by learning the hidden representations of local users and contents. For mobile users, the content popularity is predicted via user preference learning.
  arXiv  Detail & Related papers  (2022-06-13T03:34:00Z)
• Acceleration of Federated Learning with Alleviated Forgetting in Local Training [61.231021417674235]
  Federated learning (FL) enables distributed optimization of machine learning models while protecting privacy. We propose FedReg, an algorithm to accelerate FL with alleviated knowledge forgetting in the local training stage. Our experiments demonstrate that FedReg not only significantly improves the convergence rate of FL, especially when the neural network architecture is deep.
  arXiv  Detail & Related papers  (2022-03-05T02:31:32Z)
• Threshold-Based Data Exclusion Approach for Energy-Efficient Federated Edge Learning [4.25234252803357]
  Federated edge learning (FEEL) is a promising distributed learning technique for next-generation wireless networks. FEEL might significantly shorten energy-constrained participating devices' lifetime due to the power consumed during the model training round. This paper proposes a novel approach that endeavors to minimize computation and communication energy consumption during FEEL rounds.
  arXiv  Detail & Related papers  (2021-03-30T13:34:40Z)
• Multi-Armed Bandit Based Client Scheduling for Federated Learning [91.91224642616882]
  federated learning (FL) features ubiquitous properties such as reduction of communication overhead and preserving data privacy. In each communication round of FL, the clients update local models based on their own data and upload their local updates via wireless channels. This work provides a multi-armed bandit-based framework for online client scheduling (CS) in FL without knowing wireless channel state information and statistical characteristics of clients.
  arXiv  Detail & Related papers  (2020-07-05T12:32:32Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.