Optimisation de la gestion des interférences inter-cellulaires et de l'attachement des mobiles dans les réseaux cellulaires LTE

Driven by an exponential growth in mobile broadband-enabled devices and a continue dincrease in individual data consumption, mobile data traffic has grown 4000-fold over the past 10 years and almost 400-million-fold over the past 15 years. Homogeneouscellular networks have been facing limitations to handle soaring mobile data traffic and to meet the growing end-user demand for more bandwidth and betterquality of experience. These limitations are mainly related to the available spectrumand the capacity of the network. Telecommunication industry has to address these challenges and meet exploding demand. At the same time, it has to guarantee a healthy economic model to reduce the carbon footprint which is caused by mobile communications.Heterogeneous Networks (HetNets), composed of macro base stations and low powerbase stations of different types, are seen as the key solution to improve spectral efficiency per unit area and to eliminate coverage holes. In such networks, intelligent user association and interference management schemes are needed to achieve gains in performance. Due to the large imbalance in transmission power between macroand small cells, user association based on strongest signal received is not adapted inHetNets as only few users would attach to low power nodes. A technique based onCell Individual Offset (CIO) is therefore required to perform load balancing and to favor some Small Cell (SC) attraction against Macro Cell (MC). This offset is addedto users’ Reference Signal Received Power (RSRP) measurements and hence inducing handover towards different eNodeBs. As Long Term Evolution (LTE) cellular networks use the same frequency sub-bands, mobile users may experience strong inter-cellxv interference, especially at cell edge. Therefore, there is a need to coordinate resource allocation among the cells and minimize inter-cell interference. To mitigate stronginter-cell interference, the resource, in time, frequency and power domain, should be allocated efficiently. A pattern for each dimension is computed to permit especially for cell edge users to benefit of higher throughput and quality of experience. The optimization of all these parameters can also offer gain in energy use. In this thesis,we propose a concrete versatile dynamic solution performing an optimization of user association and resource allocation in LTE cellular networks maximizing a certainnet work utility function that can be adequately chosen. Our solution, based on gametheory, permits to compute Cell Individual Offset and a pattern of power transmission over frequency and time domain for each cell. We present numerical simulations toillustrate the important performance gain brought by this optimization. We obtain significant benefits in the average throughput and also cell edge user through put of40% and 55% gains respectively. Furthermore, we also obtain a meaningful improvement in energy efficiency. This work addresses industrial research challenges and assuch, a prototype acting on emulated HetNets traffic has been implemented.Conduit par une croissance exponentielle dans les appareils mobiles et une augmentation continue de la consommation individuelle des données, le trafic de données mobiles a augmenté de 4000 fois au cours des 10 dernières années et près de 400millions fois au cours des 15 dernières années. Les réseaux cellulaires homogènes rencontrent de plus en plus de difficultés à gérer l’énorme trafic de données mobiles et à assurer un débit plus élevé et une meilleure qualité d’expérience pour les utilisateurs.Ces difficultés sont essentiellement liées au spectre disponible et à la capacité du réseau.L’industrie de télécommunication doit relever ces défis et en même temps doit garantir un modèle économique pour les opérateurs qui leur permettra de continuer à investir pour répondre à la demande croissante et réduire l’empreinte carbone due aux communications mobiles. Les réseaux cellulaires hétérogènes (HetNets), composés de stations de base macro et de différentes stations de base de faible puissance,sont considérés comme la solution clé pour améliorer l’efficacité spectrale par unité de surface et pour éliminer les trous de couverture. Dans de tels réseaux, il est primordial d’attacher intelligemment les utilisateurs aux stations de base et de bien gérer les interférences afin de gagner en performance. Comme la différence de puissance d’émission est importante entre les grandes et petites cellules, l’association habituelle des mobiles aux stations de bases en se basant sur le signal le plus fort, n’est plus adaptée dans les HetNets. Une technique basée sur des offsets individuelles par cellule Offset(CIO) est donc nécessaire afin d’équilibrer la charge entre les cellules et d’augmenter l’attraction des petites cellules (SC) par rapport aux cellules macro (MC). Cette offset est ajoutée à la valeur moyenne de la puissance reçue du signal de référence(RSRP) mesurée par le mobile et peut donc induire à un changement d’attachement vers différents eNodeB. Comme les stations de bases dans les réseaux cellulaires LTE utilisent les mêmes sous-bandes de fréquences, les mobiles peuvent connaître une forte interférence intercellulaire, en particulier en bordure de cellules. Par conséquent, il est primordial de coordonner l’allocation des ressources entre les cellules et de minimiser l’interférence entre les cellules. Pour atténuer la forte interférence intercellulaire, les ressources, en termes de temps, fréquence et puissance d’émission, devraient être alloués efficacement. Un modèle pour chaque dimension est calculé pour permettre en particulier aux utilisateurs en bordure de cellule de bénéficier d’un débit plus élevé et d’une meilleure qualité de l’expérience. L’optimisation de tous ces paramètres peut également offrir un gain en consommation d’énergie. Dans cette thèse, nous proposons une solution dynamique polyvalente effectuant une optimisation de l’attachement des mobiles aux stations de base et de l’allocation des ressources dans les réseaux cellulaires LTE maximisant une fonction d’utilité du réseau qui peut être choisie de manière adéquate.Notre solution, basée sur la théorie des jeux, permet de calculer les meilleures valeurs pour l’offset individuelle par cellule (CIO) et pour les niveaux de puissance à appliquer au niveau temporel et fréquentiel pour chaque cellule. Nous présentons des résultats des simulations effectuées pour illustrer le gain de performance important apporté par cette optimisation. Nous obtenons une significative hausse dans le débit moyen et le débit des utilisateurs en bordure de cellule avec 40 % et 55 % de gains respectivement. En outre, on obtient un gain important en énergie. Ce travail aborde des défis pour l’industrie des télécoms et en tant que tel, un prototype de l’optimiseur a été implémenté en se basant sur un trafic HetNets émulé

