Retournement temporel : application aux réseaux mobiles

This thesis studies the time reversal technique to improve the energy efficiency of future mobile networks and reduce the cost of future mobile devices. Time reversal technique consists in using the time inverse of the propagation channel impulse response (between a transceiver and a receiver) as a prefilter. Such pre-filtered signal is received with a stronger power (this is spatial focusing) and with a strong main echo, relatively to secondary echoes (this is time compression). During a previous learning phase, the transceiver estimates the channel by measuring the pilot signal emitted by the receiver. Space-time focusing is obtained only at the condition that the propagation remains identical between the learning phase and the data transmission phase: this is the ‘channel reciprocity’ condition. Numerous works show that spatial focusing allows for the reduction of the required transmit power for a given target received power, on the one hand, and that time compression allow for the reduction of the required complexity at the receiver side to handle multiple echoes, on the other hand. However, studies on complexity reduction are limited to ultra wideband. Some works of this thesis (based on simulations and experimental measurements) show that, for bands which are more typical for future networks (a carrier frequency of 1GHz and a spectrum of 30 MHz to 100 MHz), thanks to time reversal, a simple receiver and a mono-carrier signal are sufficient to reach high data rates. Moreover, the channel reciprocity condition is not verified in two scenarios which are typical from mobile networks. Firstly, in most European mobile networks, the frequency division duplex mode is used. This mode implies that the transceiver and the receiver communicate on distinct carriers, and therefore through different propagation channels. Secondly, when considering a receiver on a moving connected vehicle, the transceiver and the receiver communicate one with each other at distinct instants, corresponding to distinct positions of the vehicles, and therefore through different propagation channels. Some works of this thesis propose solutions to obtain space-time focusing for these two scenarios. Finally, some works of this thesis explore the combination of time reversal with other recent signal processing techniques (spatial modulation, on the one hand, a new multi-carrier waveform, on the other hand), or new deployment scenarios (millimeter waves and large antenna arrays to interconnect the nodes of an ultra dense network) or new applications (guidance and navigation) which can be envisaged for future mobile networks.Cette thèse étudie la technique dite de ‘Retournement Temporel’ afin d’améliorer l’efficacité énergétique des futurs réseaux mobiles d’une part, et réduire le coût des futurs terminaux mobiles, d’autre part. Le retournement temporel consiste à utiliser l’inverse temporel de la réponse impulsionnelle du canal de propagation entre un émetteur et un récepteur pour préfiltrer l’émission d’un signal de données. Avantageusement, le signal ainsi préfiltré est reçu avec une puissance renforcée (c’est la focalisation spatiale) et un écho principal qui est renforcé par rapport aux échos secondaires (c’est la compression temporelle). Lors d’une étape préalable d’apprentissage, l’émetteur estime le canal en mesurant un signal pilote provenant du récepteur. La focalisation spatiotemporelle n’est obtenue qu’à condition que la propagation demeure identique entre la phase d’apprentissage et la phase de transmission de données : c’est la condition de ‘réciprocité du canal’. De nombreux travaux montrent que la focalisation spatiale permet de réduire la puissance émise nécessaire pour atteindre une puissance cible au récepteur d’une part, et que la compression temporelle permet de réduire la complexité du récepteur nécessaire pour gérer l’effet des échos multiples, d’autre part. Cependant, les études sur la réduction de la complexité du récepteur se limitent à l’ultra large bande. Des travaux de cette thèse (basés sur des simulations et des mesures expérimentales) montrent que pour des bandes de fréquences plus typiques des futurs réseaux mobiles (fréquence porteuse à 1GHz et spectre de 30 MHz à 100 MHz), grâce au retournement temporel, un récepteur simple et un signal monoporteuse suffisent pour atteindre de hauts débits. En outre, la condition de réciprocité du canal n’est pas vérifiée dans deux scénarios typiques des réseaux mobiles. Tout d’abord, dans la plupart des réseaux mobiles européens, le mode de duplex en fréquence est utilisé. Ce mode implique que l’émetteur et le récepteur communiquent l’un avec l’autre sur des fréquences porteuses distinctes, et donc à travers des canaux de propagations différents. De plus, lorsqu’on considère un récepteur sur un véhicule connecté en mouvement, l’émetteur et le récepteur communiquent l’un avec l’autre à des instants distincts, correspondants à des positions distinctes du véhicule, et donc à travers des canaux de propagations différents. Des travaux de cette thèse proposent des solutions pour obtenir la focalisation spatio-temporelle dans ces deux scenarios. Enfin, des travaux de la thèse explorent la combinaison du retournement temporel avec d’autres techniques de traitement de signal récentes (la modulation spatiale, d’une part, et une nouvelle forme d’onde multiporteuse, d’autre part), ou des scenarios de déploiement nouveaux (ondes millimétriques et très grands réseaux d’antennes pour inter-connecter les noeuds d’un réseau ultra dense) ou de nouvelles applications (guidage et navigation) envisageables pour les futurs réseaux mobiles

