MANETs: Internet Connectivity and Transport Protocols

A Mobile Ad hoc Network (MANET) is a collection of mobile nodes connected together over a wireless medium, which self-organize into an autonomous multi-hop wireless network. This kind of networks allows people and devices to seamlessly internetwork in areas with no pre-existing communication infrastructure, e.g., disaster recovery environments. Ad hoc networking is not a new concept, having been around in various forms for over 20 years. However, in the past only tactical networks followed the ad hoc networking paradigm. Recently, the introduction of new technologies such as IEEE 802.11, are moved the application field of MANETs to a more commercial field. These evolutions have been generating a renewed and growing interest in the research and development of MANETs. It is widely recognized that a prerequisite for the commercial penetration of the ad hoc networking technologies is the integration with existing wired/wireless infrastructure-based networks to provide an easy and transparent access to the Internet and its services. However, most of the existing solutions for enabling the interconnection between MANETs and the Internet are based on complex and inefficient mechanisms, as Mobile-IP and IP tunnelling. This thesis describes an alternative approach to build multi-hop and heterogeneous proactive ad hoc networks, which can be used as flexible and low-cost extensions of traditional wired LANs. The proposed architecture provides transparent global Internet connectivity and address autocofiguration capabilities to mobile nodes without requiring configuration changes in the pre-existing wired LAN, and relying on basic layer-2 functionalities. This thesis also includes an experimental evaluation of the proposed architecture and a comparison between this architecture with a well-known alternative NAT-based solution. The experimental outcomes confirm that the proposed technique ensures higher per-connection throughputs than the NAT-based solution. This thesis also examines the problems encountered by TCP over multi-hop ad hoc networks. Research on efficient transport protocols for ad hoc networks is one of the most active topics in the MANET community. Such a great interest is basically motivated by numerous observations showing that, in general, TCP is not able to efficiently deal with the unstable and very dynamic environment provided by multi-hop ad hoc networks. This is because some assumptions, in TCP design, are clearly inspired by the characteristics of wired networks dominant at the time when it was conceived. More specifically, TCP implicitly assumes that packet loss is almost always due to congestion phenomena causing buffer overflows at intermediate routers. Furthermore, it also assumes that nodes are static (i.e., they do not change their position over time). Unfortunately, these assumptions do not hold in MANETs, since in this kind of networks packet losses due to interference and link-layer contentions are largely predominant, and nodes may be mobile. The typical approach to solve these problems is patching TCP to fix its inefficiencies while preserving compatibility with the original protocol. This thesis explores a different approach. Specifically, this thesis presents a new transport protocol (TPA) designed from scratch, and address TCP interoperability at a late design stage. In this way, TPA can include all desired features in a neat and coherent way. This thesis also includes an experimental, as well as, a simulative evaluation of TPA, and a comparison between TCP and TPA performance (in terms of throughput, number of unnecessary transmissions and fairness). The presented analysis considers several of possible configurations of the protocols parameters, different routing protocols, and various networking scenarios. In all the cases taken into consideration TPA significantly outperforms TCP

Protocole de routage à chemins multiples pour des réseaux ad hoc