Multicast resource management for next generation mobile communication systems

EThOS - Electronic Theses Online ServiceGBUnited Kingdo

Joint Downlink Beamforming and Discrete Resource Allocation Using Mixed-Integer Programming

Multi-antenna processing is widely adopted as one of the key enabling technologies for current and future cellular networks. Particularly, multiuser downlink beamforming (also known as space-division multiple access), in which multiple users are simultaneously served with spatial transmit beams in the same time and frequency resource, achieves high spectral efficiency with reduced energy consumption. To harvest the potential of multiuser downlink beamforming in practical systems, optimal beamformer design shall be carried out jointly with network resource allocation. Due to the specifications of cellular standards and/or implementation constraints, resource allocation in practice naturally necessitates discrete decision makings, e.g., base station (BS) association, user scheduling and admission control, adaptive modulation and coding, and codebook-based beamforming (precoding). This dissertation focuses on the joint optimization of multiuser downlink beamforming and discrete resource allocation in modern cellular networks. The problems studied in this thesis involve both continuous and discrete decision variables and are thus formulated as mixed-integer programs (MIPs). A systematic MIP framework is developed to address the problems. The MIP framework consists of four components: (i) MIP formulations that support the commercial solver based approach for computing the optimal solutions, (ii) analytic comparisons of the MIP formulations, (iii) customizing techniques for speeding up the MIP solvers, and (iv) low-complexity heuristic algorithms for practical applications. We consider first joint network topology optimization and multi-cell downlink beamforming (JNOB) for coordinated multi-point transmission. The objective is to minimize the overall power consumption of all BSs while guaranteeing the quality-of-service (QoS) requirements of the mobile stations (MSs). A standard mixed-integer second-order cone program (MISOCP) formulation and an extended MISOCP formulation are developed, both of which support the branch-and-cut (BnC) method. Analysis shows that the extended formulation admits tighter continuous relaxations (and hence less computational complexity) than that of the standard formulation. Effective strategies are proposed to customize the BnC method in the MIP solver CPLEX when applying it to the JNOB problem. Low-complexity inflation and deflation procedures are devised for large-scale applications. The simulations show that our design results in sparse network topologies and partial BS cooperation. We study next the joint optimization of discrete rate adaptation and downlink beamforming (DRAB), in which rate adaptation is carried out via modulation and coding scheme (MCS) assignment and admission control is embedded in the MCS assignment procedure. The objective is to achieve the maximum sum-rate with the minimum transmitted BS power. As in the JNOB problem, a standard and an extended MISOCP formulations are developed, and analytic comparisons of the two formulations are carried out. The analysis also leads to efficient customizing strategies for the BnC method in CPLEX. We also develop fast inflation and deflation procedures for applications in large-scale networks. Our numerical results show that the heuristic algorithms yield sum-rates that are very close to the optimal ones. We then turn our attention to codebook-based downlink beamforming. Codebook-based beamforming is employed in the latest cellular standards, e.g., in long-term evolution advanced (LTE-A), to simplify the signaling procedure of beamformers with reduced signaling overhead. We consider first the standard codebook-based downlink beamforming (SCBF) problem, in which precoding vector assignment and power allocation are jointly optimized. The objective is to minimize the total transmitted BS power while ensuring the prescribed QoS targets of the MSs. We introduce a virtual uplink (VUL) problem, which is proved to be equivalent to the SCBF problem. A customized power iteration method is developed to solve optimally the VUL problem and hence the SCBF problem. To improve the performance of codebook-based downlink beamforming, we propose a channel predistortion mechanism that does not introduce any additional signalling overhead or require modification of the mobile receivers. The joint codebook-based downlink beamforming and channel predistortion (CBCP) problem represents a non-convex MIP. An alternating optimization algorithm and an alternating feasibility search algorithm are devised to approximately solve the CBCP problem. The simulation results confirm the efficiency of the channel predistortion scheme, e.g., achieving significant reductions of the total transmitted BS power. We study finally the worst-case robust codebook-based downlink beamforming when only estimated channel covariance matrices are available at the BS. Similar to the DRAB problem, user admission control is embedded in the precoding vector assignment procedure. In the robust codebook-based downlink beamforming and admission control (RCBA) problem, the objective is to achieve the maximum number of admitted MSs with the minimum transmitted BS power. We develop a conservative mixed-integer linear program (MILP) approximation and an exact MISOCP formulation of the RCBA problem. We further propose a low-complexity inflation procedure. Our simulations show that the three approaches yield almost the same average number of admitted MSs, while the MILP based approach requires much more transmitted BS power than the other two to support the admitted MSs. The MIP framework developed in this thesis can be applied to address various discrete resource allocation problems in interference limited cellular networks. Both optimal solutions, i.e., performance benchmarks, and low-complexity practical algorithms are considered in our MIP framework. Conventional approaches often did not adopt the exact discrete models and approximated the discrete variables by (quantized) continuous ones, which could lead to highly suboptimal solutions or infeasible problem instances

