Access control in heterogeneous multichannel wireless networks

Michael P. McGarry; Martin Reisslein; Violet Syrotiuk

doi:10.1145/1142680.1142700

Access control in heterogeneous multichannel wireless networks

Michael P. McGarry, Martin Reisslein, Violet Syrotiuk

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

1 Scopus citations

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.

Original language	English (US)
Title of host publication	ACM International Conference Proceeding Series - Proceedings of the First International Conference on Integrated Internet Ad hoc and Sensor Networks
DOIs	https://doi.org/10.1145/1142680.1142700
State	Published - 2006
Event	1st International Conference on Integrated Internet Ad hoc and Sensor Networks - Nice, France Duration: May 30 2006 → May 31 2006

Publication series

Name	ACM International Conference Proceeding Series
Volume	138

Other

Other	1st International Conference on Integrated Internet Ad hoc and Sensor Networks
Country/Territory	France
City	Nice
Period	5/30/06 → 5/31/06

ASJC Scopus subject areas

Software
Human-Computer Interaction
Computer Vision and Pattern Recognition
Computer Networks and Communications

Access to Document

10.1145/1142680.1142700

Cite this

McGarry, M. P., Reisslein, M., & Syrotiuk, V. (2006). Access control in heterogeneous multichannel wireless networks. In ACM International Conference Proceeding Series - Proceedings of the First International Conference on Integrated Internet Ad hoc and Sensor Networks Article 1142700 (ACM International Conference Proceeding Series; Vol. 138). https://doi.org/10.1145/1142680.1142700

Access control in heterogeneous multichannel wireless networks. / McGarry, Michael P.; Reisslein, Martin ; Syrotiuk, Violet.
ACM International Conference Proceeding Series - Proceedings of the First International Conference on Integrated Internet Ad hoc and Sensor Networks. 2006. 1142700 (ACM International Conference Proceeding Series; Vol. 138).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

McGarry, MP, Reisslein, M & Syrotiuk, V 2006, Access control in heterogeneous multichannel wireless networks. in ACM International Conference Proceeding Series - Proceedings of the First International Conference on Integrated Internet Ad hoc and Sensor Networks., 1142700, ACM International Conference Proceeding Series, vol. 138, 1st International Conference on Integrated Internet Ad hoc and Sensor Networks, Nice, France, 5/30/06. https://doi.org/10.1145/1142680.1142700

@inproceedings{377ed5dd54fa496d87a55f0b819bf50e,

title = "Access control in heterogeneous multichannel wireless networks",

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.",

author = "McGarry, {Michael P.} and Martin Reisslein and Violet Syrotiuk",

year = "2006",

doi = "10.1145/1142680.1142700",

language = "English (US)",

isbn = "1595934278",

series = "ACM International Conference Proceeding Series",

booktitle = "ACM International Conference Proceeding Series - Proceedings of the First International Conference on Integrated Internet Ad hoc and Sensor Networks",

note = "1st International Conference on Integrated Internet Ad hoc and Sensor Networks ; Conference date: 30-05-2006 Through 31-05-2006",

}

TY - GEN

T1 - Access control in heterogeneous multichannel wireless networks

AU - McGarry, Michael P.

AU - Reisslein, Martin

AU - Syrotiuk, Violet

PY - 2006

Y1 - 2006

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=34250771120&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34250771120&partnerID=8YFLogxK

U2 - 10.1145/1142680.1142700

DO - 10.1145/1142680.1142700

M3 - Conference contribution

AN - SCOPUS:34250771120

SN - 1595934278

SN - 9781595934277

T3 - ACM International Conference Proceeding Series

BT - ACM International Conference Proceeding Series - Proceedings of the First International Conference on Integrated Internet Ad hoc and Sensor Networks

T2 - 1st International Conference on Integrated Internet Ad hoc and Sensor Networks

Y2 - 30 May 2006 through 31 May 2006

ER -

Access control in heterogeneous multichannel wireless networks

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this