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

A metaheuristic and simheuristic approach for the p-Hub median problem from a telecommunication perspective

Tese (doutorado)—Universidade de Brasília, Faculdade de Tecnologia, Departamento de Engenharia Elétrica, 2018.Avanços recentes no setor das telecomunicações oferecem grandes oportunidades para cidadãos e organizações em um mundo globalmente conectado, ao mesmo tempo em que surge um vasto número de desafios complexos que os engenheiros devem enfrentar. Alguns desses desafios podem ser modelados como problemas de otimização. Alguns exemplos incluem o problema de alocação de recursos em redes de comunicações, desenho de topologias de rede que satisfaça determinadas propriedades associadas a requisitos de qualidade de serviço, sobreposição de redes multicast e outros recursos importantes para comunicação de origem a destino. O primeiro objetivo desta tese é fornecer uma revisão sobre como as metaheurísticas têm sido usadas até agora para lidar com os problemas de otimização associados aos sistemas de telecomunicações, detectando as principais tendências e desafios. Particularmente, a análise enfoca os problemas de desenho, roteamento e alocação de recursos. Além disso, devido á natureza desses desafios, o presente trabalho discute como a hibridização de metaheurísticas com metodologias como simulação pode ser empregada para ampliar as capacidades das metaheurísticas na resolução de problemas de otimização estocásticos na indústria de telecomunicações. Logo, é analisado um problema de otimização com aplicações práticas para redes de telecomunica ções: o problema das p medianas não capacitado em que um número fixo de hubs tem capacidade ilimitada, cada nó não-hub é alocado para um único hub e o número de hubs é conhecido de antemão, sendo analisado em cenários determinísticos e estocásticos. Dada a sua variedade e importância prática, o problema das p medianas vem sendo aplicado e estudado em vários contextos. Seguidamente, propõem-se dois algoritmos imune-inspirados e uma metaheurística de dois estágios, que se baseia na combinação de técnicas tendenciosas e aleatórias com uma estrutura de busca local iterada, além de sua integração com a técnica de simulação de Monte Carlo para resolver o problema das p medianas. Para demonstrar a eficiência dos algoritmos, uma série de testes computacionais é realizada, utilizando instâncias de grande porte da literatura. Estes resultados contribuem para uma compreensão mais profunda da eficácia das metaheurísticas empregadas para resolver o problema das p medianas em redes pequenas e grandes. Por último, uma aplicaçã o ilustrativa do problema das p medianas é apresentada, bem como alguns insights sobre novas possibilidades para ele, estendendo a metodologia proposta para ambientes da vida real.Recent advances in the telecommunication industry o er great opportunities to citizens and organizations in a globally-connected world, but they also arise a vast number of complex challenges that decision makers must face. Some of these challenges can be modeled as optimization problems. Examples include the framework of network utility maximization for resource allocation in communication networks, nding a network topology that satis es certain properties associated with quality of service requirements, overlay multicast networks, and other important features for source to destination communication. First, this thesis provides a review on how metaheuristics have been used so far to deal with optimization problems associated with telecommunication systems, detecting the main trends and challenges. Particularly the analysis focuses on the network design, routing, and allocation problems. In addition, due to the nature of these challenges, this work discusses how the hybridization of metaheuristics with methodologies such as simulation can be employed to extend the capabilities of metaheuristics when solving stochastic optimization problems. Then, a popular optimization problem with practical applications to the design of telecommunication networks: the Uncapacitated Single Allocation p-Hub Median Problem (USApHMP) where a xed number of hubs have unlimited capacity, each non-hub node is allocated to a single hub and the number of hubs is known in advance is analyzed in deterministic and stochastic scenarios. p-hub median problems are concerned with optimality of telecommunication and transshipment networks, and seek to minimize the cost of transportation or establishing. Next, two immune inspired metaheuristics are proposed to solve the USApHMP, besides that, a two-stage metaheuristic which relies on the combination of biased-randomized techniques with an iterated local search framework and its integration with simulation Monte Carlo technique for solving the same problem is proposed. In order to show their e ciency, a series of computational tests are carried out using small and large size instances from the literature. These results contribute to a deeper understanding of the e ectiveness of the employed metaheuristics for solving the USApHMP in small and large networks. Finally, an illustrative application of the USApHMP is presented as well as some insights about some new possibilities for it, extending the proposed methodology to real-life environments.Els últims avenços en la industria de les telecomunicacions ofereixen grans oportunitats per ciutadans i organitzacions en un món globalment connectat, però a la vegada, presenten reptes als que s'enfronten tècnics i enginyers que prenen decisions. Alguns d'aquests reptes es poden modelitzar com problemes d'optimització. Exemples inclouen l'assignació de recursos a les xarxes de comunicació, trobant una topologia de xarxa que satisfà certes propietats associades a requisits de qualitat de servei, xarxes multicast superposades i altres funcions importants per a la comunicació origen a destinació. El primer objectiu d'aquest treball és proporcionar un revisió de la literatura sobre com s'han utilitzat aquestes tècniques, tradicionalment, per tractar els problemes d'optimització associats a sistemes de telecomunicació, detectant les principals tendències i desa aments. Particularment, l'estudi es centra en els problemes de disseny de xarxes, enrutament i problemes d'assignació de recursos. Degut a la naturalesa d'aquests problemes, aquest treball també analitza com es poden combinar les tècniques metaheurístiques amb metodologies de simulació per ampliar les capacitats de resoldre problemes d'optimització estocàstics. A més, es tracta un popular problema d'optimització amb aplicacions pràctiques per xarxes de telecomunicació, el problema de la p mediana no capacitat, analitzant-lo des d'escenaris deterministes i estocàstics. Aquest problema consisteix en determinar el nombre d'instal lacions (medianes) en una xarxa, minimitzant la suma de tots els costs o distàncies des d'un punt de demanda a la instal lació més propera. En general, el problema de la p mediana està lligat amb l'optimització de xarxes de telecomunicacions i de transport, i busquen minimitzar el cost de transport o establiment de la xarxa. Es proposa dos algoritmes immunològics i un algoritme metaheurístic de dues etapes basat en la combinació de tècniques aleatòries amb simulacions Monte Carlo. L'e ciència de les algoritmes es posa a prova mitjançant alguns dels test computacionals més utilitzats a la literatura, obtenint uns resultats molt satisfactoris, ja que es capaç de resoldre casos petits i grans en qüestió de segons i amb un baix cost computacional. Finalment, es presenta una aplicació il lustrativa del problema de la p mediana, així com algunes noves idees sobre aquest, que estenen la metodologia proposta a problemes de la vida real