Game Theory in Communications:a Study of Two Scenarios

Multi-user communication theory typically studies the fundamental limits of communication systems, and considers communication schemes that approach or even achieve these limits. The functioning of many such schemes assumes that users always cooperate, even when it is not in their own best interest. In practice, this assumption need not be fulfilled, as rational communication participants are often only interested in maximizing their own communication experience, and may behave in an undesirable manner from the system's point of view. Thus, communication systems may operate differently than intended if the behavior of individual participants is not taken into account. In this thesis, we study how users make decisions in wireless settings, by considering their preferences and how they interact with each other. We investigate whether the outcomes of their decisions are desirable, and, if not, what can be done to improve them. In particular, we focus on two related issues. The first is the decision-making of communication users in the absence of any central authority, which we consider in the context of the Gaussian multiple access channel. The second is the pricing of wireless resources, which we consider in the context of the competition of wireless service providers for users who are not contractually tied to any provider, but free to choose the one offering the best tradeoff of parameters. In the first part of the thesis, we model the interaction of self-interested users in a Gaussian multiple access channel using non-cooperative game theory. We demonstrate that the lack of infrastructure leads to an inefficient outcome for users who interact only once, specifically due to the lack of coordination between users. Using evolutionary game theory, we show that this inefficient outcome would also arise as a result of repeated interaction of many individuals over time. On the other hand, if the users correlate their decoding schedule with the outcome of some publicly observed (pseudo) random variable, the resulting outcome is efficient. This shows that sometimes it takes very little intervention on the part of the system planner to make sure that users choose a desirable operating point. In the second part of the thesis, we consider the competition of wireless service providers for users who are free to choose their service provider based on their channel parameters and the resource price. We model this situation as a two-stage game where the providers announce unit resource prices in the first stage and the users choose how much resource they want to purchase from each provider in the second stage. Under fairly general conditions, we show that the competitive interaction of users and providers results in socially optimal resource allocation. We also provide a decentralized primal-dual algorithm and prove its convergence to the socially optimal outcome

