{"title":"Quorum-based channel allocation with asymmetric channel view in cognitive radio networks","authors":"S. Romaszko, P. Mähönen","doi":"10.1145/2069087.2069097","DOIUrl":null,"url":null,"abstract":"In this paper we study a novel distributed rendezvous protocol for cognitive radio networks (CRNs), which is based on a grid quorum system, hence we call it the gQ-RDV protocol. A paper tackles with an asymmetric channel view problem rarely investigated due to its complexity. Hence, the objective of the paper is twofold. Different grid-based quorum arrangements are proposed and investigated in order to find the best approach to ensure a very high probability of nodes' rendezvous, while having a different number of available channels in the list. Second, we propose channel mapping methods based on a grid quorum and sub-grids dealing with the asymmetric channel view. Each node visits channels according to its channel map and without exchange of any information, which reduces signaling overhead.","PeriodicalId":311005,"journal":{"name":"International Workshop on Performance Monitoring, Measurement, and Evaluation of Heterogeneous Wireless and Wired Networks","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"30","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Workshop on Performance Monitoring, Measurement, and Evaluation of Heterogeneous Wireless and Wired Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2069087.2069097","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 30
Abstract
In this paper we study a novel distributed rendezvous protocol for cognitive radio networks (CRNs), which is based on a grid quorum system, hence we call it the gQ-RDV protocol. A paper tackles with an asymmetric channel view problem rarely investigated due to its complexity. Hence, the objective of the paper is twofold. Different grid-based quorum arrangements are proposed and investigated in order to find the best approach to ensure a very high probability of nodes' rendezvous, while having a different number of available channels in the list. Second, we propose channel mapping methods based on a grid quorum and sub-grids dealing with the asymmetric channel view. Each node visits channels according to its channel map and without exchange of any information, which reduces signaling overhead.