Diseño de la Red De Nueva Generación Tipo Mesh, para la Atención Y Prevención De Emergencias En Bogotá, En La Banda De 4,9 Ghz, Bajo La Resolución 1661 de 18 De Julio De 2006 para la Coordinación De Acciones De Socorro Y Salvamento.

Las redes inalámbricas son vitales en situaciones de emergencia, estas deben ser adaptativas, robustas y contar con la menor intervención posible del hombre en su operación, con arquitectura cambiante según las situaciones o fenómenos presentados, deben tener redundancia, escalabilidad, auto conformación y auto regeneración, bondades que ofrecen las redes Mesh. Este tipo de redes son una evolución de WIFI y una extensión de las redes Ad Hoc permitiendo la descentralización del envío de la información entre los nodos, estas redes están constituidas por enrutadores Mesh y clientes Mesh, como elementos vitales para su formación, en esta investigación se propone una red heterogénea (nodos móviles y fijos). Las redes malladas responden como alternativas fuertes en un evento de gran magnitud como lo es un Terremoto, de esta forma se mantienen comunicación entre diferentes entidades conformando una red heterogénea con nodos fijos y nodos móviles, de esta forma se crean redes redundantes y adaptativas transportando información vital en emergencia indiferente de operadores o de sistemas ya establecidos, todo esto se ha realizado bajo un ambiente simulado en la herramienta de redes NS-2; integrándolo al marco legal vigente como lo es la resolución 1661 de 2006 en la cual se dispone de anchos de banda de 1 a 20 MHz en la banda de 4,9 GHz para comunicaciones de emergencia. Permitiendo realizar sistemas de comunicaciones robustos y capaz de ofrecer diversos servicios, todos sobre una red de banda ancha inalámbrica heterogénea como la propuesta en esta tesis.Abstract. Wireless networks are vital in emergency situations, they must be adaptive, robust and have the least possible human intervention in its operation, with changing architecture according to situations or phenomena presented, must have redundancy, scalability, self-forming and self-healing, offering bounties mesh networks. Such networks are an evolution of WIFI and an extension of the Ad Hoc networks allowing decentralization of sending information between nodes, these networks consist of mesh routers and mesh clients, as vital to its formation, this research proposes a heterogeneous network (fixed and mobile nodes). Respond mesh networks as a powerful alternative major event such as an earthquake, thereby maintaining communication between different network entities forming a heterogeneous fixed nodes and mobile nodes, thus redundant networks are created carrying information and adaptive indifferent vital emergency operators or established systems, all this has been done under a simulated environment in the networking tool NS-2, integrating the existing legal framework such as the resolution 1661 of 2006 in which, wide band of 1-20 Megas in the band of 4.9 GHz for emergency communications. Allowing perform robust communications systems capable of providing various services, all on a network of heterogeneous wireless broadband as proposed in this thesis.Maestrí

