Mobility-Based Routing Overhead Management in Reconfigurable Wireless Ad Hoc Networks Routing Overheads are the non-data message packets whose roles are establishment and maintenance of routes for data packets as well as neighbourhood discovery and maintenance. They have to be broadcasted in the network either through flooding or other techniques that can ensure that a path exists before data packets can be sent to various destinations. They can be sent reactively or periodically to neighbours so as to keep nodes updated on their neighbourhoods. While we cannot do without these overhead packets, they occupy much of the limited wireless bandwidth available in wireless networks. In a reconfigurable wireless ad hoc network scenario, these packets have more negative effects, as links need to be confirmed more frequently than in traditional networks mainly because of the unpredictable behaviour of the ad hoc networks. We therefore need suitable algorithms that will manage these overheads so as to allow data packet to have more access to the wireless medium, save node energy for longer life of the network, increased efficiency, and scalability. Various protocols have been suggested in the research area. They mostly address routing overheads for suitability of particular protocols leading to lack of standardisation and inapplicability to other protocol classes. In this dissertation ways of ensuring that the routing overheads are kept low are investigated. The issue is addressed both at node and network levels with a common goal of improving efficiency and performance of ad hoc networks without dedicating ourselves to a particular class of routing protocol. At node level, a method hereby referred to as "link availability forecast", that minimises routing overheads used for maintenance of neighbourhood, is derived. The targeted packets are packets that are broadcasted periodically (e.g. hello messages). The basic idea in this method is collection of mobility parameters from the neighbours and predictions or forecasts of these parameters in future. Using these parameters in simple calculations helps in identifying link availabilities between nodes participating in maintenance of networks backbone. At the network level, various approaches have been suggested. The first approach is the cone flooding method that broadcasts route request messages through a predetermined cone shaped region. This region is determined through computation using last known mobility parameters of the destination. Another approach is what is hereby referred as "destination search reverse zone method". In this method, a node will keep routes to destinations for a long time and use these routes for tracing the destination. The destination will then initiate route search in a reverse manner, whereby the source selects the best route for next delivery. A modification to this method is for the source node to determine the zone of route search and define the boundaries within which the packet should be broadcasted. The later method has been used for simulation purposes. The protocol used for verification of the improvements offered by the schemes was the AODV. The link availability forecast scheme was implemented on the AODV and labelled AODV_LA while the network level implementation was labelled AODV_RO. A combination of the two schemes was labelled AODV_LARO.

Significant challenges to patient monitoring systems in a hospital environment include the reliable and energy-efficient transmission of data and their real-time display. This thesis proposes innovative and novel mechanisms for the reliable transmission of patient data in Body Area Network (BAN) communication, which simultaneously ensure high throughput, low data latency, and low energy consumption by implementing energy and QoS aware routing protocols. Five main contributions are made in this regard. Firstly, a novel patient monitoring system (ZK-BAN peering framework) is proposed for real-time hospital BAN communication that displays patient data on the display units by considering data privacy, low energy consumption, better control on the devices, and patient mobility. Secondly, a novel energy-aware peering routing protocol (EPR) is introduced in which the choice of next hop is based on the residual energy and geographic information of the neighbor nodes. EPR contains three main components: a Hello protocol, a neighbor table constructor algorithm, and a routing table constructor algorithm. Thirdly, a new modular QoS-aware routing protocol (QPRD) is designed to handle the ordinary and delay-sensitive data for BAN communication in hospitals. QPRD provides an end-to-end path delay mechanism to calculate the path delays of all possible paths from a source to destination and then chooses the best path with the lowest path delay for delay-sensitive packets. Fourthly, a novel modular QoS-aware routing protocol (QPRR) is developed to handle ordinary and reliability-sensitive data for BAN communication in hospitals. The modular architecture of QPRR includes five modules: a reliability module, a packet classifier, a Hello protocol module, a routing services module, and a QoS-aware queuing module. The proposed mechanisms for end-to-end path reliability calculation and data transmission using redundant paths ensure more reliable BAN communication. Finally, a new integrated energy and QoS aware routing protocol (ZEQoS) is designed to deal with ordinary, delay-sensitive, and reliability-sensitive data packets. Extensive simulations in the OMNeT++ based Castalia 3.2 simulator show that EPR, QPRD, QPRR, and ZEQoS perform better than other similar energy and QoS aware routing protocols.

