Étude et simulation d'un schéma de réservation de bande passante dans les réseaux ad-hoc

Les réseaux radio permettant de connecter des ordinateurs de manière ad-hoc sont en plein développement. Le matériel existe, des protocoles de routage sont en cours de normalisation. Cependant, l'intégration de qualité de service reste un problème clé dans l'utilisation d'applications multi-média sur de tels réseaux. Ce rapport de recherche consiste à aborder ce thème sous l'angle plus restreint de la réservation de bande passante. Le problème est ici plus difficile que dans les réseaux classiques car les connexions interfèrent les unes avec les autres. Si on utilise de la bande passante sur une connexion, alors d'autres connexions voient leur débit diminuer. Nous nous proposons de trouver des schémas de réservation de bande passante envisageables d'un point de vue algorithmique, et d'en analyser les performanc- es du point de vue radio.Cette étude s'applique principalement aux réseaux ad-hoc (sans infrastructure : les noeuds eux mêmes relaient les paquets)

Duplicate address detection and autoconfiguration in OLSR

Mobile Ad hoc NETworks (MANETs) are infrastructure-free, highly dynamic wireless networks, where central administration or configuration by the user is very difficult. In hardwired networks nodes usually rely on a centralized server and use a dynamic host configuration protocol, like DHCP , to acquire an IP address. Such a solution cannot be deployed in MANETs due to the unavailability of any centralized DHCP server. For small scale MANETs, it may be possible to allocate free IP addresses manually. However, the procedure becomes impractical for a large-scale or open system where mobile nodes are free to join and leave. Most of the autoconfiguration algorithms proposed for ad hoc networks are independent of the routing protocols and therefore, generate a significant overhead. Using the genuine optimization of the underlying routing protocol can significantly reduce the autoconfiguration overhead. One of the MANET protocols which have been recently promoted to RFC is the OLSR routing protocol , on which this article focuses. This article aims at complementing the OLSR routing protocol specifications to handle autoconfiguration. The corner stone of this autoconfiguration protocol is an advanced duplicate address detection algorithm. Under well defined assumptions, we prove the correctness of the the proposed autoconfiguration protocol

An Advanced Configuration and Duplicate Address Detection mechanism for a multi-interface OLSR Network

Mobile Ad hoc NETworks (MANETs) are infrastructure-free, highly dynamic wireless networks, where central administration or configuration by the user is very difficult. In hardwired networks nodes usually rely on a centralized server and use a dynamic host configuration protocol, like DHCP, to acquire an IP address. Such a solution cannot be deployed in MANETs due to the unavailability of any centralized DHCP server. For small scale MANETs, it may be possible to allocate free IP addresses manually. However, the procedure becomes impractical for a large-scale or open system where mobile nodes are free to join and leave. Numerous dynamic addressing schemes for ad hoc networks have been proposed. These approaches differ in a wide range of aspects, such as the usage of centralized servers or full decentralization, hierarchical structure or flat network organization, and explicit or implicit duplicate address detection. In this paper we will present a complete and optimized version of the auto-configuration solutions for OLSR , that we have already proposed in and . This solution works in the case of a nodes having multiple interfaces, and is based on an efficient Duplicate Address Detection(DAD) algorithm which takes advantage of the genuine optimization of the OLSR routing protocol. A proof of the correct operation of the proposed solution is given and the communication overhead induced is evaluated

Efficient and Dynamic Group Key Agreement in Ad hoc Networks

Confidentiality, integrity and authentication are more relevant issues in Ad hoc networks than in wired fixed networks. One way to address these issues is the use of symmetric key cryptography, relying on a secret key shared by all members of the network. But establishing and maintaining such a key (also called the session key) is a non-trivial problem. We show that Group Key Agreement (GKA) protocols are suitable for establishing and maintaining such a session key in these dynamic networks. We take an existing GKA protocol, which is robust to connectivity losses and discuss all the issues for good functioning of this protocol in Ad hoc networks. We give implementation details and network parameters, which significantly reduce the computational burden of using public key cryptography in such networks

Duplicate address detection and autoconfiguration in OLSR

