The spectral handoff is important in cognitive wireless networks to ensure an adequate quality of service and performance for secondary user communications. This work presents a multivariable algorithm for dynamic channel selection used in cognitive wireless networks. The channel selection is based on the fuzzy analytical hierarchical process (FAHP) method. The selected criteria for choosing the best backup channel are probability of channel availability, estimated channel time availability, signal to noise plus interference ratio, and bandwidth. These criteria are determined by means of a customized Delphi Method and using the FAHP technique; the corresponding weight and significance is calculated for two applications classified as best effort (BE) and real time (RT). The insertion of the fuzzy logic in the AHP algorithm allows better handling of inaccurate information because, as shown the results, consider more options to evaluate in contrast to a conventional AHP. As a difference with related work, the performance of our proposed FAHP method was validated with captured data in experiments realized at the GSM frequency band (824–849 MHz). This is due to the challenge of finding white spaces to communicate in this frequency band. This band represents more disputes in accessing spectral opportunities than other radio frequency (RF) bands because of the high demand for mobile phone communications. The proposed FAHP algorithm has a practical computational complexity and provides an effective frequency-channel selection. This proposed FAHP algorithm presents a new methodology to select and classify the variables based on a modified version of the Delphi method. The results of the proposed method were contrasted numerically with other three methods.

Spectral decision making is a function of the cognitive cycle. It aims to select spectral opportunities within a set of finite possibilities. Decision-making methodologies, based on collaborative information exchanges, are used to improve the selection process. For collaborative decision making to be efficient, decisions need to be analyzed based on the amount of information. Using little data can produce inefficient decisions, and taking a lot of data can result in high computational costs and delays. This document presents three contributions: the incorporation of a collaborative strategy for decision making, the implementation of real data, and the analysis of the amount of information through the number of failed handoffs. The collaborative model acts as a two-way information node, the information it coordinates corresponds to the Global System for Mobile Communications (GSM) band, and the amount of information to be shared is selected according to five levels of collaboration: 10%, 20%, 50%, 80%, and 100%, in which each percentage represents the total number of users that will be part of the process. The decision-making process is carried out by using two multi-criteria techniques: Feedback Fuzzy Analytical Hierarchical Process (FFAHP) and Simple Additive Weighting (SAW). The results are presented in two comparative analyses. The first performs the analysis using the number of failed handoffs. The second quantifies the level of collaboration for the number of failed handoffs. Based on the obtained percentage ratios, the information shared, and the average of increase rates, the level of collaboration that leads to efficient results is determined to be between 20% and 50% for the given number of failed handoffs.

Spectrum Sensing and Spectrum Decision making are the main functions that cognitive radios have to perform in order to select the `best available band' for the establishment of a wireless communication. We model the Spectrum Decision making functionality with multiple attributes and we propose a novel use of the Analytic Hierarchy Process to optimally select available bands from a finite set of options. The simulation results show that our approach classifies from the best to the worst bands based on the requirements from two different classes of service, Real Time and Best Effort. The selection of the best available bands is done with a low execution latency.

In this work, we propose that packets travelling across a wireless sensor network (WSN) can be seen as the active agents that make up a complex system, just like a bird flock or a fish school, for instance. From this perspective, the tools and models that have been developed to study this kind of systems have been applied. This is in order to create a distributed congestion control based on a set of simple rules programmed at the nodes of the WSN. Our results show that it is possible to adapt the carried traffic to the network capacity, even under stressing conditions. Also, the network performance shows a smooth degradation when the traffic goes beyond a threshold which is settled by the proposed self-organized control. In contrast, without any control, the network collapses before this threshold. The use of the proposed solution provides an effective strategy to address some of the common problems found in WSN deployment by providing a fair packet delivery. In addition, the network congestion is mitigated using adaptive traffic mechanisms based on a satisfaction parameter assessed by each packet which has impact on the global satisfaction of the traffic carried by the WSN. In this work, we propose that packets travelling across a wireless sensor network (WSN) can be seen as the active agents that make up a complex system, just like a bird flock or a fish school, for instance. From this perspective, the tools and models that have been developed to study this kind of systems have been applied. This is in order to create a distributed congestion control based on a set of simple rules programmed at the nodes of the WSN. Our results show that it is possible to adapt the carried traffic to the network capacity, even under stressing conditions. Also, the network performance shows a smooth degradation when the traffic goes beyond a threshold which is settled by the proposed self-organized control. In contrast, without any control, the network collapses before this threshold. The use of the proposed solution provides an effective strategy to address some of the common problems found in WSN deployment by providing a fair packet delivery. In addition, the network congestion is mitigated using adaptive traffic mechanisms based on a satisfaction parameter assessed by each packet which has impact on the global satisfaction of the traffic carried by the WSN.

In this paper, a cognitive radio network (CRN) model is presented. In this model, the control of the CRN is distributed among the frequency spectrum considered for transmission using cognitive pilot channels (CPCs). This control is performed by using frequency-division and time-division multiplexing techniques. Frequency-division is used to divide the spectrum into predetermined frequency slots in which cognitive radio users (CRUs) communicate. Then, the frequency slots are divided into sub-frequency slots, some of which are defined as CPC and used by the CRUs to communicate with a central cognitive base station (CCBS) and to determine availability in a frequency slot. Time-division is used to determine if a primary user (PU) has accessed the channel used by CRUs. Using this time-division approach, presence of PUs is detected. We have designed a CRN able to work with today's available technologies and CRU devices that use different frequency bands of operation. Results of the performance of the network will be presented in terms of the number of CRU and the time these CRUs use the CPCs for control.

Certain methods for implementing chaotic maps can lead to dynamic degradation of the generated number sequences. To solve such a problem, we develop a method for generating pseudorandom number sequences based on multiple one-dimensional chaotic maps. In particular, we introduce a Bernoulli chaotic map that utilizes function transformations and constraints on its control parameter, covering complementary regions of the phase space. This approach allows the generation of chaotic number sequences with a wide coverage of phase space, thereby increasing the uncertainty in the number sequence generation process. Moreover, by incorporating a scaling factor and a sine function, we develop a robust chaotic map, called the Sine-Multiple Modified Bernoulli Chaotic Map (SM-MBCM), which ensures a high degree of randomness, validated through statistical mechanics analysis tools. Using the SM-MBCM, we propose a chaotic PRNG (CPRNG) and evaluate its quality through correlation coefficient analysis, key sensitivity tests, statistical and entropy analysis, key space evaluation, linear complexity analysis, and performance tests. Furthermore, we present an FPGA-based implementation scheme that leverages equivalent MBCM variants to optimize the electronic implementation process. Finally, we compare the proposed system with existing designs in terms of throughput and key space.