PRACB: A Novel Channel Bonding Algorithm for Cognitive Radio Sensor Networks

Wireless sensor networks (WSNs) can utilize the unlicensed industrial, scientific and medical (ISM) band to communicate the sensed data. The ISM band has been already saturated due to overlaid deployment of WSNs. To solve this problem, WSNs have been powered up by cognitive radio (CR) capability. By using CR technique, WSNs can utilize the spectrum holes opportunistically. Channel bonding (CB) is a technique through which multiple contiguous channels can be combined to form a single wide band channel. By using channel bonding (CB) technique, CR based WSN nodes attempt to find and combine contiguous channels to avail larger bandwidth. In this paper, we show that probability of finding contiguous channels decreases with the increase in number of channels. Moreover, we propose two algorithms of primary radio (PR) activity based channel bonding schemes and compare with sample width algorithm (SWA). The simulation results show that our algorithm significantly avoids PR-CR harmful interference and CB in cognitive radio sensor networks (CRSNs) provides greater bandwidth to CR nodes

Secure MAC protocols for cognitive radio networks

A thesis submitted in partial fulfilment for the degree of Doctor of PhilosophyWith the rapid increase in wireless devices, an effective improvement in the demand of efficient spectrum utilisation for gaining better connectivity is needed. Cognitive Radio (CR) is an emerging technology that exploits the inefficient utilisation of the unused spectrum dynamically. Since spectrum sharing is responsible for coordinating channels’ access for Cognitive Users (CUs), the Common Control Channel (CCC) is one of the existing methods used to exchange the control information between CUs. However, the unique characteristics and parameters of Cognitive Radio Networks (CRNs) present several possible threats targeting spectrum sensing, spectrum management, spectrum sharing, and spectrum mobility leading to the deterioration of the network performance. Thus, protection and detection security mechanisms are essential to maintaining the CRNs. This thesis presents a novel decentralised CR MAC protocol that successfully utilises the unused portion of the licensed band. The protocol achieves improved performance; communication time and throughput when compared to two benchmark protocols. Less communication time and higher throughput are accomplished by the protocol due to performing fast switching to the selected available data channel for initiating data transmission. The proposed protocol is then extended to two different versions based on two authentication approaches applied to it; one using Digital Signature and another is based on Shared-Key. The two proposed secure protocols address the security requirements in CRNs leading to subsequent secure communication among CUs. The protocols function effectively in providing defence against several attacks related to the MAC layer such as; Spectrum Sensing Data Manipulation/Falsification, Data Tempering and Modification, Jamming attacks, Eavesdropping, Forgery and Fake control information attacks, MAC address spoofing, and unauthorised access attacks. The associated security algorithms ensure the successful secure communication between CUs in a cooperative approach. Moreover, the security protocols are investigated and analysed in terms of security flows by launching unauthorised access and modification attacks on the transmitted information. The testing results demonstrated that two protocols perform successful detection of threats and ensure secure communication in CRNs

A survey of cognitive radio handoff schemes, challenges and issues for industrial wireless sensor networks (CR-IWSN)

Industrial wireless sensor network (IWSN) applications are mostly time-bound, mission-critical and highly delay sensitive applications therefore IWSN defines strict, stringent and unique QoS requirements such as timeliness, reliability and availability. In IWSN, unlike other sensor networks, late arrival of packets or delay or disruption to an on-going communication are considered as critical failure. Also, because IWSN is deployed in the overcrowded industrial, scientific, and medical (ISM) band it is difficult to meet this unique QoS requirements due to stiff competition for bandwidth from other technologies operating in ISM band resulting in scarcity of spectrum for reliable communication and/or disruption of ongoing communication. However, cognitive radio (CR) provides more spectral opportunities through opportunistic-use of unused licensed spectrum while ensuring minimal interference to licensed users. Similarly, spectrum handoff, which is a new type of handoff in cognitive radio, has the potential to offer increase bandwidth, reliable, smooth and interference-free communication for IWSNs through opportunistic-use of spectrum, minimal switching-delays, and efficient target channel selection strategies as well as effective link recovery maintenance. As a result, a new paradigm known as cognitive radio industrial wireless sensor network (CR-IWSN) has become the interest of recent research efforts. In this paper, we highlight and discuss important QoS requirements of IWSN as well as efforts of existing IWSN standards to address the challenges. We discuss the potential and how cognitive radio and spectrum handoff can be useful in the attempt to provide real-time reliable and smooth communication for IWSNs.The Council for Scientific and Industrial Research (CSIR), South Africa [ICT: Meraka].http://www.elsevier.com/locate/jnca2018-11-01hj2017Electrical, Electronic and Computer Engineerin