L'avenir de la communication est perçu comme étant quasiment exclusivement constitué de nœuds mobiles évoluant dans un réseau mobile. Dans ce contexte, différentes approches contribuent continuellement à l'amélioration directe ou indirecte des délais d'acheminement des informations échangées entre les utilisateurs, dont :- l'analyse des traces;- l'évaluation des performances ;- les services de localisation;- le routage. Nous décrivons chacun de ses thèmes et proposons des solutions faisant évoluer l'état de l'art. Celles-ci prennent appui sur des méthodes et outils tels que :- les Réseaux de Petri, pour l'analyse des traces ;- les modèles de mobilité, pour l'évaluation des performances;- l'introduction du social dans les services de localisation;- la mise en place d'une nouvelle métrique pour le routage. Nous montrons comment ces solutions concourent de façon complémentaire les unes avec les autres, à améliorer l'expérience de l'utilisateur. / Future of communication is perceived as being almost exclusively composed of mobile nodes operating in a mobile network. In this context, different approaches contribute to continually improve directly or indirectly, delivery times of information exchanged between users, including:- Trace analysis,- Performance evaluation,- Location services,- Routing.We describe each of these topics and propose solutions by changing the state of the art.These are supported by tools and methods such as:- Petri Nets for Trace analysis,- Mobility Models for Performance evaluation,- Social addings in Location services,- The establishment of metrics for Routing.We show how these solutions work together in a complementary manner with each other, to improve the user experience.

Les réseaux de capteurs sans fil sont utilisés dans de nombreuses applications de surveillance de l’environnement (par exemple, pour surveiller les volcans ou pour détecter les incendies de forêts). Dans de telles applications, les nœuds capteurs disposent d’une quantité limitée d’énergie, mais doivent fonctionner pendant des années sans avoir leurs batteries changées. La principale méthode utilisée pour permettre aux nœuds d’économiser leur énergie est de séquencer les périodes d’activité et d’inactivité. Cependant, la conception de protocoles MAC et de routage pour les applications avec des taux d’activité faibles est un défi. Dans cette thèse nous proposons des protocoles MAC avec de très faibles taux d’activité (moins de 1% d’activité) et des protocoles de routages adaptés pour des réseaux de capteurs sans fil dédiés aux applications de surveillance environnementale. Nos protocoles sont analysés et comparés aux protocoles existants par simulation et par expérimentation sur des nœuds TelosB. Malgré un taux d’activité très faible pour tous les nœuds, nos protocoles sont capables d’obtenir de bonnes performances, contrairement aux autres protocoles de la littérature, qui ne sont pas adaptés à opérer avec de faibles taux d’activité. / Wireless sensor networks are used in many environmental monitoring applications (e.g., to monitor forest fires or volcanoes). In such applications, sensor nodes have a limited quantity of energy, but must operate for years without having their batteries changed. The main mechanism used to allow nodes to save energy is to sequence periods of activity and inactivity. However, the design of MAC and routing protocols for applications with low duty-cycle is still a challenge. In this thesis, we proposed unsynchronized MAC and routing protocols for wireless sensor networks devoted to environmental monitoring applications. The main specificity of our protocols is that they are adapted to very low duty-cycle (less than 1 % for all nodes). Our protocols are analyzed and compared to existing protocols by simulation and experimentation on TelosB nodes. Despite this low duty-cycle for all nodes, our protocols are able to achieve good performance, unlike other protocols in the literature, which are not adapted to these extreme conditions.

