Guaranteed Rendezvous for Cognitive Radio Networks Based on Cycle Length

Rendezvous is a fundamental process establishing a communication link on common channel between a pair of nodes in the cognitive radio networks. How to reach rendezvous efficiently and effectively is still an open problem. In this work, we propose a guaranteed cycle lengths based rendezvous (CLR) algorithm for cognitive radio networks. When the cycle lengths of the two nodes are coprime, the rendezvous is guaranteed within one rendezvous period considering the time skew between the two nodes. When Ti and Tj are not coprime, i.e., Ti=Tj, the deadlock checking and node IDs are combined to decide the time point and the way to independently change the cycle length on each node to guarantee rendezvous. In detail, as long as the deadlock situation is detected based on the threshold, each node can independently change its cycle length be based on the current checking bit of the node ID. The threshold used for deadlock checking is defined as the length of the maximum possible rendezvous period between the two nodes. As long as the current checking bits between the two nodes are different, the rendezvous will be reached in the following rendezvous period, The theoretical analysis also proves the guarantee of the CLR algorithm under both the two cases. We use three metrics: success rate of rendezvous, expected time to rendezvous and channel load to conduct simulation studies. The simulation results show that the CLR algorithm always has higher successful rendezvous rate of 100%, and stable and low expected time to rendezvous compared to the HH algorithm. In addition, the channel loads are smoothly distributed on all channels with CLR, while HH algorithm depends on the channels with smaller IDs

Revisiting the Performance of the Modular Clock Algorithm for Distributed Blind Rendezvous in Cognitive Radio Networks

Abstract. We reexamine the modular clock algorithm for distributed blind rendezvous in cognitive radio networks. It proceeds in rounds. Each round consists of scanning twice a block of generated channels. The modular clock algorithm inspired the creation of the jump-stay ren-dezvous algorithm. It augments the modular clock with a stay-on-one-channel pattern. This enhancement guarantees rendezvous in one round. We make the observation that as the number of channels increases, the significance of the stay-on-one-channel pattern decreases. We revisit the performance analysis of the two-user symmetric case of the modular clock algorithm. We compare its performance with a random and the jump-stay rendezvous algorithms. Let m be the number of channels. Let p be the smallest prime number greater than m. The expected time-to-rendezvous of the random and jump-stay algorithms are m and p, respectively. Theis et al.’s analysis of the modular clock algorithm con-cludes a maximum expected time-to-rendezvous slightly larger than 2p time slots. Our analysis shows that the expected time-to-rendezvous of the modular clock algorithm is no more than 3p/4 time slots.

Bootstrapping Cognitive Radio Networks

Cognitive radio networks promise more efficient spectrum utilization by leveraging degrees of freedom and distributing data collection. The actual realization of these promises is challenged by distributed control, and incomplete, uncertain and possibly conflicting knowledge bases. We consider two problems in bootstrapping, evolving, and managing cognitive radio networks. The first is Link Rendezvous, or how separate radio nodes initially find each other in a spectrum band with many degrees of freedom, and little shared knowledge. The second is how radio nodes can negotiate for spectrum access with incomplete information. To address the first problem, we present our Frequency Parallel Blind Link Rendezvous algorithm. This approach, designed for recent generations of digital front-ends, implicitly shares vague information about spectrum occupancy early in the process, speeding the progress towards a solution. Furthermore, it operates in the frequency domain, facilitating a parallel channel rendezvous. Finally, it operates without a control channel and can rendezvous anywhere in the operating band. We present simulations and analysis on the false alarm rate for both a feature detector and a cross-correlation detector. We compare our results to the conventional frequency hopping sequence rendezvous techniques. To address the second problem, we model the network as a multi-agent system and negotiate by exchanging proposals, augmented with arguments. These arguments include information about priority status and the existence of other nodes. We show in a variety of network topologies that this process leads to solutions not otherwise apparent to individual nodes, and achieves superior network throughput, request satisfaction, and total number of connections, compared to our baselines. The agents independently formulate proposals based upon communication desires, evaluate these proposals based upon capacity constraints, create ariii guments in response to proposal rejections, and re-evaluate proposals based upon received arguments. We present our negotiation rules, messages, and protocol and demonstrate how they interoperate in a simulation environment

Estimation and Coordination of Sequence Patterns for Frequency Hopping Dynamic Spectrum Access Networks

