Cognitive radio technology provides a solution for the spectrum scarcity issue by allowing the unlicensed users which are the cognitive radio devices to share the licensed band with the licensed (primary) users. The abilities of cognitive radio device help the secondary (unlicensed) nodes to observe the licensed band and to adjust their transmission parameters for maintaining the primary communication since in cognitive radio networks, it is essential that the existence of the unlicensed users must not harm the licensed network. Under these circumstances, we consider vertical cooperative transmission where primary transmission is not severely damaged by the secondary interference since each primary pair (transmitter and receiver) selects a neighbor secondary user as a cooperative relay to assist their transmission. Cooperation provides an increase in the signal-tointerference-ratio (SIR) of the primary network which can be harnessed by the secondary network as an additional bandwidth for their communication. We propose three relay selection rules so the influence of the relay’s position over the temporal and spatial correlations can be evaluated for different network conditions. Additionally, we implement primary exclusive region (PER) for each primary pair in the network which covers primary nodes, and all secondary users locate inside the zone become inactive. According to the outage model proposed in paper [2], temporal and spatial correlations are assumed to be 1 and 0 respectively; however it is estimated that regarding the environmental factors and the relay’s location, these correlation values may vary. This thesis work is based on the validation of the assumptions provided in paper [2] and our results demonstrate that the temporal and spatial correlation values changes under different circumstances and with different relay selection rules. The simulation results also show that PER significantly stimulates the cooperation performance thereby increases the transmission quality of the primary network.

Thesis(M.Sc. (Computer Science)) -- University of Limpopo, 2020 / Spectrum scarcity is one of the major problems affecting the advancement of wireless technology. The world is now entering into a new era called the “Fourth Industrial Revolution” and technologies like the Internet of Things (IoT) and blockchain are surfacing at a rapid pace. All these technologies and this new era need high speed network (Internet) connectivity. Internet connectivity is reliant on the availability of spectrum Channels. The Federal Communication Commission (FCC) has emphatically alluded on the urgency of finding quick and effective solutions to the problem of spectrum scarcity because the available spectrum bands are getting depleted at an alarming rate. Cognitive Radio Ad Hoc Networks (CRAHNs) have been introduced to solve the problem of spectrum depletion. CRAHNs are mobile networks which allow for two groups of users: Primary Users (PUs) and Secondary Users (SUs). PUs are the licensed users of the spectrum and SUs are the unlicensed users. The SUs access spectrum bands opportunistically by switching between unused spectrum bands. The current licensed users do not fully utilize their spectrum bands. Some licensed users only use their spectrum bands for short time periods and their bands are left idling for the greater part of time. CRNs take advantage of the periods when spectrum bands are not fully utilized by introducing secondary users to switch between the idle spectrum bands. The CRAHNs technology can be implemented in different types of routing environments including military networks. The military version of CRAHNs is called Military Cognitive Radio Ad Hoc Networks (MCRAHNs). Military networks are more complex than ordinary networks because they are subject to random attacks and possible destruction. This research project investigates the delays experienced in routing packets for MCRAHNs and proposes a new routing algorithm called Spectrum-Aware Transitive Multicasting On Demand Distance Vector (SAT-MAODV) which has been optimized for reducing delays in packet transmission and increasing throughput. In the data transmission process, there are several levels where delays are experienced. Our research project focuses on Routing Path (RP) delay, Spectrum Mobility (SM) delay and Node Relay (NR) delay. This research project proposes techniques for spectrum switching and routing called Time-Based Availability (TBA), Informed Centralized Multicasting (ICM), Node Roaming Area (NRA) and Energy Smart Transitivity (EST). All these techniques have been integrated into SAT-MAODV. SAT-MAODV was simulated and compared with the best performing algorithms in MCRHANs. The results show that SAT-MAODV performs better than its counterparts

