Validation of Two Distributed, Autonomous Self-Organisation Algorithms for 802.11 Mesh Networks by Simulation

Two algorithms in a "self-organisation of multi-radio mesh networks" project are described and validated by simulation. As they are to be deployed over large networks the two challenges have been the scalability and stability of the solution. The basic approach is that of a distributed, light-weight, cooperative multiagent system that guarantees scalability. As the solution is distributed it is unsuitable to achieve any global optimisation goal --- in any case, we argue that global optimisation of mesh network performance in any significant sense is not feasible in real situations that are subjected to unanticipated perturbations and external intervention. Our overall goal is simply to reduce maintenance costs for such networks by removing the need for humans to tune the network settings. So stability of the algorithms is our main concern

Enabling Parallel Wireless Communication in Mobile Robot Teams

Wireless inter-robot communication enables robot teams to cooperatively solve complex problems that cannot be addressed by a single robot. Applications for cooperative robot teams include search and rescue, exploration and surveillance. Communication is one of the most important components in future autonomous robot systems and is essential for core functions such as inter-robot coordination, neighbour discovery and cooperative control algorithms. In environments where communication infrastructure does not exist, decentralised multi-hop networks can be constructed using only the radios on-board each robot. These are known as wireless mesh networks (WMNs). However existing WMNs have limited capacity to support even small robot teams. There is a need for WMNs where links act like dedicated point-to-point connections such as in wired networks. Addressing this problem requires a fundamentally new approach to WMN construction and this thesis is the first comprehensive study in the multi-robot literature to address these challenges. In this thesis, we propose a new class of communication systems called zero mutual interference (ZMI) networks that are able to emulate the point-to-point properties of a wired network over a WMN implementation. We instantiate the ZMI network using a multi-radio multi-channel architecture that autonomously adapts its topology and channel allocations such that all network edges communicate at the full capacity of the radio hardware. We implement the ZMI network on a 100-radio testbed with up to 20-individual nodes and verify its theoretical properties. Mobile robot experiments also demonstrate these properties are practically achievable. The results are an encouraging indication that the ZMI network approach can facilitate the communication demands of large cooperative robot teams deployed in practical problems such as data pipe-lining, decentralised optimisation, decentralised data fusion and sensor networks

De l'évaluation des performances Wi-Fi à la mobilité contrôlée pour les réseaux de drones

Mobility in telecommunication networks is often seen as a hassle that needs to be dealt with: a mobile wireless device has to adapt is trans-mission parameters in order to remain connected to its counterpart(s),as the channel evolves with the device’s movements. Drones, which are unmanned aerial vehicles in the context of this thesis, are no exception.Because of their freedom of movement, their three-dimensional mobility in numerous and varied environments, their limited payload and their energy constraints, and because of the wide range of their real-world applications, drones represent new exciting study objects whose mobility is a challenge. Yet, mobility can also be a chance for drone networks,especially when we can control it. In this thesis, we explore how con-trolled mobility can be used to increase the performance of a drone network, with a focus on IEEE 802.11 networks and small multi-rotor drones. We first describe how mobility is dealt with in 802.11 networks,that is to say using rate adaptation mechanisms, and reverse engineer the rate adaptation algorithm used in the Wi-Fi chipset of the Intel Aero Drone. The study of this rate adaptation algorithm, both experimental and through simulation, through its implementation in the network simulator NS-3, allows its comparison against other well-known algorithms.This highlights how big the impact of such algorithms are for drone networks, with regard to their mobility, and how different the resulting behaviors of each node can be. Therefore, a controlled mobility solution aiming to improve network performances cannot assume much about the behavior of the rate adaptation algorithms. In addition to that, drone applications are diverse, and imposing mobility constraints without crippling a complete pan of these applications is difficult. We therefore propose a controlled mobility solution which leverages the antenna radiation pattern of the drones. This algorithm is evaluated thanks to a customized simulation framework for antenna and drone simulation,based on NS-3. This solution, which works with any rate adaptation algorithm, is distributed, and do not require a global coordination that would be costly. It also does not require a full and complete control of the drone mobility as existing controlled mobility solutions require, which makes this solution compatible with various applications.La mobilité dans les réseaux de télécommunications est souvent considérée comme un problème qu'il faut résoudre : un appareil mobile sans fil doit adapter ses paramètres de transmission afin de rester connecté à son ou ses homologues, car le canal évolue avec les mouvements de l'appareil. Les drones, qui sont des véhicules aériens sans pilote, ne font pas exception. En raison de leur grande liberté de mouvements, de leur mobilité tridimensionnelle, et ce dans des environnements aussi nombreux que variés, de leur charge utile limitée et de leurs contraintes énergétiques, et en raison du large éventail de leurs applications dans le monde réel, les drones représentent de nouveaux objets d'étude passionnants dont la mobilité est un défi. Pourtant, la mobilité peut aussi être une chance pour les réseaux de drones, surtout lorsque nous pouvons la contrôler. Dans cette thèse, nous explorons comment la mobilité contrôlée peut être utilisée pour augmenter les performances d'un réseau de drones, en mettant l'accent sur les réseaux IEEE 802.11 et les petits drones multi-rotor. Nous décrivons d'abord comment la mobilité est traitée dans les réseaux 802.11, c'est-à-dire en utilisant des mécanismes d'adaptation de débit, puis nous effectuons l'ingénierie inverse de l'algorithme d'adaptation de débit utilisé dans le chipset Wi-Fi du drone Intel Aero. L'étude de cet algorithme d'adaptation de débit, de manière à la fois expérimentale et par simulation, grâce à son implémentation dans le simulateur de réseau NS-3, permet de le comparer à d'autres algorithmes bien connus. Cette étude met en évidence l'importance de ces algorithmes pour les réseaux de drones, en lien avec leur mobilité, et la différence de comportement de chaque nœud en résultant. Par conséquent, une solution de mobilité contrôlée visant à améliorer les performances des réseaux ne peut pas supposer beaucoup du comportement des algorithmes d'adaptation de débits. En outre, les applications des réseaux de drones sont diverses, et il est difficile d'imposer des contraintes de mobilité sans devenir incompatible avec un pan complet d'applications. Nous proposons donc une solution de mobilité contrôlée qui exploite le diagramme de rayonnement de l'antenne des drones. Cet algorithme est évalué grâce à outil de simulation développé pour l'occasion, permettant la simulation d'antennes et de drones, basé sur NS-3. Cette solution, qui fonctionne avec n'importe quel algorithme d'adaptation de débit, est distribuée, et ne nécessite aucune coordination globale ou communication spécifique qui pourrait s'avérer coûteuses. Elle ne nécessite pas non plus un contrôle complet de la mobilité du drone comme le requièrent les solutions de mobilité contrôlée existantes, ce qui rend cette solution compatible avec diverses applications