In 2010, the Shared Spectrum Company showed in a survey of Radio Frequency (RF) bands that underutilization of spectrum has resulted from current frequency management practices. Traditional frequency allocation allows large bands of licensed spectrum to remain vacant even under current high demands. Cognitive radio\u27s (CR) use of Dynamic Spectrum Access (DSA) enables better spectrum management by allowing usage in times of spectrum inactivity. This research presents the CR problem of rendezvous for fast Frequency Hopping Spread Spectrum (FHSS) networks, and examines protocols for disseminating RF environment information to coordinate spectrum usage. First, Gold\u27s algorithm is investigated as a rendezvous protocol for networks utilizing fast frequency hopping. A hardware implementation of Gold\u27s algorithm on a Virtex-5 Field Programmable Gate Array (FPGA) is constructed to determine the resource requirements and timing limitations for use in a CR. The resulting design proves functionality of the algorithm, and demonstrates a decrease in time-to-rendezvous over current methods. Once a CR network is formed, it must understand the changing environment in order to better utilize the available spectrum. This research addresses the costs a network incurs to coordinate such environment data. Three exchange protocols are introduced and evaluated via simulation to determine the best technique based on network size. The resulting comparison found that smaller networks function best with polled or timedivision based protocols where radios always share their environment information. Larger networks, on the other hand, function best when a dispute-based exchange protocol was utilized. These studies together conclude that the selection of a rendezvous algorithm or a protocol for the exchange of environment data in a CR network are determined by the characteristics of the network, and therefore their selection requires a cognitive decision

Adaptive and autonomous protocol for spectrum identification and coordination in ad hoc cognitive radio network

The decentralised structure of wireless Ad hoc networks makes them most appropriate for quick and easy deployment in military and emergency situations. Consequently, in this thesis, special interest is given to this form of network. Cognitive Radio (CR) is defined as a radio, capable of identifying its spectral environment and able to optimally adjust its transmission parameters to achieve interference free communication channel. In a CR system, Dynamic Spectrum Access (DSA) is made feasible. CR has been proposed as a candidate solution to the challenge of spectrum scarcity. CR works to solve this challenge by providing DSA to unlicensed (secondary) users. The introduction of this new and efficient spectrum management technique, the DSA, has however, opened up some challenges in this wireless Ad hoc Network of interest; the Cognitive Radio Ad Hoc Network (CRAHN). These challenges, which form the specific focus of this thesis are as follows: First, the poor performance of the existing spectrum sensing techniques in low Signal to Noise Ratio (SNR) conditions. Secondly the lack of a central coordination entity for spectrum allocation and information exchange in the CRAHN. Lastly, the existing Medium Access Control (MAC) Protocol such as the 802.11 was designed for both homogeneous spectrum usage and static spectrum allocation technique. Consequently, this thesis addresses these challenges by first developing an algorithm comprising of the Wavelet-based Scale Space Filtering (WSSF) algorithm and the Otsu's multi-threshold algorithm to form an Adaptive and Autonomous WaveletBased Scale Space Filter (AWSSF) for Primary User (PU) sensing in CR. These combined algorithms produced an enhanced algorithm that improves detection in low SNR conditions when compared to the performance of EDs and other spectrum sensing techniques in the literature. Therefore, the AWSSF met the performance requirement of the IEEE 802.22 standard as compared to other approaches and thus considered viable for application in CR. Next, a new approach for the selection of control channel in CRAHN environment using the Ant Colony System (ACS) was proposed. The algorithm reduces the complex objective of selecting control channel from an overtly large spectrum space,to a path finding problem in a graph. We use pheromone trails, proportional to channel reward, which are computed based on received signal strength and channel availability, to guide the construction of selection scheme. Simulation results revealed ACS as a feasible solution for optimal dynamic control channel selection. Finally, a new channel hopping algorithm for the selection of a control channel in CRAHN was presented. This adopted the use of the bio-mimicry concept to develop a swarm intelligence based mechanism. This mechanism guides nodes to select a common control channel within a bounded time for the purpose of establishing communication. Closed form expressions for the upper bound of the time to rendezvous (TTR) and Expected TTR (ETTR) on a common control channel were derived for various network scenarios. The algorithm further provides improved performance in comparison to the Jump-Stay and Enhanced Jump-Stay Rendezvous Algorithms. We also provided simulation results to validate our claim of improved TTR. Based on the results obtained, it was concluded that the proposed system contributes positively to the ongoing research in CRAHN