Allocation des ressources dans les environnements informatiques en périphérie des réseaux mobiles

Abstract: The evolution of information technology is increasing the diversity of connected devices and leading to the expansion of new application areas. These applications require ultra-low latency, which cannot be achieved by legacy cloud infrastructures given their distance from users. By placing resources closer to users, the recently developed edge computing paradigm aims to meet the needs of these applications. Edge computing is inspired by cloud computing and extends it to the edge of the network, in proximity to where the data is generated. This paradigm leverages the proximity between the processing infrastructure and the users to ensure ultra-low latency and high data throughput. The aim of this thesis is to improve resource allocation at the network edge to provide an improved quality of service and experience for low-latency applications. For better resource allocation, it is necessary to have reliable knowledge about the resources available at any moment. The first contribution of this thesis is to propose a resource representation to allow the supervisory xentity to acquire information about the resources available to each device. This information is then used by the resource allocation scheme to allocate resources appropriately for the different services. The resource allocation scheme is based on Lyapunov optimization, and it is executed only when resource allocation is required, which reduces the latency and resource consumption on each edge device. The second contribution of this thesis focuses on resource allocation for edge services. The services are created by chaining a set of virtual network functions. Resource allocation for services consists of finding an adequate placement for, routing, and scheduling these virtual network functions. We propose a solution based on game theory and machine learning to find a suitable location and routing for as well as an appropriate scheduling of these functions at the network edge. Finding the location and routing of network functions is formulated as a mean field game solved by iterative Ishikawa-Mann learning. In addition, the scheduling of the network functions on the different edge nodes is formulated as a matching set, which is solved using an improved version of the deferred acceleration algorithm we propose. The third contribution of this thesis is the resource allocation for vehicular services at the edge of the network. In this contribution, the services are migrated and moved to the different infrastructures at the edge to ensure service continuity. Vehicular services are particularly delay sensitive and related mainly to road safety and security. Therefore, the migration of vehicular services is a complex operation. We propose an approach based on deep reinforcement learning to proactively migrate the different services while ensuring their continuity under high mobility constraints.L'évolution des technologies de l'information entraîne la prolifération des dispositifs connectés qui mène à l'exploration de nouveaux champs d'application. Ces applications demandent une latence ultra-faible, qui ne peut être atteinte par les infrastructures en nuage traditionnelles étant donné la distance qui les sépare des utilisateurs. En rapprochant les ressources aux utilisateurs, le paradigme de l'informatique en périphérie, récemment apparu, vise à répondre aux besoins de ces applications. L’informatique en périphérie s'inspire de l’informatique en nuage, en l'étendant à la périphérie du réseau, à proximité de l'endroit où les données sont générées. Ce paradigme tire parti de la proximité entre l'infrastructure de traitement et les utilisateurs pour garantir une latence ultra-faible et un débit élevé des données. L'objectif de cette thèse est l'amélioration de l'allocation des ressources à la périphérie du réseau pour offrir une meilleure qualité de service et expérience pour les applications à faible latence. Pour une meilleure allocation des ressources, il est nécessaire d'avoir une bonne connaissance sur les ressources disponibles à tout moment. La première contribution de cette thèse consiste en la proposition d'une représentation des ressources pour permettre à l'entité de supervision d'acquérir des informations sur les ressources disponibles à chaque dispositif. Ces informations sont ensuite exploitées par le schéma d'allocation des ressources afin d'allouer les ressources de manière appropriée pour les différents services. Le schéma d'allocation des ressources est basé sur l'optimisation de Lyapunov, et il n'est exécuté que lorsque l'allocation des ressources est requise, ce qui réduit la latence et la consommation en ressources sur chaque équipement de périphérie. La deuxième contribution de cette thèse porte sur l'allocation des ressources pour les services en périphérie. Les services sont composés par le chaînage d'un ensemble de fonctions réseau virtuelles. L'allocation des ressources pour les services consiste en la recherche d'un placement, d'un routage et d'un ordonnancement adéquat de ces fonctions réseau virtuelles. Nous proposons une solution basée sur la théorie des jeux et sur l'apprentissage automatique pour trouver un emplacement et routage convenable ainsi qu'un ordonnancement approprié de ces fonctions en périphérie du réseau. La troisième contribution de cette thèse consiste en l'allocation des ressources pour les services véhiculaires en périphérie du réseau. Dans cette contribution, les services sont migrés et déplacés sur les différentes infrastructures en périphérie pour assurer la continuité des services. Les services véhiculaires sont en particulier sensibles à la latence et liés principalement à la sûreté et à la sécurité routière. En conséquence, la migration des services véhiculaires constitue une opération complexe. Nous proposons une approche basée sur l'apprentissage par renforcement profond pour migrer de manière proactive les différents services tout en assurant leur continuité sous les contraintes de mobilité élevée

