Tactical Communications for Cooperative SAR Robot Missions

This chapter describes how the ICARUS communications (COM) team defined, developed and implemented an integrated wireless communication system to ensure an interoperable and dependable networking capability for both human and robotic search and rescue field teams and crisis managers. It starts explaining the analysis of the requirements and the context of the project, the existing solutions and the design of the ICARUS communication system to fulfil all the project needs. Next, it addresses the implementation process of the required networking capabilities, and finally, it explains how the ICARUS communication system and associated tools have been integrated in the overall mission systems and have been validated to provide reliable communications for real‐time information sharing during search and rescue operations in hostile conditions

Chapter Tactical Communications for Cooperative SAR Robot Missions

This chapter describes how the ICARUS communications (COM) team defined, developed and implemented an integrated wireless communication system to ensure an interoperable and dependable networking capability for both human and robotic search and rescue field teams and crisis managers. It starts explaining the analysis of the requirements and the context of the project, the existing solutions and the design of the ICARUS communication system to fulfil all the project needs. Next, it addresses the implementation process of the required networking capabilities, and finally, it explains how the ICARUS communication system and associated tools have been integrated in the overall mission systems and have been validated to provide reliable communications for real‐time information sharing during search and rescue operations in hostile conditions

Traffic and mobility management in large-scale networks of small cells