Novel Approaches for the Performance Enhancement of Cognitive Radio Networks

This research is dedicated to the study of the challenges faced by Cognitive Radio (CR) networks, which include self-coexistence of the networks in the spectral environment, security and performance threats from malicious entities, and fairness in spectrum contention and utilization. We propose novel channel acquisition schemes that allow decentralized CR networks to have multiple channel access with minimal spectrum contentions. The multiple channel acquisition schemes facilitate fast spectrum access especially in cases where networks cannot communicate with each other. These schemes enable CR networks to self-organize and adapt to the dynamically changing spectral environment. We also present a self-coexistence mechanism that allows CR networks to coexist via the implementation of a risk-motivated channel selection based deference structure (DS). By forming DS coalitions, CR networks are able to have better access to preferred channels and can defer transmission to one another, thereby mitigating spectrum conflicts. CR networks are also known to be susceptible to Sybil threats from smart malicious radios with either monopolistic or disruptive intentions. We formulate novel threat and defense mechanisms to combat Sybil threats and minimize their impact on the performance of CR networks. A dynamic reputation system is proposed that considerably minimizes the effectiveness of intelligent Sybil attacks and improves the accuracy of spectrum-based decision-making processes. Finally, we present a distributed and cheat-proof spectrum contention protocol as an enhancement of the adaptive On-Demand Spectrum Contention (ODSC) protocol. The Modified On-Demand Spectrum Contention (MODSC) protocol enhances fairness and efficiency of spectrum access. We also show that there is substantial improvement in spectrum utilization with the incorporation of channel reuse into the MODSC protocol

Optimising routing and trustworthiness of ad hoc networks using swarm intelligence