A reliable and energy efficient cognitive radio multichannel MAC protocol for ad-hoc networks

A thesis submitted in partial ful llment for the degree of Doctor of Philosophy in the Department of Computer Science and Technology, University of BedfordshireRecent research has shown that several spectrum bands are mostly underutilised. To resolve the issue of underutilisation of spectrum bands across the networks, the concept of Cognitive Radio (CR) technology was envisaged. The CR technology allows Secondary Users (SUs) to acquire opportunistic access to large parts of the underutilised spectrum bands on wireless networks. In CR networks, SUs may scan and identify the vacant channels in the wireless spectrum bands and then dynamically tune their receivers to identify vacant channels and transmitters, and commence communication among themselves without causing interference to Primary/Licensed Users (PUs). Despite the developments in the eld of CR technology, recent research shows that still there are many challenges unaddressed in the eld. Thus, there is a need to reduce additional handshaking over control and data channels, to minimise large sized control frames and to introduce reliable channel selection process and maintenance of SUs' communication when PUs return to a licensed channel. A fundamental challenge a ecting this technology is the identi cation of reliable Data Channels (DCHs) for SUs communication among available channels and the continuation of communication when the PU returns. This doctoral research investigates in detail how to resolve issues related to the protocol design for Cognitive Radio Networks (CRNs) on Medium Access Layers (MAC) for Ad-Hoc networks. As a result, a novel Reliable and Energy e cient Cognitive Radio multi-channel MAC protocol (RECR-MAC) for Ad-Hoc networks is proposed to overcome the shortcomings mentioned. After discussing the background, operation and architecture of CR technology, this research proposes numerous platforms and testbeds for the deployment of personal and commercial applications of the CRNs. Side by side, optimised control frames and a reduced number of handshakes over the CCH are suggested to extend the transmitting time for data communication. In addition, the reliable channel selection process is introduced instead of random selection of DCHs for successful data communication among the SUs. In RECR-MAC, the objective of every SU is to select reliable DCHs, thereby ensuring high connectivity and exchanging the successful data frames across the cognitive network. Moreover, the selection criteria of the DCHs are based on multiple factors, such as an initial selection based on the maximum free time recorded by the SUs over the DCH channel ranking, which is proportional to the number of positive/negative acknowledgements, and the past history of DCHs. If more than two DCHs have an equal value during the second, third and following iterations, then the DCHs are selected based upon the maximum free time. The priorities of the DCHs are then assigned based on Reliable Data Channels, that is, RDCH 1, RDCH 2, RDCH 3, and RDCH 4 respectively (where RDCH 1 and RDCH 2 have the highest priority, DRCH 3 and RDCH 4 have the next priority, and so on). The impacts of channel selection process and Backup Data Channel (BDC) over the proposed RECR-MAC protocol are analysed in combination with comparative benchmark CR-MAC protocols based on the timing diagrams proposed. Finally, the RECR-MAC protocol is validated by using a MATLAB simulator with PU impact over the DCHs, both with and without BDC, and by comparing results, such as communication time, transmitting energy and throughput, with benchmark CR-MAC protocols

Cognitive Radio Network with a distributed control channel and quality-of-service solution