Mobile Ad hoc NETworks (MANETs) are infrastructure-free, highly dynamic wireless networks, where central administration or configuration by the user is very difficult. In hardwired networks nodes usually rely on a centralized server and use a dynamic host configuration protocol, like DHCP , to acquire an IP address. Such a solution cannot be deployed in MANETs due to the unavailability of any centralized DHCP server. For small scale MANETs, it may be possible to allocate free IP addresses manually. However, the procedure becomes impractical for a large-scale or open system where mobile nodes are free to join and leave. Most of the autoconfiguration algorithms proposed for ad hoc networks are independent of the routing protocols and therefore, generate a significant overhead. Using the genuine optimization of the underlying routing protocol can significantly reduce the autoconfiguration overhead. One of the MANET protocols which have been recently promoted to RFC is the OLSR routing protocol , on which this article focuses. This article aims at complementing the OLSR routing protocol specifications to handle autoconfiguration. The corner stone of this autoconfiguration protocol is an advanced duplicate address detection algorithm. Under well defined assumptions, we prove the correctness of the the proposed autoconfiguration protocol

Efficient and Dynamic Group Key Agreement in Ad hoc Networks

Confidentiality, integrity and authentication are more relevant issues in Ad hoc networks than in wired fixed networks. One way to address these issues is the use of symmetric key cryptography, relying on a secret key shared by all members of the network. But establishing and maintaining such a key (also called the session key) is a non-trivial problem. We show that Group Key Agreement (GKA) protocols are suitable for establishing and maintaining such a session key in these dynamic networks. We take an existing GKA protocol, which is robust to connectivity losses and discuss all the issues for good functioning of this protocol in Ad hoc networks. We give implementation details and network parameters, which significantly reduce the computational burden of using public key cryptography in such networks

Algorithmes d'autoconfiguration et de sécurité pour le protocole OLSR (protocole de routage pour les réseaux mobiles ad hoc)

Avec l arrivée de nouvelles applications tel que l Internet sans fil ; de nouveaux équipements sans fil a bas prix ont vu le jour. Cette technologie est devenue accessible au grand public, et peut être utilisée dans divers domaines d applications, comme l utilisation domestique par exemple (accès Internet sans fil, contrôle radio des équipements électroménager, ). Cependant, la configuration de ces équipements reste liée au domaine informatique. Il est donc indispensable de fournir des services d autoconfiguration, destinés à un public non initié aux tâches complexes de configuration au sein d un réseau IP. De plus, dans les réseaux mobiles ad hoc et sans infrastructure, les nœuds sont hautement dynamiques. De ce fait, il est très difficile de prévoir une administration centralisée ou d utiliser une configuration manuelle dans ce type de réseaux. D autre part, si les réseaux sans fils sont sans conteste bien plus flexibles que les réseaux filaires, ils présentent au niveau de la sécurité bien plus de problèmes. En effet, l utilisation du medium radio facilite énormément les attaques. Dans cette thèse plusieurs solutions développées auparavant sont passées en revue, cependant de nouvelles propositions sont introduites.Rapid advancements in wireless technology and the emergence of new wireless applications such as wireless Internet, have resulted In the vast proliferation of wireless communications networks which are growing in popularity due to the abundance of low-cost mobile devices, and the speed and convenience of their deployment. These networks can be used in many domains (domestic use, professional use, ), however their configuration remains a task for a network administrator. Hence, it is essential to provide autoconfiguration services destined for people who are not familiar with the complex task of network configuration within an IP-based network. Furthermore, in the case of mobile ad hoc networks (MANETs), nodes are highly dynamic and a central administration or configuration by the user is very difficult. On the other hand, securing communications is a relevant issue within an ad hoc network. In fact, the broadcast nature of wireless communication links makes them unique in their vulnerability to security attacks. This thesis addresses these two problems in ad hoc networks. Some of the existing solutions are reviewed while a number of new solutions are introduced.ORSAY-PARIS 11-BU Sciences (914712101) / SudocVILLEURBANNE-DOC'INSA LYON (692662301) / SudocSudocFranceF

A Lightweight Routing Protocol for aWireless Video Surveillance Platform: Implementation, Experiments and Perspectives

Recently, a new application of wireless sensor networks has emerged and it consists on Multimedia Surveillance Wireless Sensor Networks (MSWSNs). This application involves interconnected wireless video sensors capable of processing, sending, and receiving data. The first step in this work is to setup a eÿcient wireless video surveillance system to help elders who need assistance while they prefer still living in their houses. The objective is to early detect and transmit via Internet any abnormal behavior or domestic accident to assistance services. For this, small cameras embedded on wireless home deployed sensors have been considered. Moreover, a lightweight routing protocol for an optimized data transmission has been proposed. The whole system was implemented on an Arduino based platform on which a set of experiments were conducted. The second step in an ongoing work is to extend our experiments to a safety wireless video surveillance platform in an urban and public environments