This thesis was submitted for the degree of Doctor of Philsophy and awarded by Brunel UniversityThis thesis proposes different approaches to address routing and security of MANETs using swarm technology. The mobility and infrastructure-less of MANET as well as nodes misbehavior compose great challenges to routing and security protocols of such a network. The first approach addresses the problem of channel assignment in multichannel ad hoc networks with limited number of interfaces, where stable route are more preferred to be selected. The channel selection is based on link quality between the nodes. Geographical information is used with mapping algorithm in order to estimate and predict the links’ quality and routes life time, which is combined with Ant Colony Optimization (ACO) algorithm to find most stable route with high data rate. As a result, a better utilization of the channels is performed where the throughput increased up to 74% over ASAR protocol. A new smart data packet routing protocol is developed based on the River Formation Dynamics (RFD) algorithm. The RFD algorithm is a subset of swarm intelligence which mimics how rivers are created in nature. The protocol is a distributed swarm learning approach where data packets are smart enough to guide themselves through best available route in the network. The learning information is distributed throughout the nodes of the network. This information can be used and updated by successive data packets in order to maintain and find better routes. Data packets act like swarm agents (drops) where they carry their path information and update routing information without the need for backward agents. These data packets modify the routing information based on different network metrics. As a result, data packet can guide themselves through better routes. In the second approach, a hybrid ACO and RFD smart data packet routing protocol is developed where the protocol tries to find shortest path that is less congested to the destination. Simulation results show throughput improvement by 30% over AODV protocol and 13% over AntHocNet. Both delay and jitter have been improved more than 96% over AODV protocol. In order to overcome the problem of source routing introduced due to the use of the ACO algorithm, a solely RFD based distance vector protocol has been developed as a third approach. Moreover, the protocol separates reactive learned information from proactive learned information to add more reliability to data routing. To minimize the power consumption introduced due to the hybrid nature of the RFD routing protocol, a forth approach has been developed. This protocol tackles the problem of power consumption and adds packets delivery power minimization to the protocol based on RFD algorithm. Finally, a security model based on reputation and trust is added to the smart data packet protocol in order to detect misbehaving nodes. A trust system has been built based on the privilege offered by the RFD algorithm, where drops are always moving from higher altitude to lower one. Moreover, the distributed and undefined nature of the ad hoc network forces the nodes to obligate to cooperative behaviour in order not to be exposed. This system can easily and quickly detect misbehaving nodes according to altitude difference between active intermediate nodes

Routage adaptatif et stabilité dans les réseaux maillés sans fil