Intrusion tolerant routing with data consensus in wireless sensor networks

Dissertação para obtenção do Grau de Mestre em Engenharia InformáticaWireless sensor networks (WSNs) are rapidly emerging and growing as an important new area in computing and wireless networking research. Applications of WSNs are numerous, growing, and ranging from small-scale indoor deployment scenarios in homes and buildings to large scale outdoor deployment settings in natural, industrial, military and embedded environments. In a WSN, the sensor nodes collect data to monitor physical conditions or to measure and pre-process physical phenomena, and forward that data to special computing nodes called Syncnodes or Base Stations (BSs). These nodes are eventually interconnected, as gateways, to other processing systems running applications. In large-scale settings, WSNs operate with a large number of sensors – from hundreds to thousands of sensor nodes – organised as ad-hoc multi-hop or mesh networks, working without human supervision. Sensor nodes are very limited in computation, storage, communication and energy resources. These limitations impose particular challenges in designing large scale reliable and secure WSN services and applications. However, as sensors are very limited in their resources they tend to be very cheap. Resilient solutions based on a large number of nodes with replicated capabilities, are possible approaches to address dependability concerns, namely reliability and security requirements and fault or intrusion tolerant network services. This thesis proposes, implements and tests an intrusion tolerant routing service for large-scale dependable WSNs. The service is based on a tree-structured multi-path routing algorithm, establishing multi-hop and multiple disjoint routes between sensors and a group of BSs. The BS nodes work as an overlay, processing intrusion tolerant data consensus over the routed data. In the proposed solution the multiple routes are discovered, selected and established by a self-organisation process. The solution allows the WSN nodes to collect and route data through multiple disjoint routes to the different BSs, with a preventive intrusion tolerance approach, while handling possible Byzantine attacks and failures in sensors and BS with a pro-active recovery strategy supported by intrusion and fault tolerant data-consensus algorithms, performed by the group of Base Stations

A Cross-Layer Modification to the DSR Routing Protocol in Wireless Mesh Networks