The proliferation of wireless access and applications to the Internet and the advent of a myriad of highly evolved portable communication devices; creates the need for an efficiently utilized radio spectrum. This is paramount in the licensed and unlicensed radio frequency bands, that spawn an exponential growth in Dynamic Spectrum Access (DSA) research, Cognitive Radio (CR) and Cognitive Radio Networks (CRN) research. DSA research has given way to the paradigm shift toward CR with its dynamic changes in transmission schemas. This paradigm shift from a fixed and centralized frequency spectrum environment has morphed into a dynamic and decentralized one. CR provides wireless nodes the capability to adapt and exploit the frequency spectrum. The spectrum information obtained is scanned and updated to determine the channel quality for viability and a utilization/availability by the licensed (primary) user. To take advantage of the CR capabilities, previous research has focused on a Common Control Channel(CCC) for the control signals to be used for spectrum control. This utilization generates channel saturation, extreme transmission overhead of control information, and a point of vulnerability. The traditional designs for wireless routing protocols do not support an ad hoc multi-hop cognitive radio network model. This research focuses on a real world implementation of a heterogeneous ad hoc multi-hop Cognitive Radio Network. An overall model, coined Emerald, has been designed to address the architecture; the Medium Access Control layer, E-MAC; and the network layer, E-NET. First, a Medium Access Control(MAC) layer protocol is provided to avoid the pitfalls of a common control channel. This new design provides CRNs with network topology and channel utilization information. Spectrum etiquette, in turn, addresses channel saturation, control overhead, and the single point of vulnerability. Secondly, a routing model is proposed that will address the efficiency of an ad hoc multi-hop CRN with a focus on the Quality-of-Service(QoS) of the point-to-point as well as end-to-end communication. This research has documented weaknesses in spectrum utilization; it has been expanded to accommodate a distributed control environment. Subsets of the model will be validated through Network Simulator-2(NS/2) and MatLab© simulations to determine point-to-point and end-to-end communications

Improving the Performance of Wireless LANs

This book quantifies the key factors of WLAN performance and describes methods for improvement. It provides theoretical background and empirical results for the optimum planning and deployment of indoor WLAN systems, explaining the fundamentals while supplying guidelines for design, modeling, and performance evaluation. It discusses environmental effects on WLAN systems, protocol redesign for routing and MAC, and traffic distribution; examines emerging and future network technologies; and includes radio propagation and site measurements, simulations for various network design scenarios, numerous illustrations, practical examples, and learning aids

Using hypergraph theory to model coexistence management and coordinated spectrum allocation for heterogeneous wireless networks operating in shared spectrum

