Distributed optimisation techniques for wireless networks

Alongside the ever increasing traffic demand, the fifth generation (5G) cellular network architecture is being proposed to provide better quality of service, increased data rate, decreased latency, and increased capacity. Without any doubt, the 5G cellular network will comprise of ultra-dense networks and multiple input multiple output technologies. This will make the current centralised solutions impractical due to increased complexity. Moreover, the amount of coordination information that needs to be transported over the backhaul links will be increased. Distributed or decentralised solutions are promising to provide better alternatives. This thesis proposes new distributed algorithms for wireless networks which aim to reduce the amount of system overheads in the backhaul links and the system complexity. The analysis of conflicts amongst transmitters, and resource allocation are conducted via the use of game theory, convex optimisation, and auction theory. Firstly, game-theoretic model is used to analyse a mixed quality of service (QoS) strategic non-cooperative game (SNG), for a two-user multiple-input single-output (MISO) interference channel. The players are considered to have different objectives. Following this, the mixed QoS SNG is extended to a multicell multiuser network in terms of signal-to-interference-and-noise ratio (SINR) requirement. In the multicell multiuser setting, each transmitter is assumed to be serving real time users (RTUs) and non-real time users (NRTUs), simultaneously. A novel mixed QoS SNG algorithm is proposed, with its operating point identified as the Nash equilibrium-mixed QoS (NE-mixed QoS). Nash, Kalai-Smorodinsky, and Egalitarian bargain solutions are then proposed to improve the performance of the NE-mixed QoS. The performance of the bargain solutions are observed to be comparable to the centralised solutions. Secondly, user offloading and user association problems are addressed for small cells using auction theory. The main base station wishes to offload some of its users to privately owned small cell access points. A novel bid-wait-auction (BWA) algorithm, which allows single-item bidding at each auction round, is designed to decompose the combinatorial mathematical nature of the problem. An analysis on the existence and uniqueness of the dominant strategy equilibrium is conducted. The BWA is then used to form the forward BWA (FBWA) and the backward BWA (BBWA). It is observed that the BBWA allows more users to be admitted as compared to the FBWA. Finally, simultaneous multiple-round ascending auction (SMRA), altered SMRA (ASMRA), sequential combinatorial auction with item bidding (SCAIB), and repetitive combinatorial auction with item bidding (RCAIB) algorithms are proposed to perform user offloading and user association for small cells. These algorithms are able to allow bundle bidding. It is then proven that, truthful bidding is individually rational and leads to Walrasian equilibrium. The performance of the proposed auction based algorithms is evaluated. It is observed that the proposed algorithms match the performance of the centralised solutions when the guest users have low target rates. The SCAIB algorithm is shown to be the most preferred as it provides high admission rate and competitive revenue to the bidders

Mobile data and computation offloading in mobile cloud computing

Le trafic mobile augmente considérablement en raison de la popularité des appareils mobiles et des applications mobiles. Le déchargement de données mobiles est une solution permettant de réduire la congestion du réseau cellulaire. Le déchargement de calcul mobile peut déplacer les tâches de calcul d'appareils mobiles vers le cloud. Dans cette thèse, nous étudions d'abord le problème du déchargement de données mobiles dans l'architecture du cloud computing mobile. Afin de minimiser les coûts de transmission des données, nous formulons le processus de déchargement des données sous la forme d'un processus de décision de Markov à horizon fini. Nous proposons deux algorithmes de déchargement des données pour un coût minimal. Ensuite, nous considérons un marché sur lequel un opérateur de réseau mobile peut vendre de la bande passante à des utilisateurs mobiles. Nous formulons ce problème sous la forme d'une enchère comportant plusieurs éléments afin de maximiser les bénéfices de l'opérateur de réseau mobile. Nous proposons un algorithme d'optimisation robuste et deux algorithmes itératifs pour résoudre ce problème. Enfin, nous nous concentrons sur les problèmes d'équilibrage de charge afin de minimiser la latence du déchargement des calculs. Nous formulons ce problème comme un jeu de population. Nous proposons deux algorithmes d'équilibrage de la charge de travail basés sur la dynamique évolutive et des protocoles de révision. Les résultats de la simulation montrent l'efficacité et la robustesse des méthodes proposées.Global mobile traffic is increasing dramatically due to the popularity of smart mobile devices and data hungry mobile applications. Mobile data offloading is considered as a promising solution to alleviate congestion in cellular network. Mobile computation offloading can move computation intensive tasks and large data storage from mobile devices to cloud. In this thesis, we first study mobile data offloading problem under the architecture of mobile cloud computing. In order to minimize the overall cost for data delivery, we formulate the data offloading process, as a finite horizon Markov decision process, and we propose two data offloading algorithms to achieve minimal communication cost. Then, we consider a mobile data offloading market where mobile network operator can sell bandwidth to mobile users. We formulate this problem as a multi-item auction in order to maximize the profit of mobile network operator. We propose one robust optimization algorithm and two iterative algorithms to solve this problem. Finally, we investigate computation offloading problem in mobile edge computing. We focus on workload balancing problems to minimize the transmission latency and computation latency of computation offloading. We formulate this problem as a population game, in order to analyze the aggregate offloading decisions, and we propose two workload balancing algorithms based on evolutionary dynamics and revision protocols. Simulation results show the efficiency and robustness of our proposed methods

