Rendezvous in cognitive radio ad-hoc networks
| aut.embargo | No | en_NZ |
| aut.thirdpc.contains | No | en_NZ |
| aut.thirdpc.permission | No | en_NZ |
| aut.thirdpc.removed | No | en_NZ |
| dc.contributor.advisor | Sarkar, Nurul I | |
| dc.contributor.advisor | Al-Anbuky, Adnan | |
| dc.contributor.author | Hossain, Md Akbar | |
| dc.date.accessioned | 2016-04-05T23:27:10Z | |
| dc.date.available | 2016-04-05T23:27:10Z | |
| dc.date.copyright | 2015 | |
| dc.date.created | 2016 | |
| dc.date.issued | 2015 | |
| dc.date.updated | 2016-04-05T05:07:01Z | |
| dc.description.abstract | Cognitive radio (CR) is a promising technique to enhance the spectrum utilisation by enabling the CR users to opportunistic access the spectrum holes or channels. CR ad hoc network is a multi-channel environment where channel status changes over time depending on primary users’ (PUs) activities. Analogous to control channel establishment in traditional multi-channel ad hoc network, rendezvous in CR ad hoc network is one of the most important processes for a pair of unknown CR users to initiate communication. Most of the existing research have utilised a common control channel to achieve rendezvous. This utilization generates channel saturation, extreme transmission overhead of control information, and a point of vulnerability. The traditional designs for rendezvous protocols do not support an ad-hoc CR network model. Therefore, this thesis is focused on improving control channel establishment to solve the rendezvous problem and support further CR ad-hoc networks. This thesis proposes a new channel hopping (CH) scheme called extended torus quorum channel hoping (ETQCH) for asymmetric and asynchronous pair wise RDV in CR ad-hoc networks. The ETQCH employs channel ranking information for allocating more slots to high-rank channels than low-rank ones. The system dynamically updates the CH sequence by replacing channels from both the licensed and unlicensed bands to protect intermittent PUs. Channel hopping sequence scheme is a mathematical concept to guarantee overlap between two CR users. A successful RDV establishment depends on successful channel probe or control packet exchange which is a MAC layer issue. Therefore, a new MAC protocol named cognitive radio rendezvous (CR-RDV) MAC is proposed to facilitate the multiuser contention in CR ad-hoc networks. CR-RDV is developed by re-defining the traditional backooff procedure and incorporating a sensing period immediately after the request-to-send; the incumbent PU’s transmission is protected and blocking problems are resolved. The analysis and simulation results show the potential to minimise service interruption, block node problems, and efficiently utilise dynamic radio resources. The thesis also provides a guideline for CR system planners to design and deployment of dense networks with active PUs. | en_NZ |
| dc.identifier.uri | https://hdl.handle.net/10292/9658 | |
| dc.language.iso | en | en_NZ |
| dc.publisher | Auckland University of Technology | |
| dc.rights.accessrights | OpenAccess | |
| dc.subject | Rendezvous | en_NZ |
| dc.subject | Cognitive radio | en_NZ |
| dc.subject | Channel hopping | en_NZ |
| dc.subject | Medium access control | en_NZ |
| dc.subject | Quorum system | en_NZ |
| dc.subject | Channel ranking | en_NZ |
| dc.title | Rendezvous in cognitive radio ad-hoc networks | en_NZ |
| dc.type | Thesis | |
| thesis.degree.discipline | ||
| thesis.degree.grantor | Auckland University of Technology | |
| thesis.degree.grantor | Auckland University of Technology | |
| thesis.degree.level | Doctoral Theses | |
| thesis.degree.name | Doctor of Philosophy | en_NZ |