Distributed Greedy Scheduling for Multihop Wireless Networks

TL;DR

This paper introduces a distributed greedy scheduling algorithm for multihop wireless networks that respects interference constraints and matches the performance of centralized solutions.

Contribution

It presents a novel distributed heuristic for scheduling in multihop wireless networks that is proven to be equivalent to the centralized greedy approach.

Findings

Distributed greedy heuristic matches centralized schedule

Algorithm respects K-hop interference constraints

Efficient distributed implementation achieved

Abstract

We consider the problem of scheduling in multihop wireless networks subject to interference constraints. We consider a graph based representation of wireless networks, where scheduled links adhere to the K-hop link interference model. We develop a distributed greedy heuristic for this scheduling problem. Further, we show that this distributed greedy heuristic computes the exact same schedule as the centralized greedy heuristic.