{"title":"一种新的认知无线网络多无线电交会算法","authors":"Michael Fischer, Jonathan D. Backens","doi":"10.29007/4LKQ","DOIUrl":null,"url":null,"abstract":"Channel Rendezvous between secondary users remains a key challenge to the development of cognitive ad-hoc networks. The decentralized and heterogeneous nature of ad-hoc CRNs makes guaranteeing rendezvous across multiple users within a short time difficult. Current research focuses on single hop networks or on multi-radio platforms to reduce the Time To Rendezvous (TTR). This work presents a Novel Multi-radio Rendezvous algorithm that leverages increasing availability of multi-radio secondary users to reduce TTR in heterogeneous and anonymous CRNs with multiple users.","PeriodicalId":264035,"journal":{"name":"International Conference on Computers and Their Applications","volume":"189 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Novel Multi-radio Rendezvous Algorithm for Cognitive Radio Networks\",\"authors\":\"Michael Fischer, Jonathan D. Backens\",\"doi\":\"10.29007/4LKQ\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Channel Rendezvous between secondary users remains a key challenge to the development of cognitive ad-hoc networks. The decentralized and heterogeneous nature of ad-hoc CRNs makes guaranteeing rendezvous across multiple users within a short time difficult. Current research focuses on single hop networks or on multi-radio platforms to reduce the Time To Rendezvous (TTR). This work presents a Novel Multi-radio Rendezvous algorithm that leverages increasing availability of multi-radio secondary users to reduce TTR in heterogeneous and anonymous CRNs with multiple users.\",\"PeriodicalId\":264035,\"journal\":{\"name\":\"International Conference on Computers and Their Applications\",\"volume\":\"189 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-03-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Computers and Their Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.29007/4LKQ\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Computers and Their Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.29007/4LKQ","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Novel Multi-radio Rendezvous Algorithm for Cognitive Radio Networks
Channel Rendezvous between secondary users remains a key challenge to the development of cognitive ad-hoc networks. The decentralized and heterogeneous nature of ad-hoc CRNs makes guaranteeing rendezvous across multiple users within a short time difficult. Current research focuses on single hop networks or on multi-radio platforms to reduce the Time To Rendezvous (TTR). This work presents a Novel Multi-radio Rendezvous algorithm that leverages increasing availability of multi-radio secondary users to reduce TTR in heterogeneous and anonymous CRNs with multiple users.