Game theory for cooperation in multi-access edge computing

Cooperative strategies amongst network players can improve network performance and spectrum utilization in future networking environments. Game Theory is very suitable for these emerging scenarios, since it models high-complex interactions among distributed decision makers. It also finds the more convenient management policies for the diverse players (e.g., content providers, cloud providers, edge providers, brokers, network providers, or users). These management policies optimize the performance of the overall network infrastructure with a fair utilization of their resources. This chapter discusses relevant theoretical models that enable cooperation amongst the players in distinct ways through, namely, pricing or reputation. In addition, the authors highlight open problems, such as the lack of proper models for dynamic and incomplete information scenarios. These upcoming scenarios are associated to computing and storage at the network edge, as well as, the deployment of large-scale IoT systems. The chapter finalizes by discussing a business model for future networks.info:eu-repo/semantics/acceptedVersio

D13.2 Techniques and performance analysis on energy- and bandwidth-efficient communications and networking

Deliverable D13.2 del projecte europeu NEWCOM#The report presents the status of the research work of the various Joint Research Activities (JRA) in WP1.3 and the results that were developed up to the second year of the project. For each activity there is a description, an illustration of the adherence to and relevance with the identified fundamental open issues, a short presentation of the main results, and a roadmap for the future joint research. In the Annex, for each JRA, the main technical details on specific scientific activities are described in detail.Peer ReviewedPostprint (published version

Integration of Blockchain and Auction Models: A Survey, Some Applications, and Challenges

In recent years, blockchain has gained widespread attention as an emerging technology for decentralization, transparency, and immutability in advancing online activities over public networks. As an essential market process, auctions have been well studied and applied in many business fields due to their efficiency and contributions to fair trade. Complementary features between blockchain and auction models trigger a great potential for research and innovation. On the one hand, the decentralized nature of blockchain can provide a trustworthy, secure, and cost-effective mechanism to manage the auction process; on the other hand, auction models can be utilized to design incentive and consensus protocols in blockchain architectures. These opportunities have attracted enormous research and innovation activities in both academia and industry; however, there is a lack of an in-depth review of existing solutions and achievements. In this paper, we conduct a comprehensive state-of-the-art survey of these two research topics. We review the existing solutions for integrating blockchain and auction models, with some application-oriented taxonomies generated. Additionally, we highlight some open research challenges and future directions towards integrated blockchain-auction models

A Dynamic Allocation Mechanism for Network Slicing as-a-Service

