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

Scheduling Problems

Scheduling is defined as the process of assigning operations to resources over time to optimize a criterion. Problems with scheduling comprise both a set of resources and a set of a consumers. As such, managing scheduling problems involves managing the use of resources by several consumers. This book presents some new applications and trends related to task and data scheduling. In particular, chapters focus on data science, big data, high-performance computing, and Cloud computing environments. In addition, this book presents novel algorithms and literature reviews that will guide current and new researchers who work with load balancing, scheduling, and allocation problems

Advanced Modeling and Research in Hybrid Microgrid Control and Optimization

This book presents the latest solutions in fuel cell (FC) and renewable energy implementation in mobile and stationary applications. The implementation of advanced energy management and optimization strategies are detailed for fuel cell and renewable microgrids, and for the multi-FC stack architecture of FC/electric vehicles to enhance the reliability of these systems and to reduce the costs related to energy production and maintenance. Cyber-security methods based on blockchain technology to increase the resilience of FC renewable hybrid microgrids are also presented. Therefore, this book is for all readers interested in these challenging directions of research

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

State-of-the-Art Renewable Energy in Korea

Nowadays, renewable energy plays an important role in our daily lives. This Special Issue addresses the current trend in the use of renewable energy in South Korea. The first aspect is a renewable-based power system, where both main and ancillary supplies are sourced from renewable energies; the second aspect is a distribution network for renewable energy; and the last aspect is a nanogrid network technology. Renewable energy requires many innovations over existing power infrastructure and regulation. These articles show the changing trend in various sectors in Korea

Intelligent instance selection techniques for support vector machine speed optimization with application to e-fraud detection.

Doctor of Philosophy in Computer Science. University of KwaZulu-Natal, Durban 2017.Decision-making is a very important aspect of many businesses. There are grievous penalties involved in wrong decisions, including financial loss, damage of company reputation and reduction in company productivity. Hence, it is of dire importance that managers make the right decisions. Machine Learning (ML) simplifies the process of decision making: it helps to discover useful patterns from historical data, which can be used for meaningful decision-making. The ability to make strategic and meaningful decisions is dependent on the reliability of data. Currently, many organizations are overwhelmed with vast amounts of data, and unfortunately, ML algorithms cannot effectively handle large datasets. This thesis therefore proposes seven filter-based and five wrapper-based intelligent instance selection techniques for optimizing the speed and predictive accuracy of ML algorithms, with a particular focus on Support Vector Machine (SVM). Also, this thesis proposes a novel fitness function for instance selection. The primary difference between the filter-based and wrapper-based technique is in their method of selection. The filter-based techniques utilizes the proposed fitness function for selection, while the wrapper-based technique utilizes SVM algorithm for selection. The proposed techniques are obtained by fusing SVM algorithm with the following Nature Inspired algorithms: flower pollination algorithm, social spider algorithm, firefly algorithm, cuckoo search algorithm and bat algorithm. Also, two of the filter-based techniques are boundary detection algorithms, inspired by edge detection in image processing and edge selection in ant colony optimization. Two different sets of experiments were performed in order to evaluate the performance of the proposed techniques (wrapper-based and filter-based). All experiments were performed on four datasets containing three popular e-fraud types: credit card fraud, email spam and phishing email. In addition, experiments were performed on 20 datasets provided by the well-known UCI data repository. The results show that the proposed filter-based techniques excellently improved SVM training speed in 100% (24 out of 24) of the datasets used for evaluation, without significantly affecting SVM classification quality. Moreover, experimental results also show that the wrapper-based techniques consistently improved SVM predictive accuracy in 78% (18 out of 23) of the datasets used for evaluation and simultaneously improved SVM training speed in all cases. Furthermore, two different statistical tests were conducted to further validate the credibility of the results: Freidman’s test and Holm’s post-hoc test. The statistical test results reveal that the proposed filter-based and wrapper-based techniques are significantly faster, compared to standard SVM and some existing instance selection techniques, in all cases. Moreover, statistical test results also reveal that Cuckoo Search Instance Selection Algorithm outperform all the proposed techniques, in terms of speed. Overall, the proposed techniques have proven to be fast and accurate ML-based e-fraud detection techniques, with improved training speed, predictive accuracy and storage reduction. In real life application, such as video surveillance and intrusion detection systems, that require a classifier to be trained very quickly for speedy classification of new target concepts, the filter-based techniques provide the best solutions; while the wrapper-based techniques are better suited for applications, such as email filters, that are very sensitive to slight changes in predictive accuracy

Proceedings of the Second International Mobile Satellite Conference (IMSC 1990)

Presented here are the proceedings of the Second International Mobile Satellite Conference (IMSC), held June 17-20, 1990 in Ottawa, Canada. Topics covered include future mobile satellite communications concepts, aeronautical applications, modulation and coding, propagation and experimental systems, mobile terminal equipment, network architecture and control, regulatory and policy considerations, vehicle antennas, and speech compression