Ad hoc networks consist of a collection of wireless mobile nodes which dynamically exchange data without reliance on any fixed based station or a wired backbone network. They are by definition self-organized. The frequent topological changes make multi-hops routing a crucial issue for these networks. In this PhD thesis, we propose a multipath routing protocol named Multipath Optimized Link State Routing (MP-OLSR). It is a multipath extension of OLSR, and can be regarded as a hybrid routing scheme because it combines the proactive nature of topology sensing and reactive nature of multipath computation. The auxiliary functions as route recovery and loop detection are introduced to improve the performance of the network. The usage of queue length metric for link quality criteria is studied and the compatibility between single path and multipath routing is discussed to facilitate the deployment of the protocol. The simulations based on NS2 and Qualnet softwares are performed in different scenarios. A testbed is also set up in the campus of Polytech’Nantes. The results from the simulator and testbed reveal that MP-OLSR is particularly suitable for mobile, large and dense networks with heavy network load thanks to its ability to distribute the traffic into different paths and effective auxiliary functions. The H.264/SVC video service is applied to ad hoc networks with MP-OLSR. By exploiting the scalable characteristic of H.264/SVC, we propose to use Priority Forward Error Correction coding based on Finite Radon Transform (FRT) to improve the received video quality. An evaluation framework called SVCEval is built to simulate the SVC video transmission over different kinds of networks in Qualnet. This second study highlights the interest of multiple path routing to improve quality of experience over self-organized networks.Les réseaux ad hoc sont constitués d’un ensemble de nœuds mobiles qui échangent des données sans infrastructure de type point d’accès ou artère filaire. Ils sont par définition auto-organisés. Les changements fréquents de topologie des réseaux ad hoc rendent le routage multi-sauts très problématique. Dans cette thèse, nous proposons un protocole de routage à chemins multiples appelé Multipath Optimized Link State Routing (MP-OLSR). C’est une extension d’OLSR à chemins multiples qui peut être considérée comme une méthode de routage hybride. En effet, MP-OLSR combine la caractéristique proactive de la détection de topologie et la caractéristique réactive du calcul de chemins multiples qui est effectué à la demande. Les fonctions auxiliaires comme la récupération de routes ou la détection de boucles sont introduites pour améliorer la performance du réseau. L’utilisation de la longueur des files d’attente des nœuds intermédiaires comme critère de qualité de lien est étudiée et la compatibilité entre routage à chemins multiples et chemin unique est discutée pour faciliter le déploiement du protocole. Les simulations basées sur les logiciels NS2 et Qualnet sont effectuées pour tester le routage MP-OLSR dans des scénarios variés. Une mise en œuvre a également été réalisée au cours de cette thèse avec une expérimentation sur le campus de Polytech’Nantes. Les résultats de la simulation et de l’expérimentation révèlent que MP-OLSR est particulièrement adapté pour les réseaux mobiles et denses avec des trafics élevés grâce à sa capacité à distribuer le trafic dans des chemins différents et à des fonctions auxiliaires efficaces. Au niveau application, le service vidéo H.264/SVC est appliqué à des réseaux ad hoc MP-OLSR. En exploitant la hiérarchie naturelle délivrée par le format H.264/SVC, nous proposons d’utiliser un codage à protection inégale (PFEC) basé sur la Transformation de Radon Finie (FRT) pour améliorer la qualité de la vidéo à la réception. Un outil appelé SVCEval est développé pour simuler la transmission de vidéo SVC sur différents types de réseaux dans le logiciel Qualnet. Cette deuxième étude témoigne de l’intérêt du codage à protection inégale dans un routage à chemins multiples pour améliorer une qualité d’usage sur des réseaux auto-organisés

A Comparison Study on the Performance of Different Applications using MANET Routing Protocols under Various Circumstances