The all-over trend for an universal access and ubiquitous access to the Internet is driving a revolution in our societies. In order to support this era of nomadic applications, new flexible network architectures have emerged. They are referred to as “wireless ad-hoc networks.” <p><p>Since human-operated devices will more likely be used indoor, it leads to many issues related to the strength of the fading in this environment. Recently, it has been suggested that a possible interaction might exist between various parameters of the ad-hoc networks and, more precisely, between the propagation model and the routing protocol. <p><p>To address this question, we present in this dissertation a cross-layer perspective of the analysis of these indoor ad-hoc networks. Our reasoning is made of four stages. First, the cross-layer interactions are analyzed by the means of multivariate statistical techniques. Since a cross-layering between the physical layer and the routing protocol has been proven to be significant, we further investigate the possible development a physical layer-constrained routing algorithm. <p><p>Second, fundamental equations governing the wireless telecommunications systems are developed in order to provide insightful informations on how a reliable routing strategy should be implemented in a strongly-faded environment. After that, and in order to allow a better spatial reuse, the routing protocol we propose is further enhanced by the adjonction of a power control algorithm. This last feature is extensively analyzed and a closed-form expression of the link probability of outage in presence of non-homogeneous transmission powers is given. Numerous simulations corroborate the applicability and the performance of the derived protocol. Also, we evaluate the gain, in terms of radio channel ressources, that has been achieved by the means of the power control algorithm. <p><p>Third, an architecture for the interconnection with a cellular network is investigated. A closed-form expression of the relaying stability of a node is given. This equation expresses the minimal requirement that a relaying node from the ad-hoc network must fullfil in order to bridge properly the connections to the base-station. <p><p>Finally, a real-life implementation is provided as a validation of the applicability of this novel ad-hoc routing protocol. It is concluded that, both from the performance and the spatial re-use point-of-views, it can be taken advantage from the cross-layering between the physical and the routing layers to positively enhance the networking architectures deployed in an indoor environment. / Doctorat en sciences appliquées / info:eu-repo/semantics/nonPublished

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / Smart grids and smart utility networks are the next-generation utility networks that intend to provide efficient control and management of utilities such as electricity, natural gas, water and sewage. Communication technology is the essential element for enabling formation of networks where control messages and metering data can be exchanged. In this work it is shown that wireless sensor and actuator networks are suitable candidates to implement this intelligent networks. The main routing algorithms for this category of wireless network are investigated in order to verify its performance when applied to the characteristics of smart utility networks, which are mainly related for large scale networks formed by hundreds to thousands of devices. It is shown that geographic routing is one of the most suitable routing strategies for large scale wireless networks, due to its low overhead and high scalability features. Usually, a geographic routing scheme combines a geographic greedy forwarding with a recovery mechanism to solve the local minima problem. Solutions proposed in the literature commonly combine greedy forwarding with the well known face routing for achieving this goal. However, the average path length in number of hops produced by face routing could be much worse than the optimal topological path in most realistic scenarios. In this work, it is proposed a new intermediate procedure between the geographic greedy mode and the recovery mode in order to improve routing efficiency in number of hops, without network overhead. It exploits the optimal topological route to base stations, obtained by beacon messages, as a resource to find better routes than the ones created by face routing. It is shown by simulations that the proposed hybrid approach leads to a significant improvement of routing performance when applied to combined greedy-face routing algorithms. Furthermore, experimental results obtained through testbeds shown that the proposed maintenance procedures are capable of avoid uctuations in the network infrastructure, providing robust routes for packet forwarding in large scale networks. / Smart grids e redes urbanas de comunicação formam a próxima geração de redes que pretende fornecer controle e gestão é eficiente aos servicos publicos como eletricidade, gás natural, água e esgoto. A tecnologia de comunicação é o elemento essencial para permitir a formação de redes em que mensagens de controle e dados de medição possam ser transmitidos. Neste trabalho demonstra-se que as redes de sensores e atuadores sem fio são candidatas viáveis e adequadas para implementar estas redes. Os principais algoritmos de roteamento para esta categoria de rede sem fios são investigados, a fim de verificar o seu desempenho quando aplicados às características das redes urbanas de comunicação, que geralmente são redes de grande escala formadas por centenas a milhares de dispositivos. Ainda, demostra-se que o roteamento geográfico �e uma das estratégias mais adequadas de roteamento para redes sem fio de grande escala, devido às suas características de baixa sobrecarga e alta escalabilidade. Estes algoritmos geralmente combinam um encaminhamento geográfico greedy com um mecanismo de recuperação para solucionar o problema dos mínimos locais, sendo o roteamento por faces a solução mais empregada na literatura como método de recuperação. No entanto, o número médio de saltos nos caminhos produzidos pelo roteamento por faces pode ser muito maior do que o caminho topológico ótimo na maioria dos cenários reais. Neste trabalho propõe-se um procedimento intermediário entre o encaminhamento geográfico greedy e o modo de recuperação, a fim de melhorar a eficiência em número de saltos sem gerar sobrecarga de mensagens de controle. Este procedimento explora as rotas topológicas ótimas para as estações base como um recurso adicional para encontrar rotas melhores para outros nós do que as geradas pelo roteamento por faces. Demonstra-se ainda através de simulações que a abordagem híbrida proposta melhora significativamente o desempenho do encaminhamento de pacotes quando aplicada a algoritmos greedy combinados com roteamento por faces. Ademais, os resultados experimentais obtidos através da planta teste comprovam que os procedimentos de manutenção propostos são capazes de evitar flutuações na infra-estrutura de rede, oferecendo rotas robustas para o encaminhamento de pacotes em redes de grande escala.

