Routing for Flying Networks using Software-Defined Networking

Nos últimos anos, os Veículos Aéreos Não Tripulados (UAVs) estão a ser usados de forma crescente em inúmeras aplicações, tanto militares como civis. A sua miniaturização e o preço reduzido abriram o caminho para o uso de enxames de UAVs, que permitem melhores resultados na realização de tarefas em relação a UAVs independentes. Contudo, para permitir a cooperação entre UAVs, devem ser asseguradas comunicações contínuas e fiáveis.Além disso, os enxames de UAVs foram identificados pela comunidade científica como meio para permitir o acesso à Internet a utilizadores terrestres em cenários como prestação de socorros e Eventos Temporários Lotados (TCEs), tirando partido da sua capacidade para transportar Pontos de Acesso (APs) Wi-Fi e células Long-Term Evolution (LTE). Soluções que dependem de uma Estação de Controlo (CS) capaz de posicionar os UAVs de acordo com as necessidades de tráfego dos utilizadores demonstraram aumentar a Qualidade de Serviço (QoS) oferecida pela rede. No entanto, estas soluções introduzem desafios importantes no que diz respeito ao encaminhamento do tráfego.Recentemente, foi proposta uma solução que tira partido do conhecimento da CS sobre o estado futuro da rede para atualizar dinamicamente as tabelas de encaminhamento de modo a que as ligações na rede voadora não sejam interrompidas, em vez de se recuperar da sua interrupção, como é o caso na maioria dos protocolos de encaminhamento existentes. Apesar de não considerar o impacto das reconfigurações na rede de acesso, como consequência da mobilidade dos APs, ou o balanceamento da carga na rede, esta abordagem é promissora e merece ser desenvolvida e implementada num sistema real.Esta dissertação tem como foco a implementação de um protocolo de encaminhamento para redes voadoras baseado em Software-Defined Networking (SDN). Especificamente, aborda os problemas de mobilidade e de balanceamento da carga na rede de uma perspetiva centralizada, garantindo simultaneamente comunicações ininterruptas e de banda-larga entre utilizadores terrestres e a Internet, permitindo assim que os UAVs se possam reposicionar e reconfigurar sem interferir com as ligações dos terminais à rede.In recent years, Unmanned Aerial Vehicles (UAVs) are being increasingly used in various applications, both military and civilian. Their miniaturisation and low cost paved the way to the usage of swarms of UAVs, which provide better results when performing tasks compared to single UAVs. However, to enable cooperation between the UAVs, always-on and reliable communications must be ensured.Moreover, swarms of UAVs are being targeted by the scientific community as a way to provide Internet access to ground users in scenarios such as disaster reliefs and Temporary Crowded Events (TCEs), taking advantage of the capability of UAVs to carry Wi-Fi Access Points (APs) or Long-Term Evolution (LTE) cells. Solutions relying on a Control Station (CS) capable of positioning the UAVs according to the users' traffic demands have been shown to improve the Quality of Service (QoS) provided by the network. However, they introduce important challenges regarding network routing.Recently, a solution was proposed to take advantage of the knowledge provided by a CS regarding how the network will change, by dynamically updating the forwarding tables before links in the flying network are disrupted, rather than recovering from link failure, as is the case in most of the existing routing protocols. Although it does not consider the impact of reconfigurations on the access network due to the mobility of the APs, it is a promising approach worthy of being improved and implemented in a real system.This dissertation focuses on implementing a routing solution for flying networks based on Software-Defined Networking (SDN). Specifically, it addresses the mobility management and network load balancing issues from a centralised perspective, while simultaneously enabling uninterruptible and broadband communications between ground users and the Internet, thus allowing UAVs to reposition and reconfigure themselves without interfering with the terminals' connections to the network

Energy efficient offloading techniques for heterogeneous networks