Mobile adhoc network is a collection of mobile devices that communicate amongst each other using message passing to collaborate in a wireless medium, without any centralized management; each device acts as a router, sends and receive packets. Nodes can move freely and can set itself in any adhoc network. Adhoc networks are widely use in the absence of the wired network infrastructure. Quality of service of routing in ad hoc networks is an important and complicated issue with a changing topology. In this work we carried out a comparison study in a simulation scenarios on the performance of different routing protocols i.e., proactive and reactive, with different standard applications such as FTP, HTTP and database under various circumstances by means of network size, load, and speed of nodes. As a conclusion of this study, results show when measuring performance of delay and throughput of FTP, HTTP and Database traffic, delay and throughput metrics, using AODV, DSR, OLSR routing protocols, under 10, 50 and 100 nodes with spee of 10, 30 m/s. When using DSR routing protocol it showed the worst results under various network size and speed between other protocols, while when using AODV routing protocol it performed in a better way in which it showed a good performance in small and medium network size. OLSR routing protocol performed the best to be used in all network size especially in large network size.مانيت هي عبار ة عن مجموعة من االجهز ة تحتوي عمى أجهز ة السمكية، تتعاون مع بعضها البعض الرسال، استقبال و نقل المعمومات من خالل وسط السمكي، هوائي، من دون اي تحكم مركزي، كل جهاز يمكن اعتبار ة كجهاز راوتر يعتمد عمى نفسة بحيث يستقبل و يرسل المعمومات و هذة المجموعة تسمى بالمانيت. أي جهاز بهذة المجموعة يمكنة التحرك بحرية و يمكنة االنضمام الي مجموعة مانيت بالوقت الذي يريدة و بالمكان الذي يريدة. تستخدم المانيت باألمكان الذي اليوجد فيها بنية تحتية ثابتة، باألمكان التي يحصل فيها كوارث طبيعية و األمكان الذي يصعب فيها وجود اتصال بالوقت الذي يكون هو ضروري لوجود شبكة بين الجهز ة. تستخدم هذة األجهزة بروتوكالت لنقل المعمومات مثل DSR AODV و غيرها من البروتوكالت، حيث ان المانيت شبكة سريعة التغيير فان جودة هذة البروتوكالت هو أمر مهم. في هذة الرسالة قمنا بدراسة التطبيقات،database HTTP FTP ، لشبكة المانيت باستخدام البروتوكالت AODV ، DSR ، OLSR كال عمى حدى، تحت متغيرات و ظروف معينة لمعرفة اي بروتوكل هو االنسب الستخدامة مع اي تطبيق تحت هذة الظروف. و كنتيجة لهذة الدراسة، عند قياس أداء FTP ،Database، HTTP مقاييس اإلنتاجية، وذلك باستخدام AODV ،DSR ،OLSR بروتوكوالت التوجية ، تحت 01،01 و 011 عقدة وتصل سرعتها من 01 ، 01 م / ث.تبين انة عند استخدام بروتوكول توجية DSR أظهرت أسوأ نتائج في جميع اإلطار ت من حيت حجم الشبكة والسرعة بين البروتوكوالت األخرى، بينما عند استخدام بروتوكول التوجية AODV تنفذ ذلك بطريقة أفضل بحيت أظهرت أداء جيدا في حجم الشبكة الصغير والمتوسطة. اما بنسبة لبروتوكول التوجية OLSR اظهر أداء أفضل الستخدامها في جميع احجام الشبكة وخصوصا في حجم شبكة الواسع

Routing in multi-hop Ad Hoc networks: an Experimental Approach

In this thesis we investigate the efficiency of routing protocols for Mobile Ad Hoc networks (MANETs) by adopting an experimental approach. MANET routing protocols have been mainly evaluated through simulations which often introduce simplifying assumptions (e.g., radio propagation model) and mask important real characteristics. To avoid these modeling approximations, it is necessary to complement simulation with experiments on real MANETs. This work provides a contribution in this direction reporting our experiences learned by these real measurements. By setting up MANET prototypes, firstly we investigate IEEE 802.11 behavior in single­hop MANETs, secondly we focus on an innovative analysis of routing protocols in multi­hop MANETs by varying scenarios. To the best of our knowledge, our medium­scale scenario composed of 23 nodes represents one of the largest MANET testbed. Our experimental results highlight that, in contrast with MANET community, by using proactive routing protocols the overall system gains in scalability, performance and efficiency. These results encourage us identifying in this last class Hazy Sighted Link State (HSLS) as a more suitable protocol. A further contribution of this thesis is hence to design, develop and test an enhanced version of HSLS, strengthened with a mechanism to guarantee the reliability of LSU packets without additional control overhead, and a module to support middleware-network interactions as proposed by the MobileMAN project (EUIST-FP5-FET-Open-IST-2001-38113)

Simulation and experimental testbed for adaptive video streaming in ad hoc networks

[EN] This paper presents a performance evaluation of the scalable video streaming over mobile ad hoc networks. In particular, we focus on the rate-adaptive method for streaming scalable video (H.264/SVC). For effective adaptation a new cross-layer routing protocol is introduced. This protocol provides an efficient algorithm for available bandwidth estimation. With this information, the video source adjusts its bit rate during the video transmission according to the network state. We also propose a free simulation framework that supports evaluation studies for scalable video streaming. The simulation experiments performed in this study involve the transmission of SVC streams with Medium Grain Scalability (MGS) as well as temporal scalability over different network scenarios. The results reveal that the rate-adaptive strategy helps avoid or reduce the congestion in MANETs obtaining a better quality in the received videos. Additionally, an actual ad hoc network was implemented using embedded devices (Raspberry Pi) in order to assess the performance of the proposed adaptive transmission mechanism in a real environment. Additional experiments were carried out prior to the implementation with the aim of characterizing the wireless medium and packet loss profile. Finally, the proposed approach shows an important reduction in energy consumption, as the study revealed.This paper was performed with the support of the National Secretary of Higher Education, Science, Technology and Innovation (SENESCYT)–Ecuador Government (scholarship 195-2012) and the Multimedia Communications Group (COMM) belong to the Institute of Telecommunications and Multimedia Applications (iTEAM)-Universitat Politècnica de València.Gonzalez-Martinez, SR.; Castellanos Hernández, WE.; Guzmán Castillo, PF.; Arce Vila, P.; Guerri Cebollada, JC. (2016). Simulation and experimental testbed for adaptive video streaming in ad hoc networks. Ad Hoc Networks. 52:89-105. https://doi.org/10.1016/j.adhoc.2016.07.007S891055