Ant-inspired Interaction Networks For Decentralized Vehicular Traffic Congestion Control

Mimicking the autonomous behaviors of animals and their adaptability to changing or foreign environments lead to the development of swarm intelligence techniques such as ant colony optimization (ACO) and particle swarm optimization (PSO) now widely used to tackle a variety of optimization problems. The aim of this dissertation is to develop an alternative swarm intelligence model geared toward decentralized congestion avoidance and to determine qualities of the model suitable for use in a transportation network. A microscopic multi-agent interaction network inspired by insect foraging behaviors, especially ants, was developed and consequently adapted to prioritize the avoidance of congestion, evaluated as perceived density of other agents in the immediate environment extrapolated from the occurrence of direct interactions between agents, while foraging for food outside the base/nest. The agents eschew pheromone trails or other forms of stigmergic communication in favor of these direct interactions whose rate is the primary motivator for the agents\u27 decision making process. The decision making process at the core of the multi-agent interaction network is consequently transferred to transportation networks utilizing vehicular ad-hoc networks (VANETs) for communication between vehicles. Direct interactions are replaced by dedicated short range communications for wireless access in vehicular environments (DSRC/WAVE) messages used for a variety of applications like left turn assist, intersection collision avoidance, or cooperative adaptive cruise control. Each vehicle correlates the traffic on the wireless network with congestion in the transportation network and consequently decides whether to reroute and, if so, what alternate route to take in a decentralized, non-deterministic manner. The algorithm has been shown to increase throughput and decrease mean travel times significantly while not requiring access to centralized infrastructure or up-to-date traffic information

Routing Algorithm for Vehicular Ad Hoc Network Based on Dynamic Ant Colony Optimization

Increasing interests in Vehicular Ad hoc networks over the last decade have led to huge investments. VANET (Vehicular Ad-hoc Network) is a new field of technology which has been widely used in autonomous systems. Due to rapid topology changing and frequent disconnection makes it difficult to design an efficient routing protocol. Various routing protocols for VANETs have been recently proposed. Most approaches ignored parameters which effect performance of real VANET applications like environmental changes. Environmental changes can affect both performance and throughput in VANET. In this paper, we proposed a routing algorithm based on ant colony optimization and DYMO (Dynamic MANET On-demand) protocol which copes with changes in environment. Ant colony optimization algorithm is a probabilistic technique which has been widely used in finding routes through graphs. Two parameters were considered to evaluate discovered paths in this paper: (i) delay time, (ii) path reliability. Ns-2 was used to implement the proposed algorithm and monitor its performance through different amount of modifications in environment. Results proved that the proposed ant colony routing algorithm can achieve better performance in compare of other well-known methods like Ad Hoc on Demand Distance Vector (AODV)

