Distributed SINR based scheduling algorithm for multi-hop wireless networks

Authors:
Jiho Ryu;Changhee Joo;Ted Taekyoung Kwon;Ness B. Shroff;Yanghee Choi
Affiliations:
Seoul National University, Seoul, South Korea;Korea University of Technology and Education, Cheonan, South Korea;Seoul National University, Seoul, South Korea;The Ohio State University, Columbus, OH, USA;Seoul National University, Seoul, South Korea
Venue:
Proceedings of the 13th ACM international conference on Modeling, analysis, and simulation of wireless and mobile systems
Year:
2010

Citing 9
Cited 2

Scheduling algorithms for input-queued cell switches

Scheduling algorithms for input-queued cell switches
On the stability of input-queued switches with speed-up

IEEE/ACM Transactions on Networking (TON)
Wireless Communications: Principles and Practice

Wireless Communications: Principles and Practice
Stable scheduling policies for fading wireless channels

IEEE/ACM Transactions on Networking (TON)
The impact of imperfect scheduling on cross-layer congestion control in wireless networks

IEEE/ACM Transactions on Networking (TON)
A general model of wireless interference

Proceedings of the 13th annual ACM international conference on Mobile computing and networking
A local greedy scheduling scheme with provable performance guarantee

Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Q-CSMA: queue-length based CSMA/CA algorithms for achieving maximum throughput and low delay in wireless networks

INFOCOM'10 Proceedings of the 29th conference on Information communications
CSMA-based distributed scheduling in multi-hop MIMO networks under SINR model

INFOCOM'10 Proceedings of the 29th conference on Information communications

DOMINO: relative scheduling in enterprise wireless LANs

Proceedings of the ninth ACM conference on Emerging networking experiments and technologies
An experimental study of small multi-hop wireless networks using chirp spread spectrum

Wireless Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of developing high-performance distributed scheduling algorithms for multi-hop wireless networks has seen enormous interest in recent years. The problem is especially challenging when studied under a physical interference model, which requires the SINR at the receiver to be above a certain threshold for decoding success. Under such an SINR model, transmission failure may be caused by interference due to simultaneous transmissions from far away nodes, which exacerbates the difficulty in developing a distributed algorithm. In this paper, we propose a scheduling algorithm that exploits carrier sensing and show that the algorithm is not only amenable to distributed implementation, but also results in throughput optimality. Our algorithm has a feature called the "dual-state" approach, which separates the transmission schedules from the system state and can be shown to improve delay performance.