Energy-efficient resource allocation in limited fronthaul capacity cloud-radio access networks

In recent years, cloud radio access networks (C-RANs) have demonstrated their role as a formidable technology candidate to address the challenging issues from the advent of Fifth Generation (5G) mobile networks. In C-RANs, the modules which are capable of processing data and handling radio signals are physically separated in two main functional groups: the baseband unit (BBU) pool consisting of multiple BBUs on the cloud, and the radio access networks (RANs) consisting of several low-power remote radio heads (RRH) whose functionality are simplified with radio transmission/reception. Thanks to the centralized computation capability of cloud computing, C-RANs enable the coordination between RRHs to significantly improve the achievable spectral efficiency to satisfy the explosive traffic demand from users. More importantly, this enhanced performance can be attained at its power-saving mode, which results in the energy-efficient C-RAN perspective. Note that such improvement can be achieved under an ideal fronthaul condition of very high and stable capacity. However, in practice, dedicated fronthaul links must remarkably be divided to connect a large amount of RRHs to the cloud, leading to a scenario of non-ideal limited fronthaul capacity for each RRH. This imposes a certain upper-bound on each user’s spectral efficiency, which limits the promising achievement of C-RANs. To fully harness the energy-efficient C-RANs while respecting their stringent limited fronthaul capacity characteristics, a more appropriate and efficient network design is essential. The main scope of this thesis aims at optimizing the green performance of C-RANs in terms of energy-efficiency under the non-ideal fronthaul capacity condition, namely energy-efficient design in limited fronthaul capacity C-RANs. Our study, via jointly determining the transmit beamforming, RRH selection, and RRH–user association, targets the following three vital design issues: the optimal trade-off between maximizing achievable sum rate and minimizing total power consumption, the maximum energy-efficiency under adaptive rate-dependent power model, the optimal joint energy-efficient design of virtual computing along with the radio resource allocation in virtualized C-RANs. The significant contributions and novelties of this work can be elaborated in the followings. Firstly, the joint design of transmit beamforming, RRH selection, and RRH–user association to optimize the trade-off between user sum rate maximization and total power consumption minimization in the downlink transmissions of C-RANs is presented in Chapter 3. We develop one powerful with high-complexity and two novel efficient low-complexity algorithms to respectively solve for a global optimal and high-quality sub-optimal solutions. The findings in this chapter show that the proposed algorithms, besides overcoming the burden to solve difficult non-convex problems within a polynomial time, also outperform the techniques in the literature in terms of convergence and achieved network performance. Secondly, Chapter 4 proposes a novel model reflecting the dependence of consumed power on the user data rate and highlights its impact through various energy-efficiency metrics in CRANs. The dominant performance of the results form Chapter 4, compared to the conventional work without adaptive rate-dependent power model, corroborates the importance of the newly proposed model in appropriately conserving the system power to achieve the most energy efficient C-RAN performance. Finally, we propose a novel model on the cloud center which enables the virtualization and adaptive allocation of computing resources according to the data traffic demand to conserve more power in Chapter 5. A problem of jointly designing the virtual computing resource together with the beamforming, RRH selection, and RRH–user association which maximizes the virtualized C-RAN energy-efficiency is considered. To cope with the huge size of the formulated optimization problem, a novel efficient with much lower-complexity algorithm compared to previous work is developed to achieve the solution. The achieved results from different evaluations demonstrate the superiority of the proposed designs compared to the conventional work

Resource allocation in future green wireless networks : applications and challenges

