activity
20232026
most citedDistributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)

4 citations · 4 across the 13 of their papers we have counts for

collaborators
Showing cs.NIShow all

12 papers · 1 filter

cs.NI2026

Biased Backpressure Routing for Multihop Wireless Networks with Heterogeneous Interfaces

Yujun Ming, Zhongyuan Zhao, Fikadu Dagefu +5

Heterogeneous-interface multihop wireless networks (Het-MuNets) are emerging as a promising paradigm for tactical networks and for infrastructure-light applications such as vehicul…

cs.NI2026

Ant Backpressure Routing for Dynamic Wireless Multi-hop Networks with Mixed Traffic Patterns

Negar Erfaniantaghvayi, Zhongyuan Zhao, Kevin Chan +2

Backpressure (BP) routing and its shortest-path biased variant (SP-BP) provide powerful congestion-aware multipath resource allocation for wireless multi-hop networks, but they rel…

cs.NI2025

A Differentiable Digital Twin of Distributed Link Scheduling for Contention-Aware Networking

Zhongyuan Zhao, Yujun Ming, Kevin Chan +2

Many routing and flow optimization problems in wired networks can be solved efficiently using minimum cost flow formulations. However, this approach does not extend to wireless mul…

cs.NI2025

Link-Sharing Backpressure Routing In Wireless Multi-Hop Networks

Zhongyuan Zhao, Yujun Ming, Ananthram Swami +3

Backpressure (BP) routing and scheduling is an established resource allocation method for wireless multi-hop networks, noted for its fully distributed operation and maximum queue s…

cs.NI2025★ 4 cited

Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version)

Zhongyuan Zhao, Gunjan Verma, Ananthram Swami +1

In wireless networks characterized by dense connectivity, the significant signaling overhead generated by distributed link scheduling algorithms can exacerbate issues like congesti…

cs.NI2025

SeLR: Sparsity-enhanced Lagrangian Relaxation for Computation Offloading at the Edge

Negar Erfaniantaghvayi, Zhongyuan Zhao, Kevin Chan +2

This paper introduces a novel computational approach for offloading sensor data processing tasks to servers in edge networks for better accuracy and makespan. A task is assigned wi…

cs.NI2025

Generalizing Biased Backpressure Routing and Scheduling to Wireless Multi-hop Networks with Advanced Air-interfaces

Zhongyuan Zhao, Yujun Ming, Ananthram Swami +3

Backpressure (BP) routing and scheduling is a well-established resource allocation method for wireless multi-hop networks, known for its fully distributed operations and proven max…

cs.NI2025

Joint Task Offloading and Routing in Wireless Multi-hop Networks Using Biased Backpressure Algorithm

Zhongyuan Zhao, Jake Perazzone, Gunjan Verma +3

A significant challenge for computation offloading in wireless multi-hop networks is the complex interaction among traffic flows in the presence of interference. Existing approache…

cs.NI2024

Ant Backpressure Routing for Wireless Multi-hop Networks with Mixed Traffic Patterns

Negar Erfaniantaghvayi, Zhongyuan Zhao, Kevin Chan +3

A mixture of streaming and short-lived traffic presents a common yet challenging scenario for Backpressure routing in wireless multi-hop networks. Although state-of-the-art shortes…

cs.NI2024

Biased Backpressure Routing Using Link Features and Graph Neural Networks

Zhongyuan Zhao, Bojan Radojičić, Gunjan Verma +2

To reduce the latency of Backpressure (BP) routing in wireless multi-hop networks, we propose to enhance the existing shortest path-biased BP (SP-BP) and sojourn time-based backlog…

cs.NI2024

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

Zhongyuan Zhao, Jake Perazzone, Gunjan Verma +1

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,…

cs.NI2023

Enhanced Backpressure Routing Using Wireless Link Features

Zhongyuan Zhao, Gunjan Verma, Ananthram Swami +1

Backpressure (BP) routing is a well-established framework for distributed routing and scheduling in wireless multi-hop networks. However, the basic BP scheme suffers from poor end-…