repository
Enhanced Adaptive Rendezvous with Interface Selection in Cognitive Radio Networks
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | Young-June Choi | - |
| dc.contributor.author | RAJIB, PAUL | - |
| dc.date.accessioned | 2018-11-08T08:17:01Z | - |
| dc.date.available | 2018-11-08T08:17:01Z | - |
| dc.date.issued | 2017-02 | - |
| dc.identifier.other | 24461 | - |
| dc.identifier.uri | https://dspace.ajou.ac.kr/handle/2018.oak/12305 | - |
| dc.description | 학위논문(박사)--아주대학교 일반대학원 :컴퓨터공학과,2017. 2 | - |
| dc.description.tableofcontents | Acknowledgements i Abstract ii Chapter 1 Introduction 1 1.1 Rendezvous . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 1.2 Radio interface Selection . . . . . . . . . . . . . . . . . . . . . . . 2 1.3 Challenges . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 1.3.1 Asynchrony . . . . . . . . . . . . . . . . . . . . . . . . . . 4 1.3.2 Anonymity . . . . . . . . . . . . . . . . . . . . . . . . . . 4 1.3.3 Asymmetry . . . . . . . . . . . . . . . . . . . . . . . . . . 4 1.3.4 Heterogeneity . . . . . . . . . . . . . . . . . . . . . . . . . 5 1.3.5 Interference . . . . . . . . . . . . . . . . . . . . . . . . . . 5 1.3.6 Energy Cost . . . . . . . . . . . . . . . . . . . . . . . . . . 5 1.4 The Contribution of Dissertation . . . . . . . . . . . . . . . . . . 5 1.4.1 EAR: Enhanced Adaptive Rendezvous . . . . . . . . . . . 6 1.4.2 V-MAC: Rendezvous MAC Protocol . . . . . . . . . . . . 6 1.4.3 Radio Interface Selection . . . . . . . . . . . . . . . . . . 7 1.5 Dissertation Roadmap . . . . . . . . . . . . . . . . . . . . . . . . 8 Chapter 2 Related Works 9 2.1 Rendezvous in Cognitive Radio . . . . . . . . . . . . . . . . . . . 9 2.1.1 Rendezvous: Literature Survey . . . . . . . . . . . . . . . 10 2.2 Radio Interface Selection . . . . . . . . . . . . . . . . . . . . . . . 15 2.2.1 User-Based Network Selection (Interface Selection) . . . . 16 2.3 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18 Chapter 3 Enhanced Adaptive Rendezvous 19 3.1 Adaptive Rendezvous with Symmetric Channel List . . . . . . . 20 3.1.1 System Model and Assumptions . . . . . . . . . . . . . . 20 3.1.2 Frame Structure of Adaptive Rendezvous . . . . . . . . . 22 3.1.3 Rendezvous Guaranteeing . . . . . . . . . . . . . . . . . . 27 3.1.4 Analysis of TTR Performance . . . . . . . . . . . . . . . . 28 3.2 Adaptive Rendezvous with Asymmetric Channel List . . . . . . . 31 3.2.1 System Model and Assumptions . . . . . . . . . . . . . . 31 3.2.2 Frame Structure for Multiple Interfaces . . . . . . . . . . 32 3.2.3 Multi-User Multi-interface Rendezvous . . . . . . . . . . . 35 3.2.4 Further Issues . . . . . . . . . . . . . . . . . . . . . . . . . 36 3.3 Performance Analysis . . . . . . . . . . . . . . . . . . . . . . . . 37 3.3.1 Two-user rendezvous . . . . . . . . . . . . . . . . . . . . . 38 3.3.2 Multi-user rendezvous . . . . . . . . . . . . . . . . . . . . 42 3.4 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 46 Chapter 4 Rendezvous MAC(V-MAC) 48 4.1 System Model and Parameters . . . . . . . . . . . . . . . . . . . 50 4.1.1 Channel Access . . . . . . . . . . . . . . . . . . . . . . . . 51 4.2 Performance Issues in Rendezvous . . . . . . . . . . . . . . . . . 52 4.2.1 Handshake Collision . . . . . . . . . . . . . . . . . . . . . 52 4.2.2 False Blocking . . . . . . . . . . . . . . . . . . . . . . . . 54 4.3 Design of the Rendezvous MAC Protocol . . . . . . . . . . . . . 55 4.3.1 Description of the Protocol . . . . . . . . . . . . . . . . . 55 4.3.2 Expected TTR in MAC Layer . . . . . . . . . . . . . . . . 61 4.4 Performance Evolution . . . . . . . . . . . . . . . . . . . . . . . . 63 4.5 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 68 Chapter 5 Radio Interface Selection 69 5.1 System Model and Game Formulation . . . . . . . . . . . . . . . 71 5.1.1 Network Model . . . . . . . . . . . . . . . . . . . . . . . . 71 5.1.2 Interference Model . . . . . . . . . . . . . . . . . . . . . . 72 5.1.3 Game Theory Concept in a Nutshell . . . . . . . . . . . . 72 5.1.4 Proposed Game Theoretic Model . . . . . . . . . . . . . . 74 5.2 Utility Function . . . . . . . . . . . . . . . . . . . . . . . . . . . . 75 5.2.1 Capacity . . . . . . . . . . . . . . . . . . . . . . . . . . . 76 5.2.2 Waiting Time . . . . . . . . . . . . . . . . . . . . . . . . . 76 5.2.3 Cost Function . . . . . . . . . . . . . . . . . . . . . . . . . 78 5.2.4 Utility Function . . . . . . . . . . . . . . . . . . . . . . . 79 5.3 Finding Nash Equilibrium . . . . . . . . . . . . . . . . . . . . . . 79 5.4 Proposed Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . 83 5.4.1 Social . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 83 5.4.2 Greedy . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 84 5.4.3 Local . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 85 5.4.4 Complexity Analysis . . . . . . . . . . . . . . . . . . . . . 85 5.5 Performance Evaluation . . . . . . . . . . . . . . . . . . . . . . . 87 5.5.1 Simulation setup . . . . . . . . . . . . . . . . . . . . . . . 88 5.5.2 Simulation Results . . . . . . . . . . . . . . . . . . . . . . 88 5.6 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 92 Chapter 6 Final Remark 95 Bibliography 98 Appendices 108 A V-HS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 108 B Publications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 115 | - |
| dc.language.iso | eng | - |
| dc.publisher | The Graduate School, Ajou University | - |
| dc.rights | 아주대학교 논문은 저작권에 의해 보호받습니다. | - |
| dc.title | Enhanced Adaptive Rendezvous with Interface Selection in Cognitive Radio Networks | - |
| dc.title.alternative | RAJIB PAUL | - |
| dc.type | Thesis | - |
| dc.contributor.affiliation | 아주대학교 일반대학원 | - |
| dc.contributor.alternativeName | RAJIB PAUL | - |
| dc.contributor.department | 일반대학원 컴퓨터공학과 | - |
| dc.date.awarded | 2017. 2 | - |
| dc.description.degree | Doctoral | - |
| dc.identifier.localId | 770669 | - |
| dc.identifier.url | http://dcoll.ajou.ac.kr:9080/dcollection/jsp/common/DcLoOrgPer.jsp?sItemId=000000024461 | - |
| dc.subject.keyword | Computer Engineering | - |
| dc.description.alternativeAbstract | Cognitive radio (CR) technology enables the opportunistic use of a portion of the licensed spectrum by CR user, while ensuring low interference to the primary user (PU) activity in a licensed band. In multi-channel wireless networks, it is compulsory to set up a control channel and exchange initial information before communication. Blind rendezvous is the fundamental challenge in cognitive radio networks (CRNs) for unknown CR users to find each other on a specific channel and establish a communication link with a selected radio interface. Rendezvous problem involves a collection of users or nodes, each of which would like to discover and communicate with the other in the collection who are within its transmission range. Two users are said to be rendezvous if they sense the presence of each other and able to communicate with an available radio interface. Blindness refers to a set of constraints on any algorithm that is to guarantee rendezvous in a typical wireless networks. 1. Users has no information about each other and has no means of coordination, 2. Users are not time synchronized, so different agents may be deployed with their clocks offset from one another by some amount, 3. Users do not have a common channel set. This means user capable of cognitive sensing decides it’s own channel list to attempt rendezvous. Modern communication devices are equipped with multiple radio interfaces and rendezvous can take advantage of this by using all available interfaces to rendezvous. But finally it has to select a radio interface to start data communication due to the typical characteristics of device. However, users can select a radio interface deterministic-ally based on different applications running on the user or required data rate to support applications. In this approach, the decision depends completely to the end users and user is responsible to exploit the best available characteristics of different radio interface with an object of increased satisfaction. The natural interpretation of satisfaction is to obtain QoS for the lowest price. Problem of this nature takes different forms in various wireless settings. This dissertation describes two blind rendezvous schemes to rendezvous and is followed by a radio interface selection mechanism to finalize communication. We have designed a rendezvous MAC protocol, V-MAC that is able to work with our proposed rendezvous schemes. We prove that the proposed algorithm provides guaranteed rendezvous and defined time-to-rendezvous (TTR) for comparison. Later we analyze radio interface selection as a non-cooperative game and proposed heuristic algorithm to choose the best-suited radio interface between rendezvoused users for the sake to communication. We have defined utility and cost function to achieve the best output. Finally, through analysis, along with simulation we show that it is possible to achieve rendezvous with a lower TTR and rendezvoused nodes can achieve higher throughput by selecting radio interface efficiently. | - |
- Appears in Collections:
- Graduate School of Ajou University > Department of Computer Engineering > 4. Theses(Ph.D)
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
-
- License
- STATISTICS
- Total Visit :3,739,147
- Total Download :1,818
- Today View :16,806