Over the past few years, green radio communication has been an emerging topic since the footprint from the Information and Communication Technologies (ICT) is predicted to increase 7.3% annually and then exceed 14% of the global footprint by 2040. Moreover, the explosive progress of ICT, e.g., the fifth generation (5G) networks, has resulted in expectations of achieving 10-fold longer device battery lifetime, and 1000-fold higher global mobile data traffic over the fourth generation (4G) networks. Therefore, the demands for increasing the data rate and the lifetime while reducing the footprint in the next-generation wireless networks call for more efficient utilization of energy and other resources. To overcome this challenge, the concepts of small-cell, energy harvesting, and wireless information and power transfer networks can be evaluated as promising solutions for re-greening the world. In this dissertation, the technical contributions in terms of saving economical cost, protecting the environment, and guaranteeing human health are provided. More specifically, novel communication scenarios are proposed to minimize energy consumption and hence save economic costs. Further, energy harvesting (EH) techniques are applied to exploit available green resources in order to reduce carbon footprint and then protect the environment. In locations where implemented user devices might not harvest energy directly from natural resources, base stations could harvest-and-store green energy and then use such energy to power the devices wirelessly. However, wireless power transfer (WPT) techniques should be used in a wise manner to avoid electromagnetic pollution and then guarantee human health. To achieve all these aspects simultaneously, this thesis proposes promising schemes to optimally manage and allocate resources in future networks. Given this direction, in the first part, Chapter 2 mainly studies a transmission power minimization scheme for a two-tier heterogeneous network (HetNet) over frequency selective fading channels. In addition, the HetNet backhaul connection is unable to support a sufficient throughput for signaling an information exchange between two tiers. A novel idea is introduced in which the time reversal (TR) beamforming technique is used at a femtocell while zero-forcing-based beamforming is deployed at a macrocell. Thus, a downlink power minimizationscheme is proposed, and optimal closed-form solutions are provided. In the second part, Chapters 3, 4, and 5 concentrate on EH and wireless information and power transfer (WIPT) using RF signals. More specifically, Chapter 3 presents an overview of the recent progress in green radio communications and discusses potential technologies for some emerging topics on the platforms of EH and WPT. Chapter 4 develops a new integrated information and energy receiver architecture based on the direct use of alternating current (AC) for computation. It is shown that the proposed approach enhances not only the computational ability but also the energy efficiency over the conventional one. Furthermore, Chapter 5 proposes a novel resource allocation scheme in simultaneous wireless information and power transfer (SWIPT) networks where three crucial issues: power-efficient improvement, user-fairness guarantee, and non-ideal channel reciprocity effect mitigation, are jointly addressed. Hence, novel methods to derive optimal and suboptimal solutions are provided. In the third part, Chapters 6, 7, and 8 focus on simultaneous lightwave information and power transfer (SLIPT) for indoor applications, as a complementary technology to RF SWIPT. In this research, Chapter 6 investigates a hybrid RF/visible light communication (VLC) ultrasmall cell network where optical transmitters deliver information and power using the visible light, whereas an RF access point works as a complementary power transfer system. Thus, a novel resource allocation scheme exploiting RF and visible light for power transfer is devised. Chapter 7 proposes the use of lightwave power transfer to enable future sustainable Federated Learning (FL)-based wireless networks. FL is a new data privacy protection technique for training shared machine learning models in a distributed approach. However, the involvement of energy-constrained mobile devices in the construction of the shared learning models may significantly reduce their lifetime. The proposed approach can support the FL-based wireless network to overcome the issue of limited energy at mobile devices. Chapter 8 introduces a novel framework for collaborative RF and lightwave power transfer for wireless communication networks. The constraints on the transmission power set by safety regulations result in significant challenges to enhance the power transfer performance. Thus, the study of technologies complementary to conventional RF SWIPT is essential. To cope with this isue, this chapter proposes a novel collaborative RF and lightwave power transfer technology for next-generation wireless networks

Radio Communications

In the last decades the restless evolution of information and communication technologies (ICT) brought to a deep transformation of our habits. The growth of the Internet and the advances in hardware and software implementations modified our way to communicate and to share information. In this book, an overview of the major issues faced today by researchers in the field of radio communications is given through 35 high quality chapters written by specialists working in universities and research centers all over the world. Various aspects will be deeply discussed: channel modeling, beamforming, multiple antennas, cooperative networks, opportunistic scheduling, advanced admission control, handover management, systems performance assessment, routing issues in mobility conditions, localization, web security. Advanced techniques for the radio resource management will be discussed both in single and multiple radio technologies; either in infrastructure, mesh or ad hoc networks