The growth in user demand for higher mobile data rates is driving Mobile Network Operators (MNOs) and network infrastructure vendors towards the adoption of innovative solutions in areas that span from physical layer techniques (e.g., carrier aggregation, massive MIMO, etc.) to the Radio Access Network and the Evolved Packet Core, amongst other. In terms of network capacity, out of a millionfold increase since 1957, the use of wider spectrum (25x increase), the division of spectrum into smaller resources (5x), and the introduction of advanced modulation and coding schemes (5x) have played a less significant role than the improvements in system capacity due to cell size reduction (1600x). This justifies the academic and industrial interest in short-range, low-power cellular base stations, such as small cells. The shift from traditional macrocell-based deployments towards heterogeneous cellular networks raises the need for new architectural and procedural frameworks capable of providing a seamless integration of massive deployments of small cells into the existing cellular network infrastructure. This is particularly challenging for large-scale, all-wireless networks of small cells (NoS), where connectivity amongst base stations is provided via a wireless multi-hop backhaul. Networks of small cells are a cost-effective solution for improving network coverage and capacity in high user-density scenarios, such as transportation hubs, sports venues, convention centres, dense urban areas, shopping malls, corporate premises, university campuses, theme parks, etc. This Ph.D. Thesis provides an answer to the following research question: What is the architectural and procedural framework needed to support efficient traffic and mobility management mechanisms in massive deployments of all-wireless 3GPP Long-Term Evolution networks of small cells? In order to do so, we address three key research challenges in NoS. First, we present a 3GPP network architecture capable of supporting large-scale, all-wireless NoS deployments in the Evolved Packet System. This involves delegating core network functions onto new functional entities in the network of small cells, as well as adapting Transport Network Layer functionalities to the characteristics of a NoS in order to support key cellular services. Secondly, we address the issue of local location management, i.e., determining the approximate location of a mobile terminal in the NoS upon arrival of an incoming connection from the core network. This entails the design, implementation, and evaluation of efficient paging and Tracking Area Update mechanisms that can keep track of mobile terminals in the complex scenario of an all-wireless NoS whilst mitigating the impact on signalling traffic throughout the local NoS domain and towards the core network. Finally, we deal with the issue of traffic management in large-scale networks of small cells. On the one hand, we propose new 3GPP network procedures to support direct unicast communication between LTE terminals camped on the same NoS with minimal involvement from functional entities in the Evolved Packet Core. On the other hand, we define a set of extensions to the standard 3GPP Multicast/Broadcast Multimedia Service (MBMS) in order to improve the quality of experience of multicast/broadcast traffic services in high user-density scenarios.El crecimiento de la demanda de tasas de transmisión más altas está empujando a los operadores de redes móviles y a los fabricantes de equipos de red a la adopción de soluciones innovadoras en áreas que se extienden desde técnicas avanzadas de capa física (agregación de portadoras, esquemas MIMO masivos, etc.) hasta la red de acceso radio y troncal, entre otras. Desde 1957 la capacidad de las redes celulares se ha multiplicado por un millón. La utilización de mayor espectro radioeléctrico (incremento en factor 25), la división de dicho espectro en recursos más pequeños (factor 5) y la introducción de esquemas avanzados de modulación y codificación (factor 5) han desempeñado un papel menos significativo que las mejoras en la capacidad del sistema debidas a la reducción del tamaño de las celdas (factor 1600). Este hecho justifica el interés del mundo académico y de la industria en estaciones base de corto alcance y baja potencia, conocidas comúnmente como small cells. La transición de despliegues tradicionales de redes celulares basados en macroceldas hacia redes heterogéneas pone de manifiesto la necesidad de adoptar esquemas arquitecturales y de procedimientos capaces de proporcionar una integración transparente de despliegues masivos de small cells en la actual infraestructura de red celular. Este aspecto es particularmente complejo en el caso de despliegues a gran escala de redes inalámbricas de small cells (NoS, en sus siglas en inglés), donde la conectividad entre estaciones base se proporciona a través de una conexión troncal inalámbrica multi-salto. En general, las redes de small cells son una solución eficiente para mejorar la cobertura y la capacidad de la red celular en entornos de alta densidad de usuarios, como núcleos de transporte, sedes de eventos deportivos, palacios de congresos, áreas urbanas densas, centros comerciales, edificios corporativos, campus universitarios, parques temáticos, etc. El objetivo de esta Tesis de Doctorado es proporcionar una respuesta a la siguiente pregunta de investigación: ¿Cuál es el esquema arquitectural y de procedimientos de red necesario para soportar mecanismos eficientes de gestión de tráfico y movilidad en despliegues masivos de redes inalámbricas de small cells LTE? Para responder a esta pregunta nos centramos en tres desafíos clave en NoS. En primer lugar, presentamos una arquitectura de red 3GPP capaz de soportar despliegues a gran escala de redes inalámbricas de small cells en el Evolved Packet System, esto es, el sistema global de comunicaciones celulares LTE. Esto implica delegar funciones de red troncal en nuevas entidades funcionales desplegadas en la red de small cells, así como adaptar funcionalidades de la red de transporte a las características de una NoS para soportar servicios celulares clave. En segundo lugar, nos centramos en el problema de la gestión de movilidad local, es decir, determinar la localización aproximada de un terminal móvil en la NoS a la llegada de una solicitud de conexión desde la red troncal. Esto incluye el diseño, la implementación y la evaluación de mecanismos eficientes de paging y Tracking Area Update capaces de monitorizar terminales móviles en el complejo escenario de redes de small cells inalámbricas que, a la vez, mitiguen el impacto sobre el tráfico de señalización en el dominio local de la NoS y hacia la red troncal. Finalmente, estudiamos el problema de gestión de tráfico en despliegues a gran escala de redes inalámbricas de small cells. Por un lado, proponemos nuevos procedimientos de red 3GPP para soportar comunicaciones unicast directas entre terminales LTE registrados en la misma NoS con mínima intervención por parte de entidades funcionales en la red troncal. Por otro lado, definimos un conjunto de extensiones para mejorar la calidad de la experiencia del servicio estándar 3GPP de transmisión multicast/broadcast de tráfico multimedia (MBMS, en sus siglas en inglés) en entornos de alta densidad de usuarios

Improving routing performance of multipath ad hoc on-demand distance vector in mobile add hoc networks.