An improved MultiAnts-Aodv routing protocol for ad hoc wireless networks

Compared to the conventional table-driven and on-demand routing protocols, a hybrid routing protocol [71], which uses mobile agents and reactive route discovery, introduced a more realistic solution to this problem. However, the mobile agents were not fully exploited in this protocol. In this thesis research, we will propose an improved MultiAnts-AODV routing protocol based on ant-AODV The goal of our design is to reduce the end-to-end delay and route discovery latency. To achieve a better performance, the communication scheme among the agents is strengthened. We also present an improved navigation algorithm for mobile agents to update the routing tables more efficiently. We extend the routing table to reduce the latency of routing discovery in case of link failures. The simulation based comparisons among several navigation algorithms are also presented

Modeling and simulation of routing protocol for ad hoc networks combining queuing network analysis and ANT colony algorithms

The field of Mobile Ad hoc Networks (MANETs) has gained an important part of the interest of researchers and become very popular in last few years. MANETs can operate without fixed infrastructure and can survive rapid changes in the network topology. They can be studied formally as graphs in which the set of edges varies in time. The main method for evaluating the performance of MANETs is simulation. Our thesis presents a new adaptive and dynamic routing algorithm for MANETs inspired by the Ant Colony Optimization (ACO) algorithms in combination with network delay analysis. Ant colony optimization algorithms have all been inspired by a specific foraging behavior of ant colonies which are able to find, if not the shortest, at least a very good path connecting the colony’s nest with a source of food. Our evaluation of MANETs is based on the evaluation of the mean End-to-End delay to send a packet from source to destination node through a MANET. We evaluated the mean End-to-End delay as one of the most important performance evaluation metrics in computer networks. Finally, we evaluate our proposed ant algorithm by a comparative study with respect to one of the famous On-Demand (reactive) routing protocols called Ad hoc On-Demand Distance Vector (AODV) protocol. The evaluation shows that, the ant algorithm provides a better performance by reducing the mean End-to-End delay than the AODV algorithm. We investigated various simulation scenarios with different node density and pause times. Our new algorithm gives good results under certain conditions such as, increasing the pause time and decreasing node density. The scenarios that are applied for evaluating our routing algorithm have the following assumptions: 2-D rectangular area, no obstacles, bi-directional links, fixed number of nodes operate for the whole simulation time and nodes movements are performed according to the Random Waypoint Mobility (RWM) or the Boundless Simulation Area Mobility (BSAM) model. KEYWORDS: Ant Colony Optimization (ACO), Mobile Ad hoc Network (MANET), Queuing Network Analysis, Routing Algorithms, Mobility Models, Hybrid Simulation

Emergence in the security of protocols for mobile ad-hoc networks

This thesis is concerned with the study of secure wireless routing protocols, which have been deployed for the purpose of exchanging information in an adhoc networking enviromnent. A discrete event simulator is developed, utilising an adaptive systems modelling approach and emergence that aims to assess networking protocols in the presence of adversarial behaviour. The model is used in conjunction with the characteristics that routing protocols have and also a number of cryptographic primitives that can be deployed in order to safeguard the information being exchanged. It is shown that both adversarial behaviour, as well as protocol descriptions can be described in a way that allows for them to be treated as input on the machine level. Within the system, the output generated selects the fittest protocol design capable of withstanding one or more particular type of attacks. As a result, a number of new and improved protocol specifications are presented and benchmarked against conventional metrics, such as throughput, latency and delivery criteria. From this process, an architecture for designing wireless routing protocols based on a number of security criteria is presented, whereupon the decision of using particular characteristics in a specification has been passed onto the machine level

Waveform and Beamforming Design for Intelligent Reflecting Surface Aided Wireless Power Transfer: Single-User and Multi-User Solutions