Mobile data offloading has been proposed as a solution for the network congestion problem that is continuously aggravating due to the increase in mobile data demand. The concept of offloading refers to the exploitation of network heterogeneity with the objective to mitigate the load of the cellular network infrastructure. In this thesis a multicast protocol for short range networks that exploits the characteristics of physical layer network coding is presented. In the proposed protocol, named CooPNC, a novel cooperative approach is provided that allows collision resolutions with the use of an indirect inter-network cooperation scheme. Through this scheme, a reliable multicast protocol for partially overlapping short range networks with low control overhead is provided. It is shown that with CooPNC, higher throughput and energy efficiency are achieved, while it presents lower delay compared to state-of-the-art multicast protocols. A detailed description of the proposed protocol is provided, with a simple scenario of overlapping networks and also for a generalised scalable scenario. Through mathematical analysis and simulations it is proved that CooPNC presents significant performance gains compared to other state-of-the-art multicast protocols for short range networks. In order to reveal the performance bounds of Physical Layer Network Coding, the so-called Cross Network is investigated under diverse Network Coding (NC) techniques. The impact of Medium Access Control (MAC) layer fairness on the throughput performance of the network is provided, for the cases of pure relaying, digital NC with and without overhearing and physical layer NC with and without overhearing. A comparison among these techniques is presented and the throughput bounds, caused by MAC layer limitations, are discussed. Furthermore, it is shown that significant coding gains are achieved with digital and physical layer NC and the energy efficiency performance of each NC case is presented, when applied on the Cross Network.In the second part of this thesis, the uplink offloading using IP Flow Mobility (IFOM) is also investigated. IFOM allows a LTE mobile User Equipment (UE) to maintain two concurrent data streams, one through LTE and the other through WiFi access technology, that presents uplink limitations due to the inherent fairness design of IEEE 802.11 DCF. To overcome these limitations, a weighted proportionally fair bandwidth allocation algorithm is proposed, regarding the data volume that is being offloaded through WiFi, in conjunction with a pricing-based rate allocation algorithm for the rest of the data volume needs of the UEs that are transmitted through the LTE uplink. With the proposed approach, the energy efficiency of the UEs is improved, and the offloaded data volume is increased under the concurrent use of access technologies that IFOM allows. In the weighted proportionally fair WiFi bandwidth allocation, both the different upload data needs of the UEs, along with their LTE spectrum efficiency are considered, and an access mechanism is proposed that improves the use of WiFi access in uplink offloading. In the LTE part, a two-stage pricing-based rate allocation is proposed, under both linear and exponential pricing approaches, with the objective to satisfy all offloading UEs regarding their LTE uplink access. The existence of a malicious UE is also considered that aims to exploit the WiFi bandwidth against its peers in order to upload less data through the energy demanding LTE uplink and a reputation based method is proposed to combat its selfish operation. This approach is theoretically analysed and its performance is evaluated, regarding the malicious and the truthful UEs in terms of energy efficiency. It is shown that while the malicious UE presents better energy efficiency before being detected, its performance is significantly degraded with the proposed reaction method.La derivación del tráfico de datos móviles (en inglés data offloading) ha sido propuesta como una solución al problema de la congestión de la red, un problema que empeora continuamente debido al incremento de la demanda de datos móviles. El concepto de offloading se entiende como la explotación de la heterogeneidad de la red con el objetivo de mitigar la carga de la infraestructura de las redes celulares. En esta tesis se presenta un protocolo multicast para redes de corto alcance (short range networks) que explota las características de la codificación de red en la capa física (physical layer network coding). En el protocolo propuesto, llamado CooPMC, se implementa una solución cooperativa que permite la resolución de colisiones mediante la utilización de un esquema indirecto de cooperación entre redes. Gracias a este esquema, se consigue un protocolo multicast fiable i con poco overhead de control para redes de corto alcance parcialmente solapadas. Se demuestra que el protocolo CooPNC consigue una mayor tasa de transmisión neta (throughput) y una mejor eficiencia energética, a la vez que el retardo se mantiene por debajo del obtenido con los protocolos multicast del estado del arte. La tesis ofrece una descripción detallada del protocolo propuesto, tanto para un escenario simple de redes solapadas como también para un escenario general escalable. Se demuestra mediante análisis matemático y simulaciones que CooPNC ofrece mejoras significativas en comparación con los protocolos multicast para redes de corto alcance del estado del arte. Con el objetivo de encontrar los límites de la codificación de red en la capa física (physical layer network coding), se estudia el llamado Cross Network bajo distintas técnicas de Network Coding (NC). Se proporciona el impacto de la equidad (fairness) de la capa de control de acceso al medio (Medium Access Control, MAC), para los casos de repetidor puro (pure relaying), NC digital con y sin escucha del medio, y NC en la capa física con y sin escucha del medio. En la segunda parte de la tesis se investiga el offloading en el enlace ascendente mediante IP Flow Mobility (IFOM). El IFOM permite a los usuarios móviles de LTE mantener dos flujos de datos concurrentes, uno a través de LTE y el otro a través de la tecnología de acceso WiFi, que presenta limitaciones en el enlace ascendente debido a la equidad (fairness) inherente del diseño de IEEE 802.11 DCF. Para superar estas limitaciones, se propone un algoritmo proporcional ponderado de asignación de banda para el volumen de datos derivado a través de WiFi, junto con un algoritmo de asignación de tasa de transmisión basado en pricing para el volumen de datos del enlace ascendente de LTE. Con la solución propuesta, se mejora la eficiencia energética de los usuarios móviles, y se incrementa el volumen de datos que se pueden derivar gracias a la utilización concurrente de tecnologías de acceso que permite IFOM. En el algoritmo proporcional ponderado de asignación de banda de WiFi, se toman en consideración tanto las distintas necesidades de los usuarios en el enlace ascendente como su eficiencia espectral en LTE, y se propone un mecanismo de acceso que mejora el uso de WiFi para el tráfico derivado en el enlace ascendente. En cuanto a la parte de LTE, se propone un algoritmo en dos etapas de asignación de tasa de transmisión basada en pricing (con propuestas de pricing exponencial y lineal) con el objetivo de satisfacer el enlace ascendente de los usuarios en LTE. También se contempla la existencia de usuarios maliciosos, que pretenden utilizar el ancho de banda WiFi contra sus iguales para transmitir menos datos a través del enlace ascendente de LTE (menos eficiente energéticamente). Para ello se propone un método basado en la reputación que combate el funcionamiento egoísta (selfish).Postprint (published version

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

Cooperative Internet access using heterogeneous wireless networks

Ph.DDOCTOR OF PHILOSOPH

Models and Protocols for Resource Optimization in Wireless Mesh Networks

Wireless mesh networks are built on a mix of fixed and mobile nodes interconnected via wireless links to form a multihop ad hoc network. An emerging application area for wireless mesh networks is their evolution into a converged infrastructure used to share and extend, to mobile users, the wireless Internet connectivity of sparsely deployed fixed lines with heterogeneous capacity, ranging from ISP-owned broadband links to subscriber owned low-speed connections. In this thesis we address different key research issues for this networking scenario. First, we propose an analytical predictive tool, developing a queuing network model capable of predicting the network capacity and we use it in a load aware routing protocol in order to provide, to the end users, a quality of service based on the throughput. We then extend the queuing network model and introduce a multi-class queuing network model to predict analytically the average end-to-end packet delay of the traffic flows among the mobile end users and the Internet. The analytical models are validated against simulation. Second, we propose an address auto-configuration solution to extend the coverage of a wireless mesh network by interconnecting it to a mobile ad hoc network in a transparent way for the infrastructure network (i.e., the legacy Internet interconnected to the wireless mesh network). Third, we implement two real testbed prototypes of the proposed solutions as a proof-of-concept, both for the load aware routing protocol and the auto-configuration protocol. Finally we discuss the issues related to the adoption of ad hoc networking technologies to address the fragility of our communication infrastructure and to build the next generation of dependable, secure and rapidly deployable communications infrastructures

Descubrimiento dinámico de servidores basado en información de localización usando una tabla de Hash distribuida balanceada

The current Internet includes a large number of distributed services. In order to guarantee the QoS of the communications in these services, a client has to select a close-by server with enough available resources. To achieve this objective, in this Thesis, we propose a simple and practical solution for Dynamic and Location Aware Server Discovery based on a Distributed Hash Table (DHT). Specifically, we decide to use a Chord DHT system (although any other DHT scheme can be used). In more detail, the solution works as follows. The servers offering a given service S form a Chord-like DHT. In addition, they register their location (topological and/or geographical) information in the DHT. Each client using the service S is connected to at least one server from the DHT. Eventually, a given client C realizes that it is connected to a server providing a bad QoS, then, it queries the DHT in order to find an appropriate server (i.e. a close-by server with enough available resources). We define 11 design criteria, and compare our solution to the Related Work based on them. We show that our solution is the most complete one. Furthermore, we validate the performance of our solution in two different scenarios: (i) NAT Traversal Server Discovery and (ii) Home Agent Discovery in Mobile IP scenarios. The former serves to validate our solution in a highly dynamic environment whereas the latter demonstrates the appropriateness of our solution in more classical environments where the servers are typically always-on hosts. The extra overhead suffered from the servers involved in our system comes from their participation in the Chord DHT. Therefore, it is critical to fairly balance the load among all the servers. In our system as well as in other P2P systems (e.g. P2PSIP) the stored objects are small, then routing dominates the cost of publishing and retrieving objects. Therefore, in the second part of this Thesis, we address the issue of fairly balancing the routing load in Chord DHTs. We present an analytical model to evaluate the routing fairness of Chord based on the well accepted Jain’s Fairness Index (FI). Our model shows that Chord performs poorly. Following this observation, we propose a simple enhancement to the Chord finger selection algorithm with the goal of mitigating this effect. The key advantage of our proposal as compared to previous approaches is that it adds a neglible overhead to the basic Chord algorithm. We validate the goodness of the proposed solution analytically and by large scale simulations.-------------------------------------------------------------------------------------------------------------------------------------------------------------En los últimos años un gran número de servicios distribuídos han aparecido en Internet. Para garantizar la Calidad de Servicio de las comunicaciones en estos servicios sus clientes deben conectarse a un servidor cercano con suficientes recursos disponibles. Para alcanzar este objetivo, en esta Tesis, se propone una solución simple y práctica para el Descubrimiento Dinámico de Servidores basado en Información de Localizació usando una Tabla de Hash Distribuída (DHT). En concreto, hemos decidido usar una DHT de tipo Chord (aunque cualquier otro tipo de DHT puede usarse). A continuación describimos brevemente nuestra solución. Los servidores que ofrecen un servicio específico S forman una DHT tipo Chord donde registran su información de localización (topológica y/o geográfica). Cada cliente que usa el servicio S está conectado al menos a un servidor de la DHT. En caso de que un cliente C perciba que el servidor al que está conectado está ofreciendo una mala Calidad de Servicio, C consulta la DHT para encontrar un servidor más apropiado (p.ej. un servidor cercano con suficientes recursos disponibles). En la Tesis se definen 11 criterios de diseño y se compara nuestra solución con las soluciones existentes en base a ellos, demostrando que la nuestra es la solución más completa. Además, validamos el rendimiento de nuestra solución en dos escenarios diferentes: (i) Descubrimiento de Servidores para atravesar Traductores de Direcciones de Red (NATs) y (ii) Descubrimiento de Agentes Hogar (HAs) en escenarios de Movilidad IP. El primero sirve para validar el rendimiento de nuestra solución en escenarios altamente dinámicos mientras que el segundo demuestra la validez de la solución en un escenario más clásico donde los servidores son máquinas que están ininterrumpidamente funcionando. Los servidores involucrados en nuestro sistema sufren una sobrecarga debido a su participación en la DHT tipo Chord. Desafortunadamente, esta sobrecarga es inherente al sistema anteriormente descrito y no se puede eliminar. En cambio lo que sí podemos hacer es balancear la carga de la manera más justa posible entre todos los servidores. En nuestro sistema, al igual que en otros sistemas P2P (p.ej. P2PSIP) los objetos almacenados tienen un tamaño pequeño, produciendo que sea la tarea de enrutamiento la que domina el coste de publicar y obtener objetos. Por lo tanto, en la segunda parte de esta Tesis abordamos el reparto equilibrado de la carga de enrutamiento en DHTs tipo Chord. En primer lugar, definimos un modelo analítico para evaluar el reparto de la carga de enrutamiento entre los nodos que forman una DHT tipo Chord. Para ello nos basamos en una métrica aceptada por la comunidad investigadora como es el Jain’s Fairness Index (FI). El modelo resultante demuestra que Chord tiene un rendimiento pobre en el reparto justo de la carga de enrutamiento. Basándonos en esta observación proponemos una modificación simple al algoritmo de selección de punteros de Chord para mejorar el reparto de la carga de enrutamiento. La ventaja fundamental de nuestra solución en comparación con otras propuestas anteriores es que nuestra solución añade un coste despreciable al algoritmo básico de Chord. Finalmente, validamos el rendimiento de nuestra solución analíticamente y por medio de simulaciones a gran escala

Towards Mobile Edge Computing: Taxonomy, Challenges, Applications and Future Realms

The realm of cloud computing has revolutionized access to cloud resources and their utilization and applications over the Internet. However, deploying cloud computing for delay critical applications and reducing the delay in access to the resources are challenging. The Mobile Edge Computing (MEC) paradigm is one of the effective solutions, which brings the cloud computing services to the proximity of the edge network and leverages the available resources. This paper presents a survey of the latest and state-of-the-art algorithms, techniques, and concepts of MEC. The proposed work is unique in that the most novel algorithms are considered, which are not considered by the existing surveys. Moreover, the chosen novel literature of the existing researchers is classified in terms of performance metrics by describing the realms of promising performance and the regions where the margin of improvement exists for future investigation for the future researchers. This also eases the choice of a particular algorithm for a particular application. As compared to the existing surveys, the bibliometric overview is provided, which is further helpful for the researchers, engineers, and scientists for a thorough insight, application selection, and future consideration for improvement. In addition, applications related to the MEC platform are presented. Open research challenges, future directions, and lessons learned in area of the MEC are provided for further future investigation