Distributed Greedy Scheduling for Multihop Wireless Networks

摘要

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