Congestion-aware Distributed Task Offloading in Wireless Multi-hop Networks Using Graph Neural Networks

• URL: http://arxiv.org/abs/2312.02471v2
• Date: Sun, 21 Jan 2024 19:39:12 GMT
• Title: Congestion-aware Distributed Task Offloading in Wireless Multi-hop Networks Using Graph Neural Networks
• Authors: Zhongyuan Zhao and Jake Perazzone and Gunjan Verma and Santiago Segarra
• Abstract summary: Existing offloading schemes mainly focus on mobile devices and servers, while ignoring the potential network congestion caused by tasks from multiple mobile devices. We propose a congestion-aware distributed task offloading scheme by augmenting a distributed greedy framework with graph-based machine learning. Our approach is demonstrated to be effective in reducing congestion or unstable queues under the context-agnostic baseline, while improving the execution latency over local computing.
• Score: 33.79834562046449
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Computational offloading has become an enabling component for edge intelligence in mobile and smart devices. Existing offloading schemes mainly focus on mobile devices and servers, while ignoring the potential network congestion caused by tasks from multiple mobile devices, especially in wireless multi-hop networks. To fill this gap, we propose a low-overhead, congestion-aware distributed task offloading scheme by augmenting a distributed greedy framework with graph-based machine learning. In simulated wireless multi-hop networks with 20-110 nodes and a resource allocation scheme based on shortest path routing and contention-based link scheduling, our approach is demonstrated to be effective in reducing congestion or unstable queues under the context-agnostic baseline, while improving the execution latency over local computing.

Related papers

• AI Flow at the Network Edge [58.31090055138711]
  AI Flow is a framework that streamlines the inference process by jointly leveraging the heterogeneous resources available across devices, edge nodes, and cloud servers. This article serves as a position paper for identifying the motivation, challenges, and principles of AI Flow.
  arXiv  Detail & Related papers  (2024-11-19T12:51:17Z)
• Decentralized Task Offloading and Load-Balancing for Mobile Edge Computing in Dense Networks [48.160716521203256]
  We study the problem of decentralized task offloading and load-balancing in a dense network with numerous devices and a set of edge servers. Our solution combines the mean field multi-agent multi-armed bandit (MAB) game with a load-balancing technique that adjusts the servers' rewards to achieve a target population profile.
  arXiv  Detail & Related papers  (2024-06-24T08:18:36Z)
• Graph Neural Networks for Power Allocation in Wireless Networks with Full Duplex Nodes [10.150768420975155]
  Due to mutual interference between users, power allocation problems in wireless networks are often non-trivial. Graph Graph neural networks (GNNs) have recently emerged as a promising approach tackling these problems and an approach exploits underlying topology of wireless networks.
  arXiv  Detail & Related papers  (2023-03-27T10:59:09Z)
• Artificial Intelligence Empowered Multiple Access for Ultra Reliable and Low Latency THz Wireless Networks [76.89730672544216]
  Terahertz (THz) wireless networks are expected to catalyze the beyond fifth generation (B5G) era. To satisfy the ultra-reliability and low-latency demands of several B5G applications, novel mobility management approaches are required. This article presents a holistic MAC layer approach that enables intelligent user association and resource allocation, as well as flexible and adaptive mobility management.
  arXiv  Detail & Related papers  (2022-08-17T03:00:24Z)
• Machine Learning-Based User Scheduling in Integrated Satellite-HAPS-Ground Networks [82.58968700765783]
  Integrated space-air-ground networks promise to offer a valuable solution space for empowering the sixth generation of communication networks (6G) This paper showcases the prospects of machine learning in the context of user scheduling in integrated space-air-ground communications.
  arXiv  Detail & Related papers  (2022-05-27T13:09:29Z)
• Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks [37.84368235950714]
  We propose a distributed scheme for link sparsification with graph convolutional networks (GCNs) In medium-sized wireless networks, our proposed sparse scheduler beats threshold-based sparsification policies by retaining almost $70%$ of the total capacity achieved by a greedy scheduler.
  arXiv  Detail & Related papers  (2022-03-27T16:02:12Z)
• Scalable Power Control/Beamforming in Heterogeneous Wireless Networks with Graph Neural Networks [6.631773993784724]
  We propose a novel unsupervised learning-based framework named heterogeneous interference graph neural network (HIGNN) to handle these challenges. HIGNN is scalable to wireless networks of growing sizes with robust performance after trained on small-sized networks.
  arXiv  Detail & Related papers  (2021-04-12T13:36:32Z)
• Distributed Scheduling using Graph Neural Networks [38.74504118887024]
  A fundamental problem in the design of wireless networks is to efficiently schedule transmission in a distributed manner. We propose a distributed MWIS solver based on graph convolutional networks (GCNs) In a nutshell, a trainable GCN module learns topology-aware node embeddings that are combined with the network weights before calling a greedy solver.
  arXiv  Detail & Related papers  (2020-11-18T18:00:45Z)
• Computation Offloading in Heterogeneous Vehicular Edge Networks: On-line and Off-policy Bandit Solutions [30.606518785629046]
  In a fast-varying vehicular environment, the latency in offloading arises as a result of network congestion. We propose an on-line algorithm and an off-policy learning algorithm based on bandit theory. We show that the proposed solutions adapt to the traffic changes of the network by selecting the least congested network.
  arXiv  Detail & Related papers  (2020-08-14T11:48:13Z)
• Caching Placement and Resource Allocation for Cache-Enabling UAV NOMA Networks [87.6031308969681]
  This article investigates the cache-enabling unmanned aerial vehicle (UAV) cellular networks with massive access capability supported by non-orthogonal multiple access (NOMA) We formulate the long-term caching placement and resource allocation optimization problem for content delivery delay minimization as a Markov decision process (MDP) We propose a Q-learning based caching placement and resource allocation algorithm, where the UAV learns and selects action with emphsoft $varepsilon$-greedy strategy to search for the optimal match between actions and states.
  arXiv  Detail & Related papers  (2020-08-12T08:33:51Z)
• Decentralized Learning for Channel Allocation in IoT Networks over Unlicensed Bandwidth as a Contextual Multi-player Multi-armed Bandit Game [134.88020946767404]
  We study a decentralized channel allocation problem in an ad-hoc Internet of Things network underlaying on the spectrum licensed to a primary cellular network. Our study maps this problem into a contextual multi-player, multi-armed bandit game, and proposes a purely decentralized, three-stage policy learning algorithm through trial-and-error.
  arXiv  Detail & Related papers  (2020-03-30T10:05:35Z)

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.