{"title":"未知大小动态网络中的信道选择","authors":"Rohit Kumar, S. Darak","doi":"10.1145/3288599.3299727","DOIUrl":null,"url":null,"abstract":"The dynamic spectrum access (DSA) algorithms aim to maximize network throughput by ensuring orthogonal channel allocation among secondary users (SUs) in cognitive radio network. Most of the existing DSA algorithms need prior knowledge of the number of active SUs and thus may not be suitable for battery operated resource constrained SU terminals in the infrastructure-less cognitive radio terminals. Another drawback of these algorithms is that they assume the static network with a fixed number of SUs in the network throughout the horizon and their extension for dynamic network in which SUs may enter or exit the network anytime is challenging. Thus, our goal is to design the DSA algorithms for the dynamic networks of unknown size.","PeriodicalId":346177,"journal":{"name":"Proceedings of the 20th International Conference on Distributed Computing and Networking","volume":"113 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Channel selection in dynamic networks of unknown size\",\"authors\":\"Rohit Kumar, S. Darak\",\"doi\":\"10.1145/3288599.3299727\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The dynamic spectrum access (DSA) algorithms aim to maximize network throughput by ensuring orthogonal channel allocation among secondary users (SUs) in cognitive radio network. Most of the existing DSA algorithms need prior knowledge of the number of active SUs and thus may not be suitable for battery operated resource constrained SU terminals in the infrastructure-less cognitive radio terminals. Another drawback of these algorithms is that they assume the static network with a fixed number of SUs in the network throughout the horizon and their extension for dynamic network in which SUs may enter or exit the network anytime is challenging. Thus, our goal is to design the DSA algorithms for the dynamic networks of unknown size.\",\"PeriodicalId\":346177,\"journal\":{\"name\":\"Proceedings of the 20th International Conference on Distributed Computing and Networking\",\"volume\":\"113 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-01-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 20th International Conference on Distributed Computing and Networking\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3288599.3299727\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 20th International Conference on Distributed Computing and Networking","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3288599.3299727","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Channel selection in dynamic networks of unknown size
The dynamic spectrum access (DSA) algorithms aim to maximize network throughput by ensuring orthogonal channel allocation among secondary users (SUs) in cognitive radio network. Most of the existing DSA algorithms need prior knowledge of the number of active SUs and thus may not be suitable for battery operated resource constrained SU terminals in the infrastructure-less cognitive radio terminals. Another drawback of these algorithms is that they assume the static network with a fixed number of SUs in the network throughout the horizon and their extension for dynamic network in which SUs may enter or exit the network anytime is challenging. Thus, our goal is to design the DSA algorithms for the dynamic networks of unknown size.