In this paper, we study the waveform and passive beamforming design for intelligent reflecting surface (IRS)-aided wireless power transfer (WPT). Generalized multi-user and low complexity single-user algorithms are derived based on alternating optimization (AO) framework to maximize the weighted sum output DC current, subject to transmit power constraints and passive beamforming phases unit modulus constraints. The input signal waveform and IRS passive beamforming phase shifts are jointly designed as a function of users' individual frequency-selective channel state information (CSI). The energy harvester nonlinearity is explored and two IRS deployment schemes, namely frequency selective IRS (FS-IRS) and frequency flat IRS (FF-IRS), are modeled and analyzed. This paper highlights the fact that IRS can provide an extra passive beamforming gain on output DC power over conventional WPT designs and significantly influence the waveform design by leveraging the benefit of passive beamforming, frequency diversity and energy harvester nonlinearity. Even though FF-IRS exhibits lower output DC current than FS-IRS, it still achieves substantially increased DC power over conventional WPT designs. Performance evaluations confirm the significant benefits of a joint waveform and passive beamforming design accounting for the energy harvester nonlinearity to boost the performance of single-user and multi-user WPT system.Comment: 32 pages, 19 figures, submitted for publicatio

Application of Integer Programming for Mine Evacuation Modeling with Multiple Transportation Modes

The safe evacuation of miners during an emergency within the shortest possible time is very important for the success of a mine evacuation program. Despite developments in the field of mine evacuation, little research has been done on the use of mine vehicles during evacuation. Current research into mine evacuation has emphasized on miner evacuation by foot. Mathematical formulations such as Minimum Cost Network Flow (MCNF) models, Ant Colony algorithms, and shortest path algorithms including Dijkstra's algorithm and Floyd-Warshall algorithm have been used to achieve this. These models, which concentrate on determining the shortest escape routes during evacuation, have been found to be computationally expensive with expanding problem sizes and parameter ranges or they may not offer the best possible solutions.An ideal evacuation route for each miner must be determined considering the available mine vehicles, locations of miners, safe havens such as refuge chambers, and fresh-air bases. This research sought to minimize the total evacuation cost as a function of the evacuation time required during an emergency while simultaneously helping to reduce the risk of exposure of the miners to harmful conditions during the evacuation by leveraging the use of available mine vehicles. A case study on the Turquoise Ridge Underground Mine (Nevada Gold Mines) was conducted to validate the Integer Programming (IP) model. Statistical analysis of the IP model in comparison with a benchmark MCNF model proved that leveraging the use of mine vehicles during an emergency can further reduce the total evacuation time. A cost-savings analysis was made for the IP model, and it was found that the time saved during evacuation, by utilizing the IP model, increased linearly, with an increase in the number of miners present at the time of evacuation

ACODV : Ant Colony Optimisation Distance Vector routing in ad hoc networks

A mobile ad hoc network is a collection of wireless mobile devices which dynamically form a temporary network, without using any existing network infrastructure or centralised administration. Each node in the network effectively becomes a router, and forwards packets towards the packet’s destination node. Ad hoc networks are characterized by frequently changing network topology, multi-hop wireless connections and the need for dynamic, efficient routing protocols. The overarching requirement for low power consumption, as battery powered sensors may be required to operate for years without battery replacement; An emphasis on reliable communication as opposed to real-time communication, it is more important for packets to arrive reliably than to arrive quickly; and Very scarce processing and memory resources, as these sensors are often implemented on small low-power microprocessors. This work provides overviews of routing protocols in ad hoc networks, swarm intelligence, and swarm intelligence applied to ad hoc routing. Various mechanisms that are commonly encountered in ad hoc routing are experimentally evaluated under situations as close to real-life as possible. Where possible, enhancements to the mechanisms are suggested and evaluated. Finally, a routing protocol suitable for such low-power sensor networks is defined and benchmarked in various scenarios against the Ad hoc On-Demand Distance Vector (AODV) algorithm.Dissertation (MSc)--University of Pretoria, 2005.Computer ScienceUnrestricte