Access control in heterogeneous multichannel wireless networks

Authors:
Michael P. McGarry;Martin Reisslein;Violet R. Syrotiuk
Affiliations:
Arizona State University, Tempe, Arizona;Arizona State University, Tempe, Arizona;Arizona State University, Tempe, Arizona
Venue:
InterSense '06 Proceedings of the first international conference on Integrated internet ad hoc and sensor networks
Year:
2006

Citing 7
Cited 2

Algorithms for Scheduling Tasks on Unrelated Processors

Journal of the ACM (JACM)
Parallel Machine Scheduling by Column Generation

Operations Research
Solving Parallel Machine Scheduling Problems by Column Generation

INFORMS Journal on Computing
A New Multi-Channel MAC Protocol with On-Demand Channel Assignment for Multi-Hop Mobile Ad Hoc Networks

ISPAN '00 Proceedings of the 2000 International Symposium on Parallel Architectures, Algorithms and Networks
Multi-channel mac for ad hoc networks: handling multi-channel hidden terminals using a single transceiver

Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Ethernet PONs: a survey of dynamic bandwidth allocation (DBA) algorithms

IEEE Communications Magazine
Scheduling algorithms for multiple channel wireless local area networks

Computer Communications

The capacity of heterogeneous wireless networks

INFOCOM'10 Proceedings of the 29th conference on Information communications
A coordinated multiple channel assignment scheme and AP deployment for channel reuse in metropolitan scale wireless networks

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a multichannel wireless network architecture that supports nodes with differing multichannel capabilities. Both contention and contention-free medium access control (MAC) protocols are proposed for this heterogeneous multichannel network. In the contention MAC protocol, a new LRN control packet is defined that allows a pair of nodes to re-negotiate channel selection. This relaxes the assumption that nodes can sense the carrier on all supported channels in a short period of time. We model the scheduling problem for our contention-free MAC protocol as a weighted bipartite matching problem that minimizes the sum of the completion times with polynomial time complexity. We close with an illustration showing how the weighted bipartite matching generates a transmission schedule.