{"title":"Access control in heterogeneous multichannel wireless networks","authors":"M. Mcgarry, M. Reisslein, V. Syrotiuk","doi":"10.1145/1142680.1142700","DOIUrl":null,"url":null,"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.","PeriodicalId":262714,"journal":{"name":"International Conference in Integrated Internet Ad Hoc and Sensor Networks","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference in Integrated Internet Ad Hoc and Sensor Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1142680.1142700","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8
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.