Local Greedy Approximation for Scheduling in Multihop Wireless Networks

Authors:
Changhee Joo;Ness B. Shroff
Affiliations:
Korea University of Technology and Education, Cheonan;The Ohio State University, Columbus
Venue:
IEEE Transactions on Mobile Computing
Year:
2012

Citing 0
Cited 4

Distributed greedy approximation to maximum weighted independent set for scheduling with fading channels

Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing
Distributed CSMA algorithms for link scheduling in multihop MIMO networks under SINR model

IEEE/ACM Transactions on Networking (TON)
Coding- and interference-aware routing protocol in wireless networks

Computer Communications
Delay-based back-pressure scheduling in multihop wireless networks

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In recent years, there has been a significant amount of work done in developing low-complexity scheduling schemes to achieve high performance in multihop wireless networks. A centralized suboptimal scheduling policy, called Greedy Maximal Scheduling (GMS) is a good candidate because its empirically observed performance is close to optimal in a variety of network settings. However, its distributed realization requires high complexity, which becomes a major obstacle for practical implementation. In this paper, we develop simple distributed greedy algorithms for scheduling in multihop wireless networks. We reduce the complexity by relaxing the global ordering requirement of GMS, up to near zero. Simulation results show that the new algorithms approximate the performance of GMS, and outperform the state-of-the-art distributed scheduling policies.