In my thesis, I explore the design of a market mechanism to socially efficiently allocate resources for network slicing as-a-Service. Network slicing is a novel usage concept for the upcoming 5G network standard, allowing for isolated and customized virtual networks to operate upon a larger, physical 5G network. By providing network slices as-a-Service, where the users of the network slice do not own any of the underlying resources, a larger range of use cases can be catered to. My market mechanism is a novel amalgamation of existing mechanism design solutions from economics, and the nascent computer science literature into the technical aspects of network slicing and underlying network virtualization concepts. The existing literature in computer science is focused on the operative aspects of network slicing, while economics literature is incompatible with the unique problems network slicing poses as a market. In this thesis, I bring these two strands of literature together to create a functional allocation mechanism for the network slice market. I successfully create this market mechanism in my thesis, which is split into three phases. The first phase allows for bidder input into the network slices they bid for, overcoming a trade-off between market efficiency and tractability, making truthful valuation Bayes-Nash optimal. The second phase allocates resources to bidders based on a modified VCG mechanism that forms the multiple, non-identical resources of the market into packages that are based on bidder Quality of Service demands. Allocation is optimized to be socially efficient. The third phase re-allocates vacant resources of entitled network slices according to a Generalized Second-Price auction, while allowing for the return of resources to these entitled network slices without service interruption. As a whole, the mechanism is designed to optimize the allocation of resources as much as possible to those users that create the greatest value out of them, and successfully does so

Traffic offloading in future, heterogeneous mobile networks

