Improved Resource Allocation for TV White Space Network Based on Modified Firefly Algorithm

There is continued increased demand for dynamic spectrum access of TV White Spaces (TVWS) due to growing need for wireless broadband. Some of the use cases such as cellular (2G/3G/4G/5G) access to TVWS may have a high density of users that want to make use of TVWS. When there is a high density of secondary users (SUs) in a TVWS network, there is possibility of high interference among SUs that exceeds the desired threshold and also harmful interference to primary users (PUs). Optimization of resource allocation (power and spectrum allocation) is therefore necessary so as to protect PUs against harmful interference and to reduce the level of interference among SUs. Existing resource allocation optimization algorithms for a TVWS network ignore adjacent channel interference, interference among SUs or apply greedy algorithms which result in sub-optimal resource allocation. In this paper we propose an improved resource allocation algorithm based on continuous-binary firefly algorithm. Simulation is done using Matlab. Simulation results show that the proposed algorithm improves the SU sum throughput and SU signal to interference noise(SINR) ratio in the secondary network

Novel Resource Allocation Algorithm for TV White Space Networks Using Hybrid Firefly Algorithm

There is continued increased demand for dynamic spectrum access of TV White Spaces (TVWS) due to growing need for wireless broadband. Some of the use cases such as cellular (2G/3G/4G/5G) access to TVWS may have a high density of users that want to make use of TVWS. When there is a high of density secondary users (SUs) in a TVWS network, there is possibility of high interference among SUs that exceeds the desired threshold and also harmful interference to primary users (PUs). Optimization of resource allocation (power and spectrum allocation) is therefore necessary so as to protect the PUs against the harmful interference and to reduce the level of interference among SUs. In this paper, a novel and improved resource allocation algorithm based on hybrid firefly algorithm, genetic algorithm  and particle swarm optimization (FAGAPSO) has been designed and applied for joint power and spectrum allocation. Computer simulations have been done using Matlab to validate the performance of the proposed algorithm.   Simulation results show that compared to firefly algorithm (FA), particle swarm optimization (PSO) and genetic algorithm (GA), the algorithm improves the PU SINR, SU sum throughput and SU signal to interference noise (SINR) ratio in a TVWS network. Only one algorithm considered (SAP) has better PU SINR, SU sum throughput and SU signal to interference noise (SINR) ratio in a TVWS network but it has poor running time

Improved Resource Allocation Model for Reducing Interference Among Secondary Users in TV White Space for Broadband Services

This research article was published by IEEE Access 2022In recent years, the Television White Space has attracted the interest of many researchers due to its propagation characteristics obtainable between 470MHz and 790MHz spectrum bands. However, aggre- gate interference increase when secondary users in wireless network increase. Aggregate interference on the side of Primary Users has been extensively scrutinized. Therefore, resource allocation (power and spectrum) is crucial when designing the Television White Space network to avoid interferences from Secondary Users to Primary Users and among Secondary Users themselves. This study proposes a resource allocation model that uses joint power and spectrum hybrid Particle Swarm Optimization, Firefly, and Genetic algorithm for reducing the aggregate interference among Secondary Users. The algorithm is integrated with the admission control algorithm so that; there is a possibility of removing some of the Secondary Users in the network whenever the Signal to Noise Ratio threshold for Secondary and Primary Users is not met. We considered an infeasible system whereby all Secondary and Primary Users may not be supported simultaneously. Metrics such as Primary User Signal-to-noise ratio, sum throughput, and secondary user signal-to-noise ratio less than the threshold used to compare the performance of the proposed algorithm and the results show that PSOFAGA with effective link gain ratio admission control has the best performance compared to particle swarm optimization, genetic algorithm, firefly algorithm, and PSOFAGA algorith

A Review on Computational Intelligence Techniques in Cloud and Edge Computing

