Efficient rendezvous techniques and statistical analysis of next generation radio networks
Creators: name: ISLAM, Mohammad Tahidul
Publisher: name: RMIT University
Year: 2024
Subjects: classificationCode: 400608
subject: Wireless communication systems and technologies (incl. microwave and millimetrewave)
classificationCode: 400899
subject: Electrical engineering not elsewhere classified

description: Cognitive radio technology has shown tremendous potential to reduce spectrum paucity through its spectrum access mechanism. Effective use of the radio spectrum by the secondary user has become a substantial issue for cognitive radio communication. Upon detection of the vacant channel, consensus of the transmitter and receiver on one channel is the precondition for data transmission, which is termed 'rendezvous'. Rendezvous is needed with the vacant spectrum to be obtained in an apposite period. However, the function of having rendezvous for two nodes is not tractable in a non-centralised distributed communication network with the existence of several channels. Blind and asymmetric views of channels necessitate a substantial cost on the agreement of the transmitter and receiver for attaining a common pathway. The traditional method of calculating rendezvous time with the heuristic approach stands below the standard effectual requirements of necessity. In addition, it is essential to achieve guaranteed rendezvous within minimum time for real-time data communication in the blind milieu of the cognitive radio network. Further, in existing research, rendezvous achievement with the need for higher throughput in different applications is well behind the analysis. In this thesis, we reflect on the analysis of core criteria for ensuring successful rendezvous in distributed cognitive radio communication.

In the initial technical parts, we address a well-known semi-random sequence based rendezvous strategy in distributed cognitive radio networks and analytically characterise the performance. With various repetition rates and delays, the theoretical views of statistical propagation for the symmetric and asymmetric channels are discussed, with the promise of achieving effective rendezvous. We further analyse the mean and average rendezvous times using the distribution, and propose an improvement in the procedure under consideration. We establish the influence of statistical measurement of a particular time slot on the average time to rendezvous. In addition, the closed-form expression for the achievement of rendezvous probability is obtained and exhibited with the simulation-based result.

Following this, the random sequence-centred techniques are analysed and investigated for efficient blind rendezvous. The promising method of prime number theory is used for multi-radio rendezvous with various channel conditions. The probabilistic distribution approach of rendezvous is illustrated for different scenarios of the channel. Based on the analysis, the total rendezvous time and probability with distribution for single and multi-radio are clarified. The optimal number of resources such as the number of radios and required time slots are recognised with theoretical closed-form solutions. For the proposed framework, we elucidate the simulation results with very minimal time for a guaranteed rendezvous.

Our design for channel bonding-based rendezvous is presented in the last technical part, with the aim of gaining expected throughput. To attain rendezvous for non-deterministic network conditions, the prime number theory is used for the analysis. An investigation is performed that relies on the probabilistic perspective for an individual rendezvous time slot. Among numerous network parameters, the different grade of bonding is shown for improving throughput. The theoretical formulation and
derivation of time for ensured rendezvous are presented in this work. We describe the minimisation of rendezvous time and hence maximisation of throughput for bursty data communication requirement, ensuring other network requirements. The strong congruence between theory and simulations verifies the mathematical prosperity of our proposed idea.