Fully distributed bandit algorithm for the joint channel and rate selection problem in heterogeneous cognitive radio networks
| buir.advisor | Tekin, Cem | |
| dc.contributor.author | Javanmardi, Alireza | |
| dc.date.accessioned | 2020-12-23T07:55:26Z | |
| dc.date.available | 2020-12-23T07:55:26Z | |
| dc.date.copyright | 2020-12 | |
| dc.date.issued | 2020-12 | |
| dc.date.submitted | 2020-12-22 | |
| dc.department | Department of Electrical and Electronics Engineering | en_US |
| dc.description | Cataloged from PDF version of article. | en_US |
| dc.description | Thesis (Master's): Bilkent University, Department of Electrical and Electronics Engineering, İhsan Doğramacı Bilkent University, 2020. | en_US |
| dc.description | Includes bibliographical references (leaves 54-60). | en_US |
| dc.description.abstract | We consider the problem of the distributed sequential channel and rate selection in cognitive radio networks where multiple users choose channels from the same set of available wireless channels and pick modulation and coding schemes (corresponds to transmission rates). In order to maximize the network throughput, users need to be cooperative while communication among them is not allowed. Also, if multiple users select the same channel simultaneously, they collide, and none of them would be able to use the channel for transmission. We rigorously formulate this resource allocation problem as a multi-player multi-armed bandit problem and propose a decentralized learning algorithm called Game of Thrones with Sequential Halving Orthogonal Exploration (GoT-SHOE). The proposed algorithm keeps the number of collisions in the network as low as possible and performs almost optimal exploration of the transmission rates to speed up the learning process. We prove our learning algorithm achieves a regret with respect to the optimal allocation that grows logarithmically over rounds with a leading term that is logarithmic in the number of transmission rates. We also propose an extension of our algorithm which works when the number of users is greater than the number of channels. Moreover, we discuss that Sequential Halving Orthogonal Exploration can indeed be used with any distributed channel assignment algorithm and enhance its performance. Finally, we provide extensive simulations and compare the performance of our learning algorithm with the state-of-the-art which demonstrates the superiority of the proposed algorithm in terms of better system throughput and lower number of collisions. | en_US |
| dc.description.degree | M.S. | en_US |
| dc.description.statementofresponsibility | by Alireza Javanmardi | en_US |
| dc.embargo.release | 2021-06-30 | |
| dc.format.extent | xii, 60 leaves : charts (some color) ; 30 cm. | en_US |
| dc.identifier.itemid | B125813 | |
| dc.identifier.uri | http://hdl.handle.net/11693/54853 | |
| dc.language.iso | English | en_US |
| dc.publisher | Bilkent University | en_US |
| dc.rights | info:eu-repo/semantics/openAccess | en_US |
| dc.subject | Cognitive radio | en_US |
| dc.subject | Multi-armed bandits | en_US |
| dc.subject | Decentralized algorithms | en_US |
| dc.subject | Regret bounds | en_US |
| dc.title | Fully distributed bandit algorithm for the joint channel and rate selection problem in heterogeneous cognitive radio networks | en_US |
| dc.title.alternative | Heterojen bilişsel radyo ağlarında müşterek kanal ve oran seçimi problemi için tümüyle merkezi olmayan haydut algoritması | en_US |
| dc.type | Thesis | en_US |