Grâce à leur flexibilité et à leur facilité d’installation, les réseaux maillés sans fil (WMNs) permettent un déploiement d’une infrastructure à faible coût. Ces réseaux étendent la couverture des réseaux filaires permettant, ainsi, une connexion n’importe quand et n’importe où. Toutefois, leur performance est dégradée par les interférences et la congestion. Ces derniers causent des pertes de paquets et une augmentation du délai de transmission d’une façon drastique. Dans cette thèse, nous nous intéressons au routage adaptatif et à la stabilité dans ce type de réseaux. Dans une première partie de la thèse, nous nous intéressons à la conception d’une métrique de routage et à la sélection des passerelles permettant d’améliorer la performance des WMNs. Dans ce contexte nous proposons un protocole de routage à la source basé sur une nouvelle métrique. Cette métrique permet non seulement de capturer certaines caractéristiques des liens tels que les interférences inter-flux et intra-flux, le taux de perte des paquets mais également la surcharge des passerelles. Les résultats numériques montrent que la performance de cette métrique est meilleure que celle des solutions proposées dans la littérature. Dans une deuxième partie de la thèse, nous nous intéressons à certaines zones critiques dans les WMNs. Ces zones se trouvent autour des passerelles qui connaissent une concentration plus élevé du trafic ; elles risquent de provoquer des interférences et des congestions. À cet égard, nous proposons un protocole de routage proactif et adaptatif basé sur l’apprentissage par renforcement et qui pénalise les liens de mauvaise qualité lorsqu’on s’approche des passerelles. Un chemin dont la qualité des liens autour d’une passerelle est meilleure sera plus favorisé que les autres chemins de moindre qualité. Nous utilisons l’algorithme de Q-learning pour mettre à jour dynamiquement les coûts des chemins, sélectionner les prochains nœuds pour faire suivre les paquets vers les passerelles choisies et explorer d’autres nœuds voisins. Les résultats numériques montrent que notre protocole distribué, présente de meilleurs résultats comparativement aux protocoles présentés dans la littérature. Dans une troisième partie de cette thèse, nous nous intéressons aux problèmes d’instabilité des réseaux maillés sans fil. En effet, l’instabilité se produit à cause des changements fréquents des routes qui sont causés par les variations instantanées des qualités des liens dues à la présence des interférences et de la congestion. Ainsi, après une analyse de l’instabilité, nous proposons d’utiliser le nombre de variations des chemins dans une table de routage comme indicateur de perturbation des réseaux et nous utilisons la fonction d’entropie, connue dans les mesures de l’incertitude et du désordre des systèmes, pour sélectionner les routes stables. Les résultats numériques montrent de meilleures performances de notre protocole en comparaison avec d’autres protocoles dans la littérature en termes de débit, délai, taux de perte des paquets et l’indice de Gini.Thanks to their flexibility and their simplicity of installation, Wireless Mesh Networks (WMNs) allow a low cost deployment of network infrastructure. They can be used to extend wired networks coverage allowing connectivity anytime and anywhere. However, WMNs may suffer from drastic performance degradation (e.g., increased packet loss ratio and delay) because of interferences and congestion. In this thesis, we are interested in adaptive routing and stability in WMNs. In the first part of the thesis, we focus on defining new routing metric and gateway selection scheme to improve WMNs performance. In this context, we propose a source routing protocol based on a new metric which takes into account packet losses, intra-flow interferences, inter-flow interferences and load at gateways together to select best paths to best gateways. Simulation results show that the proposed metric improves the network performance and outperforms existing metrics in the literature. In the second part of the thesis, we focus on critical zones, in WMNs, that consist of mesh routers which are located in neighborhoods of gateways where traffic concentration may occur. This traffic concentration may increase congestion and interferences excessively on wireless channels around the gateways. Thus, we propose a proactive and adaptive routing protocol based on reinforcement learning which increasingly penalizes links with bad quality as we get closer to gateways. We use Q-learning algorithm to dynamically update path costs and to select the next hop each time a packet is forwarded toward a given gateway; learning agents in each mesh router learn the best link to forward an incoming packet and explore new alternatives in the future. Simulation results show that our distributed routing protocol is less sensitive to interferences and outperforms existing protocols in the literature. In the third part of this thesis, we focus on the problems of instability in WMNs. Instability occurs when routes flapping are frequent. Routes flapping are caused by the variations of link quality due to interferences and congestion. Thus, after analyzing factors that may cause network instability, we propose to use the number of path variations in routing tables as an indicator of network instability. Also, we use entropy function, usually used to measure uncertainty and disorder in systems, to define node stability, and thus, select the most stable routes in the WMNs. Simulation results show that our stability-based routing protocol outperforms existing routing protocols in the literature in terms of throughput, delay, loss rate, and Gini index

A new connectivity strategy for wireless mesh networks using dynamic spectrum access