Cognitive radio networks (CRNs) have emerged as a solution for the looming spectrum crunch caused by the rapid adoption of wireless devices over the previous decade. This technology enables efficient spectrum utility by dynamically reusing existing spectral bands. A CRN achieves this by requiring its users – called secondary users (SUs) – to measure and opportunistically utilise the band of a legacy broadcaster – called a primary user (PU) – in a process called spectrum sensing. Sensing requires the distribution and fusion of measurements from all SUs, which is facilitated by a variety of architectures and topologies. CRNs possessing a central computation node are called centralised networks, while CRNs composed of multiple computation nodes are called decentralised networks. While simpler to implement, centralised networks are reliant on the central node – the entire network fails if this node is compromised. In contrast, decentralised networks require more sophisticated protocols to implement, while offering greater robustness to node failure. Relay-based networks, a subset of decentralised networks, distribute the computation over a number of specialised relay nodes – little research exists on spectrum sensing using these networks. CRNs are vulnerable to unique physical layer attacks targeted at their spectrum sensing functionality. One such attack is the Byzantine attack; these attacks occur when malicious SUs (MUs) alter their sensing reports to achieve some goal (e.g. exploitation of the CRN’s resources, reduction of the CRN’s sensing performance, etc.). Mitigation strategies for Byzantine attacks vary based on the CRN’s network architecture, requiring defence algorithms to be explored for all architectures. Because of the sparse literature regarding relay-based networks, a novel algorithm – suitable for relay-based networks – is proposed in this work. The proposed algorithm performs joint MU detection and secure sensing by large-scale probabilistic inference of a statistical model. The proposed algorithm’s development is separated into the following two parts. • The first part involves the construction of a probabilistic graphical model representing the likelihood of all possible outcomes in the sensing process of a relay-based network. This is done by discovering the conditional dependencies present between the variables of the model. Various candidate graphical models are explored, and the mathematical description of the chosen graphical model is determined. • The second part involves the extraction of information from the graphical model to provide utility for sensing. Marginal inference is used to enable this information extraction. Belief propagation is used to infer the developed graphical model efficiently. Sensing is performed by exchanging the intermediate belief propagation computations between the relays of the CRN. Through a performance evaluation, the proposed algorithm was found to be resistant to probabilistic MU attacks of all frequencies and proportions. The sensing performance was highly sensitive to the placement of the relays and honest SUs, with the performance improving when the number of relays was increased. The transient behaviour of the proposed algorithm was evaluated in terms of its dynamics and computational complexity, with the algorithm’s results deemed satisfactory in this regard. Finally, an analysis of the effectiveness of the graphical model’s components was conducted, with a few model components accounting for most of the performance, implying that further simplifications to the proposed algorithm are possible. / Dissertation (MEng)--University of Pretoria, 2020. / Electrical, Electronic and Computer Engineering / MEng / Unrestricted

In wireless digital communications, the sender and receiver typically know the modulation scheme with which they will be communicating. Automatic modulation identification is the ability to identify the modulation in a communication system with little to no prior knowledge of the modulation scheme. Many techniques for modulation identification operate on many assumptions including that the input signal is base-banded, the carrier frequency is known and that the signal is narrow-band (i.e. neighboring signals in the wide-band are excluded). This work provides the blind processing of an arbitrary wide-band signal to allow such assumptions. The challenges of such a front-end or pre-processor include detecting signals which can appear at any frequency, with any band-width at any given time and for any arbitrary duration. This work takes as its input a wide-band signal with a random number of sub-signals, each turning on and o at random times and each at random locations in the frequency domain. The output of the system is a collection of signals corresponding to each sub-signal brought down to base-band, isolated in the frequency and time domains, nominally sampled and with estimates of key parameters.

No description available.

No description available.

The current and future trends of modern wireless communication systems place heavy demands on fast data transmissions in order to satisfy end users’ requirements anytime, anywhere. Such demands are obvious in recent applications such as smart phones, long term evolution (LTE), 4 & 5 Generations (4G & 5G), and worldwide interoperability for microwave access (WiMAX) platforms, where robust coding and modulations are essential especially in streaming on-line video material, social media and gaming. This eventually resulted in extreme exhaustion imposed on the frequency spectrum as a rare natural resource due to stagnation in current spectrum management policies. Since its advent in the late 1990s, cognitive radio (CR) has been conceived as an enabling technology aiming at the efficient utilisation of frequency spectrum that can lead to potential direct spectrum access (DSA) management. This is mainly attributed to its internal capabilities inherited from the concept of software defined radio (SDR) to sniff its surroundings, learn and adapt its operational parameters accordingly. CR systems (CRs) may commonly comprise one or all of the following core engines that characterise their architectures; namely, adaptive coded modulation (ACM), automatic modulation classification (AMC) and spectrum sensing (SS). Motivated by the above challenges, this programme of research is primarily aimed at the design and development of new paradigms to help improve the adaptability of CRs and thereby achieve the desirable signal processing tasks at the physical layer of the above core engines. Approximate modelling of Rayleigh and finite state Markov channels (FSMC) with a new concept borrowed from econometric studies have been approached. Then insightful channel estimation by using Kalman filter (KF) augmented with interacting multiple model (IMM) has been examined for the purpose of robust adaptability, which is applied for the first time in wireless communication systems. Such new IMM-KF combination has been facilitated in the feedback channel between wireless transmitter and receiver to adjust the transmitted power, by using a water-filling (WF) technique, and constellation pattern and rate in the ACM algorithm. The AMC has also benefited from such IMM-KF integration to boost the performance against conventional parametric estimation methods such as maximum likelihood estimate (MLE) for channel interrogation and the estimated parameters of both inserted into the ML classification algorithm. Expectation-maximisation (EM) has been applied to examine unknown transmitted modulation sequences and channel parameters in tandem. Finally, the non-parametric multitaper method (MTM) has been thoroughly examined for spectrum estimation (SE) and SS, by relying on Neyman-Pearson (NP) detection principle for hypothesis test, to allow licensed primary users (PUs) to coexist with opportunistic unlicensed secondary users (SUs) in the same frequency bands of interest without harmful effects. The performance of the above newly suggested paradigms have been simulated and assessed under various transmission settings and revealed substantial improvements.