Récemment, dans la recherche automobile et dans le domaine des transports intelligents,plusieurs projets intéressants ont été menés afin de diminuer le nombre d’accidents. Lors du développement de ces projets, de nouveaux systèmes d’aide à la conduite ont été proposés,comme les systèmes de prévention de collision, d’aide à la vision de nuit et à la navigation.Ces études ont permis de proposer de nouvelles perspectives telles que les systèmes d’aide à la conduite coopératifs, en utilisant la communication entre les véhicules ou entre les véhicules et l’infrastructure basée sur les réseaux VANETs. Pour évaluer l’impact de systèmes ADAS sur l’amélioration de la sécurité routière et la réaction du conducteur, il est indispensable d’utiliser des outils flexibles et efficaces. Des métriques intéressantes sont ainsi proposées dans le but de tester la performance de ces systèmes. La plateforme LaRA qui est équipée de plusieurs capteurs et d’un système d’acquisition en temps réel nous a fourni une base de données réelles de position et de vitesse. Ces données sont traitées et analysées afin de calculer les métriques de performances tels que : la distance entre véhicules et le temps à collision. Nous avons proposé dans cette thèse une nouvelle méthodologie de développement pour le prototypage de systèmes ADAS. Cette méthodologie dédiée aux systèmes ADAS coopératifs, combine les données de plusieurs modules tels que : le module de vision, le module de communication V2V et le module de géo-localisation GPS. Un des problèmes majeurs des systèmes ADAS communicants concerne la qualité et la robustesse de la communication. Elle est fonction d’un grand nombre de paramètres qu’il faut modéliser pour pouvoir évaluer la fiabilité du système d’aide à la conduite.Nous proposons ainsi, un système de prototypage basé sur le principe de la réalité augmentée,dans lequel nous pouvons rejouer des données réelles et modifier des paramètres de l’environnement de communication. Nous avons mis en œuvre notre méthodologie avec la réalisation d’un système d’alerte coopératif entre les véhicules. Les données du système de géolocalisation GPS et les protocoles de routage ont été des éléments primordiaux pour la simulation du modèleV2V sous le simulateur ns-2. L’étape de la simulation du protocole avec les données réelles a été suivie par l’intégration des résultats de simulations dans le nouveau prototype développé sous RTMaps. La mise en œuvre du système d’alerte a permis d’estimer le nombre de pré-collisions détectées dans les deux situations réelle et simulée. L’écart entre ces deux dernières a été étudié et analysé pour plusieurs scénarios qui correspondent aux différentes situations routières. / During the last recent years, ADAS systems such as collision warning, tracking, night vision and navigation systems have been developed. The development of these systems has witness eda growing importance, as they are expected to help improving both road safety and traffic efficiency. More over, they have an ability to enhance the communication between the road infrastructure and the vehicle or between vehicles for safer and efficient transportation services such as : embedded advance collision, collision avoidance and automatic control. In addition,given the rapidly increasing interest in wireless communications, cooperative ADAS define anew framework of autonomous inter vehicular communication which operates on the assumption that such vehicles consist of a multitude of coordinated advanced sensory technologies.Sensors acquire real-time data about road conditions to help the driver respond effectively by sending appropriate messages between vehicles. In addition, these data help to assess the performance of ADAS in the context of improving driver behavior. It is necessary to set some main metrics such as inter-vehicle distance, driver reaction time and time to collision. The messages are transmitted to drivers using vehicular Ad-hoc networks (VANETs) which are a specific type of Mobile Ad-hoc Networks hold the promise to contribute to safe and more efficient roadways.In this thesis we proposed a new methodology of development to prototype ADAS. This methodology dedicated to cooperative ADAS drove us to implement a new simulated frameworkof prototyping system. This framework combines the data from three models : Geo-localizationGPS, vision and V2V communication towards an application of anti-collision warning system. A major problem in communicating ADAS systems is the quality and robustness of the communication.It depends on a large number of parameters that must be modeled to assess there liability of these systems. We developed a new prototyping system based on the principle ofaugmenting the reality in which we can replay actual data and change settings of communication environment. The GPS data and routing protocols were crucial elements for V2V model simulation into ns-2 simulator. We have performed real tests on the experimental prototyping platform LaRA. Multiple results are presented to show up the constancy of the method and the performance efficiency of real-time multi sensors in an integrated framework for collision avoidance applications. Results of this research have shown that IVCs simulations system provides enhanced data for the verification of features of new ADAS. The results of routing protocols simulation with real-time location data are integrated in the new developed prototype. The implementation of the system warning was used to estimate the number of pre-collisions detected in both real and simulated situations. The difference between these two situations was studied and analyzed for several scenarios corresponding to different road situations.