Cloud computing (CC) is a centralized computing paradigm that accumulates resources centrally and provides these resources to users through Internet. Although CC holds a large number of resources, it may not be acceptable by real-time mobile applications, as it is usually far away from users geographically. On the other hand, edge computing (EC), which distributes resources to the network edge, enjoys increasing popularity in the applications with low-latency and high-reliability requirements. EC provides resources in a decentralized manner, which can respond to users’ requirements faster than the normal CC, but with limited computing capacities. As both CC and EC are resource-sensitive, several big issues arise, such as how to conduct job scheduling, resource allocation, and task offloading, which significantly influence the performance of the whole system. To tackle these issues, many optimization problems have been formulated. These optimization problems usually have complex properties, such as non-convexity and NP-hardness, which may not be addressed by the traditional convex optimization-based solutions. Computational intelligence (CI), consisting of a set of nature-inspired computational approaches, recently exhibits great potential in addressing these optimization problems in CC and EC. This article provides an overview of research problems in CC and EC and recent progresses in addressing them with the help of CI techniques. Informative discussions and future research trends are also presented, with the aim of offering insights to the readers and motivating new research directions

Differential Evolution in Wireless Communications: A Review

Differential Evolution (DE) is an evolutionary computational method inspired by the biological processes of evolution and mutation. DE has been applied in numerous scientific fields. The paper presents a literature review of DE and its application in wireless communication. The detailed history, characteristics, strengths, variants and weaknesses of DE were presented. Seven broad areas were identified as different domains of application of DE in wireless communications. It was observed that coverage area maximisation and energy consumption minimisation are the two major areas where DE is applied. Others areas are quality of service, updating mechanism where candidate positions learn from a large diversified search region, security and related field applications. Problems in wireless communications are often modelled as multiobjective optimisation which can easily be tackled by the use of DE or hybrid of DE with other algorithms. Different research areas can be explored and DE will continue to be utilized in this contex

Techniques for Decentralized and Dynamic Resource Allocation

abstract: This thesis investigates three different resource allocation problems, aiming to achieve two common goals: i) adaptivity to a fast-changing environment, ii) distribution of the computation tasks to achieve a favorable solution. The motivation for this work relies on the modern-era proliferation of sensors and devices, in the Data Acquisition Systems (DAS) layer of the Internet of Things (IoT) architecture. To avoid congestion and enable low-latency services, limits have to be imposed on the amount of decisions that can be centralized (i.e. solved in the ``cloud") and/or amount of control information that devices can exchange. This has been the motivation to develop i) a lightweight PHY Layer protocol for time synchronization and scheduling in Wireless Sensor Networks (WSNs), ii) an adaptive receiver that enables Sub-Nyquist sampling, for efficient spectrum sensing at high frequencies, and iii) an SDN-scheme for resource-sharing across different technologies and operators, to harmoniously and holistically respond to fluctuations in demands at the eNodeB' s layer. The proposed solution for time synchronization and scheduling is a new protocol, called PulseSS, which is completely event-driven and is inspired by biological networks. The results on convergence and accuracy for locally connected networks, presented in this thesis, constitute the theoretical foundation for the protocol in terms of performance guarantee. The derived limits provided guidelines for ad-hoc solutions in the actual implementation of the protocol. The proposed receiver for Compressive Spectrum Sensing (CSS) aims at tackling the noise folding phenomenon, e.g., the accumulation of noise from different sub-bands that are folded, prior to sampling and baseband processing, when an analog front-end aliasing mixer is utilized. The sensing phase design has been conducted via a utility maximization approach, thus the scheme derived has been called Cognitive Utility Maximization Multiple Access (CUMMA). The framework described in the last part of the thesis is inspired by stochastic network optimization tools and dynamics. While convergence of the proposed approach remains an open problem, the numerical results here presented suggest the capability of the algorithm to handle traffic fluctuations across operators, while respecting different time and economic constraints. The scheme has been named Decomposition of Infrastructure-based Dynamic Resource Allocation (DIDRA).Dissertation/ThesisDoctoral Dissertation Electrical Engineering 201

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