Traditionally, radio spectrum has been statically allocated to wireless service providers (WSPs). Regulators, like FCC, give wireless service providers exclusive long term licenses for using specific range of frequencies in particular geographic areas. Moreover, restrictions are imposed on the technologies to be used and the services to be provided. The lack of flexibility in static spectrum allocation constrains the ability to make use of new technologies and the ability to redeploy the spectrum to higher valued uses, thereby resulting in inefficient spectrum utilization [23, 38, 42, 62, 67]. These limitations have motivated a paradigm shift from static spectrum allocation towards a more ‘liberalized’ notion of spectrum management in which secondary users can borrow idle spectrum from primary spectrum licensees, without causing harmful interference to the latter- a notion commonly referred to as dynamic spectrum access (DSA) or open spectrum access [3], [82]. Cognitive radio [30, 47], empowered by Software Defined Radio (SDR) [81], is poised to promote the efficient use of spectrum by adopting this open spectrum approach. In this dissertation, we first address the problem of dynamic channel (spectrum) access by a set of cognitive radio enabled nodes, where each node acting in a selfish manner tries to access and use as many channels as possible, subject to the interference constraints. We model the dynamic channel access problem as a modified Rubinstein-St˚ahl bargaining game. iii In our model, each node negotiates with the other nodes to obtain an agreeable sharing rule of the available channels, such that, no two interfering nodes use the same channel. We solve the bargaining game by finding Subgame Perfect Nash Equilibrium (SPNE) strategies of the nodes. First, we consider finite horizon version of the bargaining game and investigate its SPNE strategies that allow each node to maximize its utility against the other nodes (opponents). We then extend these results to the infinite horizon bargaining game. Furthermore, we identify Pareto optimal equilibria of the game for improving spectrum utilization. The bargaining solution ensures that no node is starved of channels. The spectrum that a secondary node acquires comes to it at a cost. Thus it becomes important to study the ‘end system’ perspective of such a cost, by focusing on its implications. Specifically, we consider the problem of incentivizing nodes to provide the service of routing using the acquired spectrum. In this problem, each secondary node having a certain capacity incurs a cost for routing traffic through it. Secondary nodes will not have an incentive to relay traffic unless they are compensated for the costs they incur in forwarding traffic. We propose a path auction scheme in which each secondary node announces its cost and capacity to the routing mechanism, both of which are considered as private information known only to the node. We design a route selection mechanism and a pricing function that can induce nodes to reveal their cost and capacity honestly (making our auction truthful), while minimizing the payment that needs to be given to the nodes (making our auction optimal). By considering capacity constraint of the nodes, we explicitly support multiple path routing. For deploying our path auction based routing mechanism in DSA networks, we provide polynomial time iv algorithms to find the optimal route over which traffic should be routed and to compute the payment that each node should receive. All our proposed algorithms have been evaluated via extensive simulation experiments. These results help to validate our design philosophy and also illustrate the effectiveness of our solution approach.

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.

A paradigm shift from static spectrum allocation to dynamic spectrum access (DSA) is becoming a reality due to the recent advances in cognitive radio, wide band spectrum sensing, and network aware real--time spectrum access. It is believed that DSA will allow wireless service providers (WSPs) the opportunity to dynamically access spectrum bands as and when they need it. Moreover, due to the presence of multiple WSPs in a region, it is anticipated that dynamic service pricing would be offered that will allow the end-users to move from long-term service contracts to more flexible short-term service models. In this research, we develop a unified economic framework to analyze the trading system comprising two components: i) spectrum owner--WSPs interactions with regard to dynamic spectrum allocation, and ii) WSP--end-users interactions with regard to dynamic service pricing. For spectrum owner--WSPs interaction, we investigate various auction mechanisms for finding bidding strategies of WSPs and revenue generated by the spectrum owner. We show that sequential bidding provides better result than the concurrent bidding when WSPs are constrained to at most single unit allocation. On the other hand, when the bidders request for multiple units, (i.e., they are not restricted by allocation constraints) synchronous auction mechanism proves to be beneficial than asynchronous auctions. In this regard, we propose a winner determination sealed-bid knapsack auction mechanism that dynamically allocates spectrum to the WSPs based on their bids. As far as dynamic service pricing is concerned, we use game theory to capture the conflict of interest between WSPs and end--users, both of whom try to maximize their respective net utilities. We deviate from the traditional per--service static pricing towards a more dynamic model where the WSPs might change the price of a service almost on a session by session basis. Users, on the other hand, have the freedom to choose their WSP based on the price offered. It is found that in such a greedy and non-cooperative behavioral game model, it is in the best interest of the WSPs to adhere to a price threshold which is a consequence of a price (Nash) equilibrium. We conducted extensive simulation experiments, the results of which show that the proposed auction model entices WSPs to participate in the auction, makes optimal use of the common spectrum pool, and avoids collusion among WSPs. We also demonstrate how pricing can be used as an effective tool for providing incentives to the WSPs to upgrade their network resources and offer better services.