The rise of third-party content providers and the introduction of numerous applications has been driving the growth of mobile data traffic in the past few years. In order to tackle this challenge, Mobile Network Operators (MNOs) aim to increase their networks' capacity by expanding their infrastructure, deploying more Base Stations (BSs). Particularly, the creation of Heterogeneous Networks (HetNets) and the application of traffic offloading through the dense deployment of low-power BSs, the small cells (SCs), is one promising solution to address the aforementioned explosive data traffic increase. Due to their financial implementation requirements, which could not be met by the MNOs, the emergence of third parties that deploy small cell networks creates new business opportunities. Thus, the investigation of frameworks that facilitate the implementation of outsourced traffic offloading, the collaboration and the transactions among MNOs and third-party small cell owners, as well as the provision of participation incentives for all stakeholders is essential for the deployment of the necessary new infrastructure and capacity expansion. The aforementioned emergence of third-party content providers and their applications not only drives the increase in mobile data traffic, but also create new Quality of Service (QoS) as well as Quality of Experience (QoE) requirements that the MNOs need to guarantee for the satisfaction of their subscribers. Moreover, even though the MNOs accommodate this traffic, they do not get any monetary compensation or subsidization for the required capacity expansion. On the contrary, their revenues reduce continuously. To that end, it is necessary to research and design network and economic functionalities adapted to the new requirements, such as QoE-aware Radio Resource Management and Dynamic Pricing (DP) strategies, which both guarantee the subscriber satisfaction and maximization the MNO profit (to compensate the diminished MNOs' revenues and the increasing deployment investment). Following a thorough investigation of the state-of-the-art, a set of research directions were identified. This dissertation consists of contributions on network sharing and outsourced traffic offloading for the capacity enhancement of MNO networks, and the design of network and economic functions for the sustainable deployment and use of the densely constructed HetNets. The contributions of this thesis are divided into two main parts, as described in the following. The first part of the thesis introduces an innovative approach on outsourced traffic offloading, where we present a framework for the Multi-Operator Radio Access Network (MORAN) sharing. The proposed framework is based on an auction scheme used by a monopolistic Small Cell Operator (SCO), through which he leases his SC infrastructure to MNOs. As the lack of information on the future offered load and the auction strategies creates uncertainty for the MNOs, we designed a learning mechanism that assists the MNOs in their bid-placing decisions. Our simulations show that our proposal almost maximizes the social welfare, satisfying the involved stakeholders and providing them with participation incentives. The second part of the thesis researches the use of network and economic functions for MNO profit maximization, while guaranteeing the users' satisfaction. Particularly, we designed a model that accommodates a plethora of services with various QoS and QoE requirements, as well as diverse pricing, that is, various service prices and different charging schemes. In this model, we proposed QoE-aware user association, resource allocation and joint resource allocation and dynamic pricing algorithms, which exploit the QoE-awareness and the network's economic aspects, such as the profit. Our simulations have shown that our proposals gain substantial more profit compared to traditional and state-of-the-art solutions, while providing a similar or even better network performance.El aumento de los proveedores de contenido de terceros y la introducción de numerosas aplicaciones ha impulsado el crecimiento del tráfico de datos en redes móviles en los últimos años. Para hacer frente a este desafío, los operadores de redes móviles (Mobile Network Operators, MNOs) apuntan a aumentar la capacidad de sus redes mediante la expansión de su infraestructura y el despliegue de más estaciones base (BS). Particularmente, la creación de Redes Heterogéneas (Heterogenous Networks, HetNets) y la aplicación de descarga de tráfico a través del despliegue denso de BSs de baja potencia, las células pequeñas (small cells, SCs), es una solución prometedora para abordar el aumento del tráfico de datos explosivos antes mencionado. Debido a sus requisitos de implementación financiera, que los MNO no pudieron cumplir, la aparición de terceros que implementan redes de células pequeñas crea nuevas oportunidades comerciales. Por lo tanto, la investigación de marcos que faciliten la implementación de la descarga tercerizada de tráfico, la colaboración y las transacciones entre MNOs y terceros propietarios de células pequeñas, así como la provisión de incentivos de participación para todas las partes interesadas esencial para el despliegue de la nueva infraestructura necesaria y la expansión de la capacidad. La aparición antes mencionada de proveedores de contenido de terceros y sus aplicaciones no solo impulsa el aumento del tráfico de datos móviles, sino también crea nuevos requisitos de calidad de servicio (Quality of Service, QoS) y calidad de la experiencia (Quality of Experience, QoE) que los operadores de redes móviles deben garantizar para la satisfacción de sus suscriptores. Además, a pesar de que los operadores de redes móviles adaptan este tráfico, no obtienen ninguna compensación monetaria o subsidio por la expansión de capacidad requerida. Por el contrario, sus ingresos se reducen continuamente. Para ello, es necesario investigar y diseñar funcionalidades económicas y de red adaptadas a los nuevos requisitos, tales como las estrategias QoE-conscientes de gestión de recursos de radio y de precios dinámicos (Dynamic Pricing, DP), que garantizan la satisfacción del abonado y la maximización de la ganancia de operador móvil (para compensar los ingresos de los MNOs disminuidos y la creciente inversión de implementación). Después de una investigación exhaustiva del estado del arte, se identificaron un conjunto de direcciones de investigación. Esta disertación consiste en contribuciones sobre el uso compartido de redes y la descarga tercerizada de tráfico para la mejora de la capacidad de redes MNO, y el diseño de funciones económicas y de red para el despliegue y uso sostenible de las HetNets densamente construidas. Las contribuciones de esta tesis se dividen en dos partes principales, como se describe a continuación. La primera parte de la tesis presenta un enfoque innovador sobre la descarga subcontratada de tráfico, en el que presentamos un marco para el uso compartido de la red de acceso de radio de múltiples operadores (Multi-Operator RAN, MORAN). El marco propuesto se basa en un esquema de subasta utilizado por un operador monopólico de celda pequeña (Small Cell Operator, SCO), a través del cual arrienda su infraestructura SC a MNOs. Como la falta de información sobre la futura carga de red y las estrategias de subasta creaban incertidumbre para los MNO, diseñamos un mecanismo de aprendizaje que asiste a los MNO en sus decisiones de colocación de pujas. Nuestras simulaciones muestran que nuestra propuesta casi maximiza el bienestar social, satisfaciendo a las partes interesadas involucradas y proporcionándoles incentivos de participación. La segunda parte de la tesis investiga el uso de las funciones económicas y de red para la maximización de los beneficios de los MNOs, al tiempo que garantiza la satisfacción de los usuarios. Particularmente, diseñamos un modelo que acomoda una gran cantidad de servicios con diversos requisitos de QoS y QoE, tanto como diversos precios, es decir, varios precios de servicio y diferentes esquemas de cobro. En este modelo, propusimos algoritmos QoE-conscientes para asociación de usuarios, asignación de recursos y conjunta asignación de recursos y de fijación dinámica de precios, que explotan la conciencia de QoE y los aspectos económicos de la red, como la ganancia. Nuestras simulaciones han demostrado que nuestras propuestas obtienen un beneficio sustancial en comparación con las soluciones tradicionales y del estado del arte, a la vez que proporcionan un rendimiento de red similar o incluso mejor.Postprint (published version