Cooperation in open, decentralized, and heterogeneous computer networks

Community Networks (CN) are naturally open and decentralized structures, that grow organically with the addition of heterogeneous network devices, contributed and configured as needed by their participants. The continuous growth in popularity and dissemination of CNs in recent years has raised the perception of a mature and sustainable model for the provisioning of networking services. However, because such infrastructures include uncontrolled entities with non delimited responsibilities, every single network entity does indeed represent a potential single-point of failure that can stop the entire network from working, and that no other entity can prevent or even circumvent. Given the open and decentralized nature of CNs, that brings together individuals and organizations with different and even conflicting economic, political, and technical interests, the achievement of no more than basic consensus on the correctness of all network nodes is challenging. In such environment, the lack of self-determination for CN participants in terms of control and security of routing can be regarded as an obstacle for growth or even as a risk of collapse. To address this problem we first consider deployments of existing Wireless CN and we analyze their technology, characteristics, and performance. We perform an experimental evaluation of a production 802.11an Wireless CN, and compare to studies of other Wireless CN deployments in the literature. We compare experimentally obtained throughput traces with path-capacity calculations based on well-known conflict graph models. We observe that in the majority of cases the path chosen by the employed BMX6 routing protocol corresponds with the best identified path in our model. We analyze monitoring and interaction shortcomings of CNs and address these with Network Characterization Tool (NCT), a novel tool that allows users to assess network state and performance, and improve their quality of experience by individually modifying the routing parameters of their devices. We also evaluate performance outcomes when different routing policies are in use. Routing protocols provide self-management mechanisms that allow the continuous operation of a Community Mesh Network (CMN). We focus on three widely used proactive mesh routing protocols and their implementations: BMX6, OLSR, and Babel. We describe the core idea behind these protocols and study the implications of these in terms of scalability, performance, and stability by exposing them to typical but challenging network topologies and scenarios. Our results show the relative merits, costs, and limitations of the three protocols. Built upon the studied characteristics of typical CN deployments, their requirements on open and decentralized cooperation, and the potential controversy on the trustiness of particular components of a network infrastructure, we propose and evaluate SEMTOR, a novel routing-protocol that can satisfy these demands. SEMTOR allows the verifiable and undeniable definition and distributed application of individually trusted topologies for routing traffic towards each node. One unique advantage of SEMTOR is that it does not require a global consensus on the trustiness of any node and thus preserves cooperation among nodes with even oppositional defined trust specification. This gives each node admin the freedom to individually define the subset, and the resulting sub-topology, from the whole set of participating nodes that he considers sufficiently trustworthy to meet their security, data-delivery objectives and concerns. The proposed mechanisms have been realized as a usable and open-source implementation called BMX7, as successor of BMX6. We have evaluated its scalability, contributed robustness, and security. These results show that the usage of SEMTOR for securing trusted routing topologies is feasible, even when executed on real and very cheap (10 Euro, Linux SoC) routers as commonly used in Community Mesh Networks.Las Redes Comunitarias (CNs) son estructuras de naturaleza abierta y descentralizada, que crecen orgánicamente con la adición de dispositivos de red heterogéneos que aportan y configuran sus participantes según sea necesario. Sin embargo, debido a que estas infraestructuras incluyen entidades con responsabilidades poco delimitadas, cada entidad puede representar un punto de fallo que puede impedir que la red funcione y que ninguna otra entidad pueda prevenir o eludir. Dada la naturaleza abierta y descentralizada de las CNs, que agrupa individuos y organizaciones con diferentes e incluso contrapuestos intereses económicos, políticos y técnicos, conseguir poco más que un consenso básico sobre los nodos correctos en la red puede ser un reto. En este entorno, la falta de autodeterminación para los participantes de una CN en cuanto a control y seguridad del encaminamiento puede considerarse un obstáculo para el crecimiento o incluso un riesgo de colapso. Para abordar este problema consideramos las implementaciones de redes comunitarias inalámbricas (WCN) y se analiza su tecnología, características y desempeño. Realizamos una evaluación experimental de una WCN establecida y se compara con estudios de otros despliegues. Comparamos las trazas de rendimiento experimentales con cálculos de la capacidad de los caminos basados en modelos bien conocidos del grafo. Se observa que en la mayoría de los casos el camino elegido por el protocolo de encaminamiento BMX6 corresponde con el mejor camino identificado en nuestro modelo. Analizamos las limitaciones de monitorización e interacción en CNs y los tratamos con NCT, una nueva herramienta que permite evaluar el estado y rendimiento de la red, y mejorar la calidad de experiencia modificando los parámetros de sus dispositivos individuales. También evaluamos el rendimiento resultante para diferentes políticas de encaminamiento. Los protocolos de encaminamiento proporcionan mecanismos de autogestión que hacen posible el funcionamiento continuo de una red comunitaria mesh (CMN). Nos centramos en tres protocolos de encaminamiento proactivos para redes mesh ampliamente utilizados y sus implementaciones: BMX6, OLSR y Babel. Se describe la idea central de estos protocolos y se estudian la implicaciones de éstos en términos de escalabilidad, rendimiento y estabilidad al exponerlos a topologías y escenarios de red típicos pero exigentes. Nuestros resultados muestran los méritos, costes y limitaciones de los tres protocolos. A partir de las características analizadas en despliegues típicos de redes comunitarias, y de las necesidades en cuanto a cooperación abierta y descentralizada, y la esperable divergencia sobre la confiabilidad en ciertos componentes de la infraestructura de red, proponemos y evaluamos SEMTOR, un nuevo protocolo de encaminamiento que puede satisfacer estas necesidades. SEMTOR permite definir de forma verificable e innegable, así como aplicar de forma distribuida, topologías de confianza individualizadas para encaminar tráfico hacia cada nodo. Una ventaja única de SEMTOR es que no precisa de consenso global sobre la confianza en cualquier nodo y por tanto preserva la cooperación entre los nodos, incluso con especificaciones de confianza definidas por oposición. Esto proporciona a cada administrador de nodo la libertad para definir el subconjunto, y la sub-topología resultante, entre el conjunto de todos los nodos participantes que considere dignos de suficiente confianza para cumplir con su objetivo y criterio de seguridad y entrega de datos. Los mecanismos propuestos se han realizado en forma de una implementación utilizable de código abierto llamada BMX7. Se ha evaluado su escalabilidad, robustez y seguridad. Estos resultados demuestran que el uso de SEMTOR para asegurar topologías de encaminamiento de confianza es factible, incluso cuando se ejecuta en routers reales y muy baratos utilizados de forma habitual en WCN.Postprint (published version

Adoption of vehicular ad hoc networking protocols by networked robots

This paper focuses on the utilization of wireless networking in the robotics domain. Many researchers have already equipped their robots with wireless communication capabilities, stimulated by the observation that multi-robot systems tend to have several advantages over their single-robot counterparts. Typically, this integration of wireless communication is tackled in a quite pragmatic manner, only a few authors presented novel Robotic Ad Hoc Network (RANET) protocols that were designed specifically with robotic use cases in mind. This is in sharp contrast with the domain of vehicular ad hoc networks (VANET). This observation is the starting point of this paper. If the results of previous efforts focusing on VANET protocols could be reused in the RANET domain, this could lead to rapid progress in the field of networked robots. To investigate this possibility, this paper provides a thorough overview of the related work in the domain of robotic and vehicular ad hoc networks. Based on this information, an exhaustive list of requirements is defined for both types. It is concluded that the most significant difference lies in the fact that VANET protocols are oriented towards low throughput messaging, while RANET protocols have to support high throughput media streaming as well. Although not always with equal importance, all other defined requirements are valid for both protocols. This leads to the conclusion that cross-fertilization between them is an appealing approach for future RANET research. To support such developments, this paper concludes with the definition of an appropriate working plan