The aim of this research is to improve routing fault tolerance in Mobile Ad hoc Networks (MANETs) by optimising mUltipath routing in a well-studied reactive and single path routing protocol known as Ad hoc On-demand Distance Vector (AODV). The research also aims to prove the effect of varying waiting time of Route Reply (RREP) procedure and utilising the concept of efficient routes on the performance of multipath extensions to AODV. Two novel multipath routing approaches are developed in this thesis as new extensions to AODV to optimise routing overhead by improving Route Discovery Process (RDP) and Route Maintenance Process (RMP) of multipath AODV. The first approach is a Iinkdisjoint multipath extension called 'Thresho)d efficient Routes in multipath AODV' (TRAODV) that optimises routing packets ~verhead by improving the RDP of AODV which is achieved by detecting the waiting time required for RREP procedure to receive a threshold number of efficient routes. The second approach is also a link-disjoint mUltipath extension called 'On-demand Route maintenance in Multipath AoDv' (ORMAD) which is an extension to TRAODV that optimises routing packets and delay overhead by improving the RMP of TRAODV. ORMAD applies the concepts of threshold waiting time and efficient routes to both phases RDP and RMP. It also applies RMP only to efficient routes which are selected in the RDP and when a route fails, it invokes a local repair procedure between upstream and downstream nodes of the broken link. This mechanism produces a set of alternative subroutes with less number of hops which enhances route efficiency and consequently minimises the routing overhead. TRAODV and ORMAD are implemented and evaluated against two existing multipath extensions to,AODV protocol and two traditional multipath protocols. The existing extensions to AODV used in the evaluation are a well-known protocol called Ad hoc On-demand Multipath Distance Vector (AOMDV) and a recent extension called Multiple Route AODV (MRAODV) protocol which is extended in this thesis to the new approach TRAODV while the traditional multipath protocols used in the evaluation are Dynamic Source Routing (DSR) and Temporally Ordered Routing Algorithm (TORA). Protocols are implemented using NS2 and evaluated under the same simulation environment in terms of four performance metrics; packet delivery fraction, average end-to-end delay, routing packets overhead, and throughput. Simulation results of TRAODV evaluation show that the average number of routes stored in a routing table of MRAODV protocol is always larger than the average number of routes in TRAODV. Simulation results show that TRAODV reduces the overall routing packets overhead compared to both extensions AOMDV and MRAODV, especially for large network size and high mobility. A vital drawback of TRAODV is that its performance is reduced compared to AOMDV and MRAODV in terms of average end-to-end delay. Additionally, TORA still outperforms TRAODV and the other extensions to AODV in terms of routing packets overhead. In order to overcome the drawbacks of TRAODV, ORMAD is developed by improving the RDP of TRAODV. The performance of ORMAD is evaluated against RREP waiting time using the idea of utilising the efficient routes in both phases RDP and RMP. Simulation results of ORMAD show that the performance is affected by varying the two RREP waiting times of both RDP and RMP in different scenarios. As shown by the simulation results, applying the short and long waiting times in both phases tends to less performance in terms of routing packets overhead while applying the moderate waiting times tends to better performance. ORMAD enhances routing packets overhead and the average end-to-end delay compared to TRAODV, especially in high mobility scenarios. ORMAD has the closest performance to TORA protocol in terms of routing packets overhead compared to ~M~a~M~OW . Relevant concepts are formalised for ORMAD approach and conducted as an analytical model in this thesis involving the\vhole process of multipath routing in AODV extensions. ORMAD analytical model describes how the two phases RDP and RMP interact with each other with regard to two performance metrics; total number of detected routes and Route Efficiency.EThOS - Electronic Theses Online ServiceGBUnited Kingdo

Efficient medium access control protocol for vehicular ad-hoc networks

Intelligent transportation systems (ITS) have enjoyed a tremendous growth in the last decade and the advancement in communication technologies has played a big role behind the success of ITS. Inter-vehicle communication (IVC) is a critical requirement for ITS and due to the nature of communication, vehicular ad-hoc network technology (VANET) is the most suitable communication technology for inter-vehicle communications. In Practice, however, VANET poses some extreme challenges including dropping out of connections as the moving vehicle moves out of the coverage range, joining of new nodes moving at high speeds, dynamic change in topology and connectivity, time variability of signal strength, throughput and time delay. One of the most challenging issues facing vehicular networks lies in the design of efficient resource management schemes, due to the mobile nature of nodes, delay constraints for safety applications and interference. The main application of VANET in ITS lies in the exchange of safety messages between nodes. Moreover, as the wireless access in vehicular environment (WAVE) moves closer to reality, management of these networks is of increasing concern for ITS designers and other stakeholder groups. As such, management of resources plays a significant role in VANET and ITS. For resource management in VANET, a medium access control protocol is used, which makes sure that limited resources are distributed efficiently. In this thesis, an efficient Multichannel Cognitive MAC (MCM) is developed, which assesses the quality of channel prior to transmission. MCM employs dynamic channel allocation and negotiation algorithms to achieve a significant improvement in channel utilisation, system reliability, and delay constraints while simultaneously addressing Quality of Service. Moreover, modified access priority parameters and safety message acknowledgments will be used to improve the reliability of safety messages. The proposed protocols are implemented using network simulation tools. Extensive experiments demonstrated a faster and more efficient reception of safety messages compared to existing VANET technologies. Finally, improvements in delay and packet delivery ratios are presented

Energy efficient data collection and dissemination protocols in self-organised wireless sensor networks