Electromagnetic waves in the Radio Frequency (RF) spectrum are used to convey wireless transmissions from one radio antenna to another. Spectrum utilisation factor, which refers to how readily a given spectrum can be reused across space and time while maintaining an acceptable level of transmission errors, is used to measure how efficiently a unit of frequency spectrum can be allocated to a specified number of users. The demand for wireless applications is increasing exponentially, hence there is a need for efficient management of the RF spectrum. However, spectrum usage studies have shown that the spectrum is under-utilised in space and time. A regulatory shift from static spectrum assignment to DSA is one way of addressing this. Licence exemption policy has also been advanced in Dynamic Spectrum Access (DSA) systems to spur wireless innovation and universal access to the internet. Furthermore, there is a shift from homogeneous to heterogeneous radio access and usage of the same spectrum band. These three shifts from traditional spectrum management have led to the challenge of coexistence among heterogeneous wireless networks which access the spectrum using DSA techniques. Cognitive radios have the ability for spectrum agility based on spectrum conditions. However, in the presence of multiple heterogeneous networks and without spectrum coordination, there is a challenge related to switching between available channels to minimise interference and maximise spectrum allocation. This thesis therefore focuses on the design of a framework for coexistence management and spectrum coordination, with the objective of maximising spectrum utilisation across geographical space and across time. The amount of geographical coverage in which a frequency can be used is optimised through frequency reuse while ensuring that harmful interference is minimised. The time during which spectrum is occupied is increased through time-sharing of the same spectrum by two or more networks, while ensuring that spectrum is shared by networks that can coexist in the same spectrum and that the total channel load is not excessive to prevent spectrum starvation. Conventionally, a graph is used to model relationships between entities such as interference relationships among networks. However, the concept of an edge in a graph is not sufficient to model relationships that involve more than two entities, such as more than two networks that are able to share the same channel in the time domain, because an edge can only connect two entities. On the other hand, a hypergraph is a generalisation of an undirected graph in which a hyperedge can connect more than two entities. Therefore, this thesis investigates the use of hypergraph theory to model the RF environment and the spectrum allocation scheme. The hypergraph model was applied to an algorithm for spectrum sharing among 100 heterogeneous wireless networks, whose geo-locations were randomly and independently generated in a 50 km by 50 km area. Simulation results for spectrum utilisation performance have shown that the hypergraph-based model allocated channels, on average, to 8% more networks than the graph-based model. The results also show that, for the same RF environment, the hypergraph model requires up to 36% fewer channels to achieve, on average, 100% operational networks, than the graph model. The rate of growth of the running time of the hypergraph-based algorithm with respect to the input size is equal to the square of the input size, like the graph-based algorithm. Thus, the model achieved better performance at no additional time complexity.Electromagnetic waves in the Radio Frequency (RF) spectrum are used to convey wireless transmissions from one radio antenna to another. Spectrum utilisation factor, which refers to how readily a given spectrum can be reused across space and time while maintaining an acceptable level of transmission errors, is used to measure how efficiently a unit of frequency spectrum can be allocated to a specified number of users. The demand for wireless applications is increasing exponentially, hence there is a need for efficient management of the RF spectrum. However, spectrum usage studies have shown that the spectrum is under-utilised in space and time. A regulatory shift from static spectrum assignment to DSA is one way of addressing this. Licence exemption policy has also been advanced in Dynamic Spectrum Access (DSA) systems to spur wireless innovation and universal access to the internet. Furthermore, there is a shift from homogeneous to heterogeneous radio access and usage of the same spectrum band. These three shifts from traditional spectrum management have led to the challenge of coexistence among heterogeneous wireless networks which access the spectrum using DSA techniques. Cognitive radios have the ability for spectrum agility based on spectrum conditions. However, in the presence of multiple heterogeneous networks and without spectrum coordination, there is a challenge related to switching between available channels to minimise interference and maximise spectrum allocation. This thesis therefore focuses on the design of a framework for coexistence management and spectrum coordination, with the objective of maximising spectrum utilisation across geographical space and across time. The amount of geographical coverage in which a frequency can be used is optimised through frequency reuse while ensuring that harmful interference is minimised. The time during which spectrum is occupied is increased through time-sharing of the same spectrum by two or more networks, while ensuring that spectrum is shared by networks that can coexist in the same spectrum and that the total channel load is not excessive to prevent spectrum starvation. Conventionally, a graph is used to model relationships between entities such as interference relationships among networks. However, the concept of an edge in a graph is not sufficient to model relationships that involve more than two entities, such as more than two networks that are able to share the same channel in the time domain, because an edge can only connect two entities. On the other hand, a hypergraph is a generalisation of an undirected graph in which a hyperedge can connect more than two entities. Therefore, this thesis investigates the use of hypergraph theory to model the RF environment and the spectrum allocation scheme. The hypergraph model was applied to an algorithm for spectrum sharing among 100 heterogeneous wireless networks, whose geo-locations were randomly and independently generated in a 50 km by 50 km area. Simulation results for spectrum utilisation performance have shown that the hypergraph-based model allocated channels, on average, to 8% more networks than the graph-based model. The results also show that, for the same RF environment, the hypergraph model requires up to 36% fewer channels to achieve, on average, 100% operational networks, than the graph model. The rate of growth of the running time of the hypergraph-based algorithm with respect to the input size is equal to the square of the input size, like the graph-based algorithm. Thus, the model achieved better performance at no additional time complexity