Spectrum handoff strategy for cognitive radio-based Mac in industrial wirless sensor and actuator networks

In this thesis, a Cognitive Radio(CR)-based MAC for Industrial Wireless Sensor and Actuator Network (IWSAN) applications is proposed. IWSANs are typically used for closed-loop control applications, and they demand strict requirements in terms of time and robustness. Low latency and low error rates are required in order not to endanger persons or machinery. Moreover, these applications operate in industrial environments such as factories or transport scenarios (as aeronautics or railway) where multipath fading and shadowing are present due to metal surfaces. Furthermore, interference from other communication systems or industrial machinery is also common in these environments. The proposed MAC, based on the CR paradigm, is capable of ensuring time and robustness requirements in industrial channels. In the process of designing the CR-based MAC for IWSAN applications, a comparison between several non-CR-based MACs and CR-based MACs has been carried out. This comparison, which allows stating the benefits of CR for these applications, is presented in this thesis. The performance of every MAC is determined theoretically using Network Calculus, and it is validated through OPNET simulations. CR solutions, due to their adaptability characteristics, are capable of avoiding interference and ensuring robustness in industrial environments. However, none of the selected MACs are capable of ensuring robustness without comprising time requirements, since interference is avoided but not in a bounded time. On the other hand, the MAC proposed in this thesis is capable of avoiding interference ensuring time and robustness requirements at the same time. This MAC is therefore suitable for IWSAN applications. To ensure a deterministic behavior against interference, a novel handoff algorithm, which detects interference and hops to another channel, has been proposed. This algorithm has been designed to be used jointly with one of the evaluated MACs. The detection of the interference and the hop to another channel is done in a bounded time, because the proposed algorithm detects interference while the system is transmitting. The performance of this proposal is evaluated using Network Calculus and OPNET simulations, and the results are compared with the system without the proposed handoff algorithm. The comparison of the results shows how the evaluated MAC is only capable of ensuring both time and robustness requirements when the proposed handoff strategy is used. Moreover, the spectrum sensing algorithm used to obtain information about the environment is delved and its performance is measured through MATLAB simulations. An energy detector has been chosen due to its simplicity. Also, a cyclostationary Modulation Classifier is presented and a simplification has been carried out allowing its implementation on real hardware. The Modulation Classifier is capable of distinguishing between OFDM, QPSK and GFSK signals. The performance of the algorithm is presented in this thesis for different signals and for different receiver impairments such as frequency offset, DC offset and I/Q imbalance. Finally, a cognitive platform to validate the spectrum sensing algorithms is presented. This platform has been designed using a Xilinx Virtex 6 FPGA by a working group composed of researchers from IK4-Ikerlan and Mondragon Unibertsitatea. The platform, which uses both spectrum sensing algorithms, is an Ethernet-to-RF bridge. It has been designed to replace an Ethernet wired link by a wireless one for IWSAN applications. The proposed platform ensures a reliable communication link against interference. In the proposed implementation, the energy detector is used by the transmitter in order to find a free channel to transmit data, whereas the modulation classifier is used by the receiver in order to distinguish between the signal transmitted by the RF-Ethernet bridge and other signals. In this way the receiver can find the channel where the transmitter is carrying out the communication.En esta tesis se propone una MAC basada en el paradigma de la Radio Cognitiva (RC) para redes de sensores y actuadores inalámbricos industriales. Estas redes se suelen utilizar para aplicaciones de control en lazo cerrado, que exigen requisitos estrictos de tiempo y robustez. Para no poner en peligro la salud de las personas o la maquinaria es necesario que la red asegure una baja latencia y una tasa baja de errores. Además, al trabajar en ambientes industriales como fábricas o transportes (trenes, aviones, etc.), estas redes tienen que hacer frente a canales con mucho desvanecimiento por multitrayecto y efecto sombra debido a las superficies metálicas. También es común en estos entornos que haya interferencias de otros sistemas de comunicaciones o de la propia maquinaria industrial. La MAC propuesta en esta tesis es capaz de asegurar los requisitos temporales y de robustez demandados trabajando en este tipo de entornos. En el proceso de diseño de la MAC basada en RC para redes de sensores y actuadores inalámbricos industriales, se ha llevado a cabo una comparación de diferentes MACs diseñadas para estas redes. Se han evaluado tanto MACs basadas en RC como no basadas en ella, estableciendo las ventajas de la RC para estas aplicaciones. La evaluación se ha llevado a cabo haciendo un estudio teórico mediante Network Calculus, cuyos resultados se han validado mediante simulaciones en OPNET. Los resultados muestran como la RC es capaz de evitar interferencias y asegurar robustez en ambientes industriales. Sin embargo, ninguna de las MACs seleccionadas ha conseguido asegurar ambos requisitos, temporales y de robustez, al mismo tiempo; se puede evitar las interferencias pero no sin comprometer los requisitos temporales de la aplicación. Sin embargo, la MAC propuesta es capaz de evitar interferencias asegurando al mismo tiempo los requisitos temporales y de robustez. Por lo tanto, la MAC propuesta es apropiada para este tipo de redes. Para asegurar el comportamiento determinista del sistema, se ha propuesto un novedoso algoritmo de handoff que es capaz de detectar una interferencia y saltar a otro canal. Este algoritmo se ha diseñado para ser utilizado conjuntamente con una de las MACs previamente evaluadas. La detección de la interferencia y el salto a otro canal se hace en un tiempo determinado de tiempo, ya que es posible detectar interferencias mientras el sistema está transmitiendo. Su rendimiento se ha evaluado mediante Network Calculus y simulaciones en OPNET, y se ha comparado con los resultados obtenidos con la MAC cuando no se utiliza el esquema propuesto. De la comparación se deduce que el esquema de handoff añade a la MAC la capacidad de asegurar a la vez los requisitos temporales y de robustez. Además, en la tesis se explica el algoritmo de spectrum sensing que la MAC utiliza para obtener información del entorno, y su rendimiento se ha estudiado mediante simulaciones en MATLAB. Debido a su simplicidad, se ha optado por un detector de energía para este propósito. También se presenta un clasificador de modulaciones cicloestacionario. Este clasificador ha sido simplificado todo lo posible para posibilitar su implementación en hardware real. El clasificador de modulaciones es capaz de distinguir entre señales OFDM, QPSK y GFSK. Su rendimiento se detalla para diferentes señales y para diferentes deficiencias presentes en el receptor, como son offset de frecuencia, offset de continua o desequilibrios I/Q. Por último, se presenta una plataforma cognitiva que se ha utilizado para validar los algoritmos de spectrum sensing. Un grupo de trabajo compuesto por investigadores de IK4-Ikerlan y Mondragon Unibertsitatea ha diseñado esta plataforma sobre una FPGA Virtex 6 de Xilinx. La plataforma, que utiliza los dos algoritmos de spectrum sensing, es un puente Ethernet-RF. Su objetivo es reemplazar un enlace cableado de Ethernet por uno inalámbrico para aplicaciones de redes de sensores y actuadores industriales. Gracias a los algoritmos de spectrum sensing, la plataforma es capaz de asegurar un enlace robusto ante interferencias. El detector de energía se utiliza en el transmisor para encontrar los posibles canales libres donde transmitir la información. Mientras que el clasificador de modulaciones se utiliza en el receptor para distinguir entre la señal del transmisor y otras posibles señales. Esto permite al receptor saber en qué canal de todos los posibles está el transmisor.Tesi honetan proposatzen da Irrati Kognitiboaren (IK) paradigman oinarritutako MAC bat industriako haririk gabeko sentsore eta eragingailuen sareetarako. Sare horiek begizta itxiko kontrol aplikazioetarako erabili ohi dira, denbora eta sendotasunaren aldetik baldintza ugari eskatzen dute eta. Pertsonen osasuna eta makinak arriskuan ez jartzeko, beharrezkoa da sareak latentzia eta hutsegite tasa txikiak bermatzea. Gainera, industri giroetan lan egiteko direnez, esaterako, lantegietan edo garraioetan (trenak, hegazkinak, etab.), sare horiek gai izan behar dira gainazal metalikoek eragiten dituzten ibilbide aniztunaren eta itzal efektuaren ondorioz asko barreiatzen diren kanalei aurre egiteko. Ingurune horien ohiko ezaugarria da, baita ere, beste komunikazio sistema batzuen edo industriako makinen beraien interferentziak egotea. Tesi honetan proposatzen den MACa gai da honelako inguruetan lan egiteko denborari eta sendotasunari dagokienez eskatzen dituen baldintzak ziurtatzeko. IKan oinarrituta haririk gabeko sentsore eta eragingailu industrialen sareetarako MACa diseinatzeko prozesuan, horrelako sareetarako aurkeztu diren hainbat MAC alderatu dira. IKan oinarritutako MACak zein bestelakoak ebaluatu dira, eta IKak aplikazio hauetarako dituen abantailak ezarri dira. Ebaluaziorako Network Calculus erabili da, zeinaren bidez azterketa teoriko bat egin baita, eta azterketaren emaitzak OPNETen simulazioak eginda baliozkotu dira. Emaitzek erakusten dutenez, IKa gai da industriako inguruneetan interferentziak ekidin eta sendotasuna ziurtatzeko. Halere, aukeratu diren MACetatik batek ere ez du lortu baldintza biak, denborari buruzkoa zein sendotasunari buruzkoa, aldi berean ziurtatzea; interferentziak ekidin daitezke, baina ez aplikazioaren denborari buruzko baldintzak arriskuan jarri gabe. Dena dela, proposatu den MACak portaera determinista bat ziurtatzen du interferentziekiko, eta aldi berean denborari eta sendotasunari buruzko baldintzak ere ziurtatzen ditu. Hortaz, MAC hau egokia da sare mota honetarako. Sistemaren portaera determinista ziurtatzeko, handoff algoritmo berritzailea proposatu da, zeina interferentzia bat antzeman eta beste kanal bat igarotzeko gai den. Algoritmo hori aurretik ebaluatutakoa MACetako batekin batera erabiltzeko diseinatu da. Interferentzia antzeman eta beste kanal batera salto egitea denbora jakin batean egiten da, izan ere, sistema transmititzen ari dela antzeman baitaitezke interferentziak. Network Calculusen bitartez eta OPNETeko simulazioen bitartez ebaluatu da sistemaren errendimendua, eta proposatutako eskema erabiltzen ez denean MACak ematen dituen emaitzekin alderatu da. Alderaketa horretatik ondorioztatzen denez, handoff eskemak denborari eta sendotasunari buruzko baldintzak batera ziurtatzeko ahalmena ematen dio MACari. Gainera, tesiak azaltzen du inguruneari buruzko informazioa eskuratzeko MACak erabiltzen duen spectrum sensing algoritmoa, eta bere errendimendua MATLABen simulazioak eginez aztertu da. Bere sinpletasuna dela eta, energia detektore bat aukeratu da asmo honetarako. Modulazio sailkatzaile zikloegonkor bat ere aurkezten da. Sailkapen hori ahalik eta gehien sinplifikatu da benetako hardwarean inplementatu ahal izateko. Modulazioen sailkatzaileak OFDM, QPSK eta GFSK seinaleak bereizi ditzake. Bere errendimendua hargailuan dauden seinale eta akats desberdinetarako zehazten da, esaterako maiztasunaren offset-a,zuzenaren offset-a edo I/Q desorekak. Bukatzeko, spectrum sensing-eko algoritmoak baliozkotzeko erabili den plataforma kognitibo bat aurkezten da. IK4-Ikerlaneko eta Mondragon Unibertsitateko ikertzailez osatutako lantalde batek diseinatu du plataforma hori Xilinxen Virtex 6 FPGA baten oinarrutz. Plataformak spectrum sensing-eko bi algoritmo erabiltzen ditu eta Ethernet-RF zubi bat da. Bere helburua da Etherneteko kable bidezko lotura bat haririk gabeko batekin ordeztea industriako sentsore eta eragingailuen sareetan aplikatzeko. Spectrum sensing-eko algoritmoei esker, plataformak lotura sendoa bermatu dezake interferentziak gertatzen direnean. Energia detektorea transmisorean erabiltzen da informazioa transmititzeko erabilgarri egon daitezkeen kanalak aurkitzeko. Modulazioen sailkatzailea, berriz, hargailuan erabiltzen da transmisorearen seinalea eta egon daitezkeen beste seinale batzuk bereizteko. Horri esker, hargailuak badaki posible diren kanal guztietatik non dagoen transmisorea