A cross-layer modification to the DSR routing protocol that finds high throughput paths in WMNs has been introduced in this work. The Access Efficiency Factor (AEF) has been introduced in this modification as a local congestion avoidance metric for the DSR routing mechanism as an alternative to the hop count (Hc) metric. In this modification, the selected path is identified by finding a path with the highest minimum AEF (max_min_AEF) value. The basis of this study is to compare the performance of the Hc and max_min_AEF as routing metrics for the DSR protocol in WMNs using the OPNET modeler. Performance comparisons between max_min_AEF, Metric Path (MP), and the well known ETT metrics are also carried out in this work. The results of this modification suggest that employing the max_min_AEF as a routing metric outperforms the Hc, ETT, and MP within the DSR protocol in WMNs in terms of throughput. This is because the max_min_AEF is based upon avoiding directing traffic through congested nodes where significant packet loss is likely to occur. This throughput improvement is associated with an increment in the delay time due to the long paths taken to avoid congested regions. To overcome this drawback, a further modification to the routing discovery mechanism has been made by imposing a hop count limit (HCL) on the discovered paths. Tuning the HCL allows the network manager to tradeoff throughput against delay. The choice of congestion avoidance metric exhibits another shortcoming owing to its dependency on the packet size. It penalises the smaller packets over large ones in terms of path lengths. This has been corrected for by introducing a ModAEF metric that explicitly considers the size of the packet. The ModAEF metric includes a tuning factor that allows the operator determine the level of the weighting that should be applied to the packet size to correct for this dependence

Traffic engineering multi-layer optimization for wireless mesh network transmission a campus network routing protocol transmission performance inhancement

This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel UniversityThe wireless mesh network is a potential network for the future due to its excellent inherent characteristic for dynamic self-healing, self-configuration and self-organization. It also has the advantage of easy interoperability networking and the ability to form multi-linked ad-hoc networks. It has a decentralized topology, is cheap and highly scalable. Furthermore, its ease in deployment and easy maintenance are other inherent networking qualities. These aforementioned qualities of the wireless mesh network bring advantages to transmission capability of heterogeneous networks. However, transmissions in wireless mesh network create comparative performance based challenges such as congestion, load-balancing, scalability over increasing networks and coverage capacity. Consequently, these challenges and problems in the routing and switching of packets in the wireless mesh network routing protocols led to a proposal on the resolution of these failures with a combination algorithm and a management based security for the network and its transmitted packets. There are equally contentious services like reliability of the network and quality of service for real-time multimedia traffic flows with other challenges such as path computation and selection in the wireless mesh network. This thesis is therefore a cumulative proposal to the resolution of the outlined challenges and open research areas posed by using wireless mesh network routing protocol. It advances the resolution of these challenges in the mesh environment using a hybrid optimization – traffic engineering, to increase the effectiveness and the reliability of the network. It also proffers a cumulative resolution of the diverse contributions on wireless mesh network routing protocol and transmission. Adaptation and optimization are carried out on the wireless mesh network designed network using traffic engineering mechanism and technique. The research examines the patterns of mesh packet transmission and evaluates the challenges and failures in the mesh network packet transmission. It develops a solution based algorithm for resolutions and proposes the traffic engineering based solution.. These resultant performances and analysis are usually tested and compared over wireless mesh IEEE802.11n or other older proposed documented solution. This thesis used a carefully designed campus mesh network to show a comparative evaluation of an optimal performance of the mesh nodes and routers over a normal IEE802.11n based wireless domain network to show differentiation by optimization using the created algorithms. Furthermore, the indexes of performance being the metric are used to measure the utility and the reliability, including capacity and throughput at the destination during traffic engineered transmission. In addition, the security of these transmitted data and packets are optimized under a traffic engineered technique. Finally, this thesis offers an understanding to the security contribution using traffic engineering resolution to create a management algorithm for processing and computation of the wireless mesh networks security needs. The results of this thesis confirmed, completed and extended the existing predictions with real measurement

Internet of robotic things : converging sensing/actuating, hypoconnectivity, artificial intelligence and IoT Platforms

The Internet of Things (IoT) concept is evolving rapidly and influencing newdevelopments in various application domains, such as the Internet of MobileThings (IoMT), Autonomous Internet of Things (A-IoT), Autonomous Systemof Things (ASoT), Internet of Autonomous Things (IoAT), Internetof Things Clouds (IoT-C) and the Internet of Robotic Things (IoRT) etc.that are progressing/advancing by using IoT technology. The IoT influencerepresents new development and deployment challenges in different areassuch as seamless platform integration, context based cognitive network integration,new mobile sensor/actuator network paradigms, things identification(addressing, naming in IoT) and dynamic things discoverability and manyothers. The IoRT represents new convergence challenges and their need to be addressed, in one side the programmability and the communication ofmultiple heterogeneous mobile/autonomous/robotic things for cooperating,their coordination, configuration, exchange of information, security, safetyand protection. Developments in IoT heterogeneous parallel processing/communication and dynamic systems based on parallelism and concurrencyrequire new ideas for integrating the intelligent “devices”, collaborativerobots (COBOTS), into IoT applications. Dynamic maintainability, selfhealing,self-repair of resources, changing resource state, (re-) configurationand context based IoT systems for service implementation and integrationwith IoT network service composition are of paramount importance whennew “cognitive devices” are becoming active participants in IoT applications.This chapter aims to be an overview of the IoRT concept, technologies,architectures and applications and to provide a comprehensive coverage offuture challenges, developments and applications