Wireless sensor networks (WSNs) are used for event detection and data collection in a plethora of environmental monitoring applications. However a critical factor limits the extension of WSNs into new application areas: energy constraints. This thesis develops self-organising energy efficient data collection and dissemination protocols in order to support WSNs in event detection and data collection and thus extend the use of sensor-based networks to many new application areas. Firstly, a Dual Prediction and Probabilistic Scheduler (DPPS) is developed. DPPS uses a Dual Prediction Scheme combining compression and load balancing techniques in order to manage sensor usage more efficiently. DPPS was tested and evaluated through computer simulations and empirical experiments. Results showed that DPPS reduces energy consumption in WSNs by up to 35% while simultaneously maintaining data quality and satisfying a user specified accuracy constraint. Secondly, an Adaptive Detection-driven Ad hoc Medium Access Control (ADAMAC) protocol is developed. ADAMAC limits the Data Forwarding Interruption problem which causes increased end-to-end delay and energy consumption in multi-hop sensor networks. ADAMAC uses early warning alarms to dynamically adapt the sensing intervals and communication periods of a sensor according to the likelihood of any new events occurring. Results demonstrated that compared to previous protocols such as SMAC, ADAMAC dramatically reduces end-to-end delay while still limiting energy consumption during data collection and dissemination. The protocols developed in this thesis, DPPS and ADAMAC, effectively alleviate the energy constraints associated with WSNs and will support the extension of sensorbased networks to many more application areas than had hitherto been readily possible

Resource allocation and scalability in dynamic wavelength-routed optical networks.

This thesis investigates the potential benefits of dynamic operation of wavelength-routed optical networks (WRONs) compared to the static approach. It is widely believed that dynamic operation of WRONs would overcome the inefficiencies of the static allocation in improving resource use. By rapidly allocating resources only when and where required, dynamic networks could potentially provide the same service that static networks but at decreased cost, very attractive to network operators. This hypothesis, however, has not been verified. It is therefore the focus of this thesis to investigate whether dynamic operation of WRONs can save significant number of wavelengths compared to the static approach whilst maintaining acceptable levels of delay and scalability. Firstly, the wavelength-routed optical-burst-switching (WR-OBS) network architecture is selected as the dynamic architecture to be studied, due to its feasibility of implementation and its improved network performance. Then, the wavelength requirements of dynamic WR-OBS are evaluated by means of novel analysis and simulation and compared to that of static networks for uniform and non-uniform traffic demand. It is shown that dynamic WR-OBS saves wavelengths with respect to the static approach only at low loads and especially for sparsely connected networks and that wavelength conversion is a key capability to significantly increase the benefits of dynamic operation. The mean delay introduced by dynamic operation of WR-OBS is then assessed. The results show that the extra delay is not significant as to violate end-to-end limits of time-sensitive applications. Finally, the limiting scalability of WR-OBS as a function of the lightpath allocation algorithm computational complexity is studied. The trade-off between the request processing time and blocking probability is investigated and a new low-blocking and scalable lightpath allocation algorithm which improves the mentioned trade-off is proposed. The presented algorithms and results can be used in the analysis and design of dynamic WRONs

Packet Scheduling Algorithms in LTE/LTE-A cellular Networks: Multi-agent Q-learning Approach

Spectrum utilization is vital for mobile operators. It ensures an efficient use of spectrum bands, especially when obtaining their license is highly expensive. Long Term Evolution (LTE), and LTE-Advanced (LTE-A) spectrum bands license were auctioned by the Federal Communication Commission (FCC) to mobile operators with hundreds of millions of dollars. In the first part of this dissertation, we study, analyze, and compare the QoS performance of QoS-aware/Channel-aware packet scheduling algorithms while using CA over LTE, and LTE-A heterogeneous cellular networks. This included a detailed study of the LTE/LTE-A cellular network and its features, and the modification of an open source LTE simulator in order to perform these QoS performance tests. In the second part of this dissertation, we aim to solve spectrum underutilization by proposing, implementing, and testing two novel multi-agent Q-learning-based packet scheduling algorithms for LTE cellular network. The Collaborative Competitive scheduling algorithm, and the Competitive Competitive scheduling algorithm. These algorithms schedule licensed users over the available radio resources and un-licensed users over spectrum holes. In conclusion, our results show that the spectrum band could be utilized by deploying efficient packet scheduling algorithms for licensed users, and can be further utilized by allowing unlicensed users to be scheduled on spectrum holes whenever they occur