Medium access in cognitive radio networks: From single hop to multiple hops

If channel assembling is enabled, this technique can be utilized for potential performance improvement in CRNs. Two use cases are envisaged for channel assembling. In the first use case, the system can accommodate parallel SU services in multiple channels, while in the second use case, the system allows only one SU service at a time. In the use case where parallel SU services are allowed, various channel assembling strategies are proposed and modeled in order to investigate their performance and to acquire better comprehension of the behavior of CRNs with channel assembling. Moreover, the capacity upper bound for CRNs with channel assembling in the quasistationary regime is derived. In the use case when there is only one SU service that can utilize the vacant channels at a time, we formulate channel access into two optimization problems on power allocation in multi-channel CRNs and propose various algorithms to solve these problems

On spectrum allocation strategies in Cognitive Radio Networks

Due to the temporal and spatial underutilization of licensed spectrum bands, as well as the crowdedness of unlicensed bands, a new spectrum access paradigm has been recently proposed namely, Cognitive Radio (CR). CR enables users to adjust their transceivers\u27 frequencies depending on the availability of licensed frequency bands which are otherwise unused by their licensees, called Primary Users (PUs). Thus, unlicensed wireless users, called Secondary Users (SUs) can dynamically and opportunistically access unused licensed bands in order to improve their throughput and service reliability. Whenever the licensed users, or the PUs, become active, SUs must vacate their bands. This dissertation is concerned with the operation of Cognitive Radio Networks (CRNs), and deals with four important problems. First, a performance model to study heterogeneous channel access in CRNs is presented. In this model, there are two types of licensed channels, where one type has a larger bandwidth, and hence a higher service rate for SUs. Therefore, SUs prefer to use such channels, if available, over channels in the second type which have a lower service rate. SUs may also switch from the second to the first type of channels when they become available, even if their current channels are still available. We also model the SUs\u27 sensing process, and derive several SUs\u27 performance metrics including average waiting time. Numerical results show that our proposed operational model outperforms a baseline model that does not support prioritized access. Second, we introduce a low overhead scheme for the uplink channel allocation within a single cell of CRNs operating as Wireless Mesh Networks (CR-WMNs). The scheme does not rely on using a Common Control Channel (CCC). The proposed mechanism is based on the use of Physical Layer Network Coding (PNC), in which two (or three) Secondary Users (SUs) who are requesting uplink channel allocation are allowed to transmit synchronously over a randomly selected channel from a set of available channels, and without coordination. A Mesh Router (MR) which is listening to these transmissions, and is in charge of channel allocation, can detect up to 2 (or 3) requests, on the same channel due to the use of PNC, and replies back with a control packet which contains information about channel assignment. Our proposed mechanisms significantly outperform traditional schemes that rely on using one CCC, or do not use PNC, in terms of channel allocation overhead time. Third, we also propose to enable SUs to recover their packets which collide with PUs\u27 transmissions when a PU becomes active for two scenarios, based on the received phase shifts. When a collision occurs between an SU and a PU transmitters, the SU\u27s receiver considers the PU\u27s transmission as an interference, and hence, cancels its effect in order to recover its corresponding received packet\u27s signals. Recovering collided packets, instead of retransmitting them saves transmitters\u27 energy. Numerical results show that a high percentage of energy can be saved over the traditional scheme, in which our packets recovery mechanisms are not employed. Finally, we propose a novel multicast resilient routing approach to select primary and backup paths from an SU source to SUs destinations. Our approach employs a multilayer hyper-graph, in order to model the network, e.g., channels. The primary paths to destination SUs are selected to minimize the end-to-end delay which takes into consideration channels switching latency and transmission delay. To protect the multicast session, we find a backup path for primary path, if feasible, such that these two paths are shared risk hyper-edge disjoint, in order to prevent a concurrent failure for these two paths, when the corresponding PU for this hyper-edge becomes active. Our simulation results show that increasing the number of available channels, increase the number of feasible primary and backup paths, and the maximum path delay decreases almost linearly