In the pursuit for ever-increasing compute power, and with Moore's law slowly coming to an end, high-performance computing started to scale-out to larger systems. Alongside the increasing system size, the interconnection network is growing to accommodate and connect tens of thousands of compute nodes. These networks have a large influence on total cost, application performance, energy consumption, and overall system efficiency of the supercomputer. Unfortunately, state-of-the-art routing algorithms, which define the packet paths through the network, do not utilize this important resource efficiently. Topology-aware routing algorithms become increasingly inapplicable, due to irregular topologies, which either are irregular by design, or most often a result of hardware failures. Exchanging faulty network components potentially requires whole system downtime further increasing the cost of the failure. This management approach becomes more and more impractical due to the scale of today's networks and the accompanying steady decrease of the mean time between failures. Alternative methods of operating and maintaining these high-performance interconnects, both in terms of hardware- and software-management, are necessary to mitigate negative effects experienced by scientific applications executed on the supercomputer. However, existing topology-agnostic routing algorithms either suffer from poor load balancing or are not bounded in the number of virtual channels needed to resolve deadlocks in the routing tables. Using the fail-in-place strategy, a well-established method for storage systems to repair only critical component failures, is a feasible solution for current and future HPC interconnects as well as other large-scale installations such as data center networks. Although, an appropriate combination of topology and routing algorithm is required to minimize the throughput degradation for the entire system. This thesis contributes a network simulation toolchain to facilitate the process of finding a suitable combination, either during system design or while it is in operation. On top of this foundation, a key contribution is a novel scheduling-aware routing, which reduces fault-induced throughput degradation while improving overall network utilization. The scheduling-aware routing performs frequent property preserving routing updates to optimize the path balancing for simultaneously running batch jobs. The increased deployment of lossless interconnection networks, in conjunction with fail-in-place modes of operation and topology-agnostic, scheduling-aware routing algorithms, necessitates new solutions to solve the routing-deadlock problem. Therefore, this thesis further advances the state-of-the-art by introducing a novel concept of routing on the channel dependency graph, which allows the design of an universally applicable destination-based routing capable of optimizing the path balancing without exceeding a given number of virtual channels, which are a common hardware limitation. This disruptive innovation enables implicit deadlock-avoidance during path calculation, instead of solving both problems separately as all previous solutions.