The introduction of Dynamic Spectrum Access (DSA) marked an important juncture in the evolution of wireless networks. DSA is a spectrum assignment paradigm where devices are able to make real-time adjustment to their spectrum usage and adapt to changes in their spectral environment to meet performance objectives. DSA allows spectrum to be used more efficiently and may be considered as a viable approach to the ever increasing demand for spectrum in urban areas and the need for coverage extension to unconnected communities. While DSA can be applied to any spectrum band, the initial focus has been in the Ultra-High Frequency (UHF) band traditionally used for television broadcast because the band is lightly occupied and also happens to be ideal spectrum for sparsely populated rural areas. Wireless access in general is said to offer the most hope in extending connectivity to rural and unconnected peri-urban communities. Wireless Mesh Networks (WMN) in particular offer several attractive characteristics such as multi-hopping, ad-hoc networking, capabilities of self-organising and self-healing, hence the focus on WMNs. Motivated by the desire to leverage DSA for mesh networking, this research revisits the aspect of connectivity in WMNs with DSA. The advantages of DSA when combined with mesh networking not only build on the benefits, but also creates additional challenges. The study seeks to address the connectivity challenge across three key dimensions, namely network formation, link metric and multi-link utilisation. To start with, one of the conundrums faced in WMNs with DSA is that the current 802.11s mesh standard provides limited support for DSA, while DSA related standards such as 802.22 provide limited support for mesh networking. This gap in standardisation complicates the integration of DSA in WMNs as several issues are left outside the scope of the applicable standard. This dissertation highlights the inadequacy of the current MAC protocol in ensuring TVWS regulation compliance in multi-hop environments and proposes a logical link MAC sub-layer procedure to fill the gap. A network is considered compliant in this context if each node operates on a channel that it is allowed to use as determined for example, by the spectrum database. Using a combination of prototypical experiments, simulation and numerical analysis, it is shown that the proposed protocol ensures network formation is accomplished in a manner that is compliant with TVWS regulation. Having tackled the compliance problem at the mesh formation level, the next logical step was to explore performance improvement avenues. Considering the importance of routing in WMNs, the study evaluates link characterisation to determine suitable metric for routing purposes. Along this dimension, the research makes two main contributions. Firstly, A-link-metric (Augmented Link Metric) approach for WMN with DSA is proposed. A-link-metric reinforces existing metrics to factor in characteristics of a DSA channel, which is essential to improve the routing protocol's ranking of links for optimal path selection. Secondly, in response to the question of “which one is the suitable metric?”, the Dynamic Path Metric Selection (DPMeS) concept is introduced. The principal idea is to mechanise the routing protocol such that it assesses the network via a distributed probing mechanism and dynamically binds the routing metric. Using DPMeS, a routing metric is selected to match the network type and prevailing conditions, which is vital as each routing metric thrives or recedes in performance depending on the scenario. DPMeS is aimed at unifying the years worth of prior studies on routing metrics in WMNs. Simulation results indicate that A-link-metric achieves up to 83.4 % and 34.6 % performance improvement in terms of throughput and end-to-end delay respectively compared to the corresponding base metric (i.e. non-augmented variant). With DPMeS, the routing protocol is expected to yield better performance consistently compared to the fixed metric approach whose performance fluctuates amid changes in network setup and conditions. By and large, DSA-enabled WMN nodes will require access to some fixed spectrum to fall back on when opportunistic spectrum is unavailable. In the absence of fully functional integrated-chip cognitive radios to enable DSA, the immediate feasible solution for the interim is single hardware platforms fitted with multiple transceivers. This configuration results in multi-band multi-radio node capability that lends itself to a variety of link options in terms of transmit/receive radio functionality. The dissertation reports on the experimental performance evaluation of radios operating in the 5 GHz and UHF-TVWS bands for hybrid back-haul links. It is found that individual radios perform differently depending on the operating parameter settings, namely channel, channel-width and transmission power subject to prevailing environmental (both spectral and topographical) conditions. When aggregated, if the radios' data-rates are approximately equal, there is a throughput and round-trip time performance improvement of 44.5 - 61.8 % and 7.5 - 41.9 % respectively. For hybrid links comprising radios with significantly unequal data-rates, this study proposes an adaptive round-robin (ARR) based algorithm for efficient multilink utilisation. Numerical analysis indicate that ARR provides 75 % throughput improvement. These results indicate that network optimisation overall requires both time and frequency division duplexing. Based on the experimental test results, this dissertation presents a three-layered routing framework for multi-link utilisation. The top layer represents the nodes' logical interface to the WMN while the bottom layer corresponds to the underlying physical wireless network interface cards (WNIC). The middle layer is an abstract and reductive representation of the possible and available transmission, and reception options between node pairs, which depends on the number and type of WNICs. Drawing on the experimental results and insight gained, the study builds criteria towards a mechanism for auto selection of the optimal link option. Overall, this study is anticipated to serve as a springboard to stimulate the adoption and integration of DSA in WMNs, and further development in multi-link utilisation strategies to increase capacity. Ultimately, it is hoped that this contribution will collectively contribute effort towards attaining the global goal of extending connectivity to the unconnected