Channel-assignment and scheduling in wireless mesh networks considering switching overhead

Authors:
Mira Yun;Yu Zhou;Amrinder Arora;Hyeong-Ah Choi
Affiliations:
Department of Computer Science, George Washington University, Washington, DC;Department of Computer Science, George Washington University, Washington, DC;Department of Computer Science, Bowie State University, Bowie, MD;Department of Computer Science, George Washington University, Washington, DC
Venue:
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Year:
2009

Citing 9
Cited 1

A simple parallel algorithm for the maximal independent set problem

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Centralized channel assignment and routing algorithms for multi-channel wireless mesh networks

ACM SIGMOBILE Mobile Computing and Communications Review
SSCH: slotted seeded channel hopping for capacity improvement in IEEE 802.11 ad-hoc wireless networks

Proceedings of the 10th annual international conference on Mobile computing and networking
Capacity of multi-channel wireless networks: impact of number of channels and interfaces

Proceedings of the 11th annual international conference on Mobile computing and networking
Routing and link-layer protocols for multi-channel multi-interface ad hoc wireless networks

ACM SIGMOBILE Mobile Computing and Communications Review
Component based channel assignment in single radio, multi-channel ad hoc networks

Proceedings of the 12th annual international conference on Mobile computing and networking
The impact of imperfect scheduling on cross-layer congestion control in wireless networks

IEEE/ACM Transactions on Networking (TON)
A local greedy scheduling scheme with provable performance guarantee

Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Channel Assignment Strategies for Multiradio Wireless Mesh Networks: Issues and Solutions

IEEE Communications Magazine

Multisource video on-demand streaming in wireless mesh networks

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers the channel-assignment and scheduling in wireless mesh networks that employ multiple radios and multiple channels. In contrast to the various algorithms available in the literature, we explicitly model the delay overhead that is incurred during channel switching, and use that delay in the design of algorithms. We prove that the well known Greedy Maximal Scheduling (GMS) algorithm does not have any provable efficiency ratio when the switching overhead is considered. We present a centralized algorithm (CGSSO), and a dynamic algorithm (DMSSO), both of which consider switching overhead. Simulation results show that the proposed algorithms significantly outperform other algorithms in packet throughput and average packet delay metrics. Results also show that the improvements in performance become more pronounced as the switching delay increases.