Mobility-Based Routing Overhead Management in Reconfigurable Wireless Ad Hoc Networks Routing Overheads are the non-data message packets whose roles are establishment and maintenance of routes for data packets as well as neighbourhood discovery and maintenance. They have to be broadcasted in the network either through flooding or other techniques that can ensure that a path exists before data packets can be sent to various destinations. They can be sent reactively or periodically to neighbours so as to keep nodes updated on their neighbourhoods. While we cannot do without these overhead packets, they occupy much of the limited wireless bandwidth available in wireless networks. In a reconfigurable wireless ad hoc network scenario, these packets have more negative effects, as links need to be confirmed more frequently than in traditional networks mainly because of the unpredictable behaviour of the ad hoc networks. We therefore need suitable algorithms that will manage these overheads so as to allow data packet to have more access to the wireless medium, save node energy for longer life of the network, increased efficiency, and scalability. Various protocols have been suggested in the research area. They mostly address routing overheads for suitability of particular protocols leading to lack of standardisation and inapplicability to other protocol classes. In this dissertation ways of ensuring that the routing overheads are kept low are investigated. The issue is addressed both at node and network levels with a common goal of improving efficiency and performance of ad hoc networks without dedicating ourselves to a particular class of routing protocol. At node level, a method hereby referred to as &amp;quot;link availability forecast&amp;quot;, that minimises routing overheads used for maintenance of neighbourhood, is derived. The targeted packets are packets that are broadcasted periodically (e.g. hello messages). The basic idea in this method is collection of mobility parameters from the neighbours and predictions or forecasts of these parameters in future. Using these parameters in simple calculations helps in identifying link availabilities between nodes participating in maintenance of networks backbone. At the network level, various approaches have been suggested. The first approach is the cone flooding method that broadcasts route request messages through a predetermined cone shaped region. This region is determined through computation using last known mobility parameters of the destination. Another approach is what is hereby referred as &amp;quot;destination search reverse zone method&amp;quot;. In this method, a node will keep routes to destinations for a long time and use these routes for tracing the destination. The destination will then initiate route search in a reverse manner, whereby the source selects the best route for next delivery. A modification to this method is for the source node to determine the zone of route search and define the boundaries within which the packet should be broadcasted. The later method has been used for simulation purposes. The protocol used for verification of the improvements offered by the schemes was the AODV. The link availability forecast scheme was implemented on the AODV and labelled AODV_LA while the network level implementation was labelled AODV_RO. A combination of the two schemes was labelled AODV_LARO.

Indiana University-Purdue University Indianapolis (IUPUI) / With the rapid growth in wireless mobile communication technology, Vehicular Ad-hoc Network (VANET) has emerged as a promising method to effectively solve transportation-related issues. So far, most of researches on VANETs have been conducted with simulations as the real-world experiment is expensive. A core problem affecting the fidelity of simulation is the mobility model employed. In this thesis, a sophisticated traffic simulator capable of generating realistic vehicle traces is introduced. Combined with network simulator NS-2, we used this tool to evaluate the general performance of several routing protocols and studied the impact of intersections on simulation results. We show that static nodes near the intersection tend to become more active in packet delivery with higher transferred throughput.