Our goal in this research is to investigate and determine how to best support a challenging mobile wireless network based in a military operational environment. Since routing protocols used in mobile ad hoc networks (MANET) must adapt to frequent or continual changes of topology, while simultaneously limiting the impact of tracking these changes on wireless resources, we focused our initial research on improving the efficiency of route discovery. We proposed and designed a new MAC layer routing protocol that pursues reduced routing overhead, greater interaction of network protocol layers and passive neighbor/path discovery. This algorithm, called Virtual MAC Tag Switching (VMTS), evolved as we implemented a prototype in the ns-2 network simulator and conducted simulation analysis of existing protocols: DSDV, DSR and AODV. Upon analyzing the performance of existing routing protocols using pragmatic metrics not applied in any MANET literature it was found that current MANET models produce unsatisfactory performance. Subsequent analysis of transport layer protocol behaviors pinpointed the causes that undermine the performance of the existing protocols and would have thwarted VMTS as well.

Le présent rapport fournit plusieurs extensions des protocoles de réseau ad hoc et leurs évaluations, qui permettent d'augmenter la performance, de dimensionner la taille des réseaux et d'intégrer les réseaux ad hoc dans l'Internet : Premièrement, ce rapport présente plusieurs outils de logiciel qui permettent d'étudier des protocoles de routage sans modifications, implémentés en Java, dans le simulator de réseaux NS2. Deuxièmement, ce rapport fournit une discussion architecturale des réseaux ad hoc, qui explique les problèmes de la configuration automatique des adresses IP (nommé autoconfiguration) des routeurs ad hoc. Ensuite, le rapport présente un modèle architectural pour des réseaux ad hoc qui est compatible avec l'Internet. Un protocole d'autoconfiguration, basé sur le modèle architectural proposé, est spécifié, et ses propriétés sont formellement vérifiées au moyen de Model Checking. Troisièmement, plusieurs extensions du protocole de routage des réseaux ad hoc OLSRv2 sont présentées : La performance du protocole est augmentée d'ordre de grandeur en utilisant un algorithme dynamique pour calculer les plus courts chemins. Une autre optimisation proposée est un framework basé sur SNMP pour gérer et contrôler des objets liés à la performance sur des routeurs tournant OLSRv2. Une extension d'OLSRv2 est présentée dans laquelle des paquets sont retransmis ultérieurement lorsque les destinations sont indisponibles temporairement, au lieu de les rejeter. Cette extension mène à un taux de remis considérablement plus élevé que OLSRv2 par défaut dans certains scenarios. Ce rapport présente alors une analyse des menaces de sécurité pour OLSRv2, suivie par la spécification d'un mécanisme de contrôle d'accès pour OLSRv2, qui empêche nombre de ces attaques. Quatrièmement, ce rapport explore le dimensionnement des réseaux de capteurs sans fil, et évalue un protocole de routage des réseaux de capteurs, nommé RPL, spécifié par l'IETF en 2011. En outre, étant donné que RPL ne contient pas de mécanisme de broadcast efficace, plusieurs mécanismes de broadcast optimisés dans RPL sont présentés et comparés.

A wireless ad hoc network consists of a number of mobile nodes that temporarily form a dynamic infrastructure-less network. New routing protocols that can adapt to the frequent topology changes induced by node mobility and varying link qualities are needed. During the last decade dozens of different ad hoc routing protocols have been proposed, optimized and partially compared, mainly through simulation studies. This thesis takes an experimental approach to the evaluation of ad hoc routing protocols. We argue that real world experiments are needed in order to complement simulation studies, and to gain practical experience and insights that can provide feedback to routing protocol design and existing simulation models. For example, we discovered a performance discrepancy for the AODV protocol between real world experiments and corresponding simulation studies. This so called ``communication gray zone'' problem was explored and countermeasures were implemented. As a result we could eliminate this performance problem to a large extent. We have implemented a software-based testbed called APE to carry out efficient and systematic experimental evaluation of ad hoc routing protocols. Experiments with up to 37 participating ad hoc nodes have demonstrated APE's ability to scale efficiently and assess repeatability between test runs. APE is part of our methodology for test repeatability in a real world ad hoc routing protocol testbed. It addresses the repeatability issue induced by stochastic factors like the radio environment and node mobility. Using APE, we have performed a systematic experimental evaluation of three ad hoc routing protocols (AODV, OLSR and LUNAR). Our results show that TCP does not work satisfactorily even in very small networks with limited mobility.

Wireless communication has seen a tremendous growth in the last decades. Continuing on this trend, wireless multi-hop networks  are nowadays used or planned for use in a multitude of contexts, spanning from Internet access at home to emergency situations. The Transmission Control Protocol (TCP) provides reliable and ordered delivery of a data and is used by major Internet applications such as web browsers, email clients and file transfer programs. TCP traffic is also the dominating traffic type on the Internet. However, TCP performs less than optimal in wireless multi-hop networks due to packet reordering, low link capacity, packet loss and variable delay. In this thesis, we develop novel proposals for enhancing the network and transport layer to improve TCP performance in wireless multi-hop networks. As initial studies, we experimentally evaluate the performance of different TCP variants, with and without mobile nodes. We further evaluate the impact of multi-path routing on TCP performance and propose packet aggregation combined with aggregation aware multi-path forwarding as a means to better utilize the available bandwidth. The last contribution is a novel extension to multi-path TCP to  enable single-homed hosts to fully utilize the network capacity. / <p>Opponent changed. Prof. C. Lindeman from the University of Leipzig was substituted by Prof. Zhang.</p>

Ce manuscrit étudie la coexistence de réseaux fixes et de réseaux spontanés dans le coeur d'Internet. Plus particulièrement, on étudie le problème du routage dans un certain type de système autonome (AS) appelé AS hybrides, qui contiennent à la fois des réseaux ad hoc sans fil et des réseaux filaires. L'approche proposée dans ce manuscrit est d'adapter des protocoles actuellement utilisés dans les AS au coeur d'Internet, typiquement basés sur l'algorithme à état des liens, pour leur permettre d'opérer dans les réseaux ad hoc (MANETs) comme dans les réseaux filaires. Le manuscrit analyse donc l'utilisation du routage à état de liens dans les réseaux ad hoc. Différentes techniques sont ensuite proposées et évaluées théoriquement, dans le but d'optimiser la performance des protocoles à état de liens dans les AS hybrides. Le manuscrit étudie alors l'impact de ces techniques lorsqu'elles sont appliquées à OSPF, l'un des principaux protocoles actuellement utilisés dans les AS. Les performances d'OSPF dans les MANETs utilisant les différentes techniques étudiées sont ensuite analysées au moyen de simulations. Pour finir, le fonctionnement du protocole OSPF utilisant certaines des techniques étudiées est évalué au moyen d'expériences sur un réseau test réel.

Ces deux dernières décennies les systèmes P2P de partage de fichiers sont devenus très populaires grâce aux accès à des ressources diverses, distribuées sur Internet. Parallèlement à l'évolution de cette catégorie de systèmes, les dispositifs mobiles (téléphones cellulaires, PDA et autres appareils portatifs) ont eu un grand succès sur le marché. Équipés d'une technologie de communication sans fil (Bluetooth, et Wifi), ils peuvent communiquer sans nécessiter une infrastructure particulière en utilisant un réseau mobile adhoc (Mobile Adhoc NETwork -MANET). De la même manière, les systèmes P2P peuvent être aussi déployés sur ce type de réseau et deviennent des systèmes P2P mobiles (Mobile 2P systems). Dans le cadre de cette thèse, nous nous intéressons essentiellement à la recherche d'information dans les systèmes P2P et plus précisément au problème de routage de requêtes. La première partie de la thèse, s'est focalisée sur le routage de requêtes dans les systèmes P2P sur Internet. Nous avons proposé (i) un modèle de routage sémantique basé sur l'historique des requêtes. Ce modèle est ensuite instancié pour définir une nouvelle méthode de routage par apprentissage. Pour pallier le problème de démarrage à froid, (ii) nous avons proposé une méthode prédictive de l'intention de l'utilisateur qui construit une base de connaissances à priori pour chaque pair. Enfin, (iii) nous avons proposé une méthode de routage hybride pour traiter le problème d'échec de sélection. Cette méthode est basée sur l'historique des requêtes et le regroupement de pairs dans des groupes sémantiques. La deuxième partie de la thèse, s'est focalisée sur le routage de requêtes dans les systèmes P2P mobiles. L'apparition des MANETs, a soulevé de nouveaux challenges de routage. Ces réseaux souffrent de plusieurs contraintes liées aux supports de transmission ou bien aux dispositifs mobiles. Dans ce cadre, nous avons proposé une méthode de routage pour les systèmes P2P non structurés mobiles basée sur le contexte de l'utilisateur. D'un point de vue technique, toutes ces propositions ont été développées, validées et évaluées grâce aux simulateurs PeerSim et NS2

Currently there is ongoing research in the field of Mobile Ad-hoc Networks (MANET) for several different scenarios. Research has focused on topology related challenges such as routing mechanisms or addressing systems, as well as security issues like traceability of radio communication or encryption. In addition, there are very specific research interests such as the effects of directional antennas for MANETs or optimized transmission techniques for minimal power consumption or range optimization. Unmanned aerial vehicles (UAVs), and unmanned aerial systems (UAS) in general, need wireless systems in order to communicate. Current UAS are very flexible and allow for a wide spectrum of mission profiles by means of utilizing different UAVs, according to the requirements at hand. Each mission poses special needs and requirements on the internal and external UAS communication and special mission scenarios calling for UAV swarms increase the complexity and require specialized communication solutions. UAS have specific needs not provided by the general research, but are, on the other hand, to diversified to make much use of narrowly focused developments; UAS form a sufficiently large research area for application of MANETs to be considered as an independent group with specialized needs worthy of tailored implementations of MANET principles. MANET research has not tackled a general approach to UAS although some sources show specific applications involving UAVS. This work presents some new aspects for the development of of ad-hoc wireless networks for UAVs and UAS and focuses on their specialties and needs. A general framework for MANET development is proposed. Furthermore, the proposed specific evaluation scenarios provide for a UAS focused comparison of MANET performance.

A habilidade de prever onde nós podem estar em um futuro próximo, pode possibilitar novas aplicações em Redes Ad-Hoc Móveis (MANET). Por exemplo, o conteúdo pode ser gerado para um consumidor em potencial em cenários de computação pervasiva ou congestionamentos de tráfego podem ser previstos e prevenidos. Neste trabalho introduzimos dois algoritmos para previsão de posição futura de nós em uma rede móvel, PheroCast e ToD-Pherocast. O algoritmo de Previsão Baseada em Feromônios (PheroCast) é um algoritmo leve para realizar predições online da posição futura de um nó baseado em seu histórico de movimentação. PheroCast, no entanto, não leva em consideração variações no padrão de movimentação ao longo do dia, usando o histórico do passado da mesma forma. Por exemplo, em um cenário em que o mesmo nó viaja todos os dias de manhã, mas raramente à tarde, PheroCast dará o mesmo ou mais peso para o dado da manhã enquanto estiver prevendo a viagem à tarde, o que provavelmente levaria a uma previsão errada. Devido a tal limitação, desenvolvemos o Time of Day Pherocast, ou ToD-Pherocast, uma versão estendida do algoritmo original que leva em consideração o horário da viagem para gerar as predições, dando mais ênfase à história do movimento em horários similares. Finalmente, apresentamos uma avaliação de desempenho considerando três cenários: (i) previsão da posição de ônibus, cujo comportamento esperado é regular; (ii) previsão de posição de táxis, que aparentemente levaria a baixa taxa de acertos; e (iii) mobilidade de pessoas em relação redes sem fio, que usou rastros coletados pelo grupo de pesquisa do autor. Nossas avaliações mostram que o ToD-PheroCast é até 4.41% melhor que o PheroCast no cenário dos ônibus, em que alcançou acurácia de mais de 85%, e 0.72% melhor no cenário dos táxis, alcançando uma acurácia de até 89.17%. Finalmente, no cenários de previsão de redes sem fio, ToD-PheroCast atingiu 81.02% de acurácia. Esses resultados mostram não só que a previsão da posição é possível nos cenários, mas que pode ser realizada rápida e acuradamente. / The ability to predict where nodes might be in the near future may enable several new applications in a mobile ad hoc network (MANET). For example, content may be generated for an approaching potential consumer in pervasive computing scenarios or traffic jams may be predicted and prevented. We introduce PheroCast, a lightweight algorithm to do online predictions of a node’s future position based on its previous movement history. PheroCast, however, does not take into account the variations in the movement pattern along the day, using any previous history in the same way. For example, in a scenario where the same node travels every morning, but seldom in the evening, PheroCast would give the same or more weight to the data from the morning when predicting an evening trip, which would likely lead to a wrong prediction. Due to this limitation, we developed the Time of Day PheroCast, or ToD-PheroCast, an extended version of the original algorithm which takes the time of the day into account while making predictions, giving more emphasis to the history of movement within similar time windows. Finally, we evaluate the performance in three scenarios: (i) prediction of the position of buses in a metropolis, which are expected to have very regular mobility pattern; (ii) Taxis in a metropolis, which should lead to low accuracy predictions; and (iii) mobility of people interacting with wireless networks, that used traces collected by the author’s research group. Our evaluations show that ToD-PheroCast is up to 4.41% better than PheroCast in the bus scenario, in which it achieved over 85% accuracy in its predictions, and 0.72% better in the taxi scenario, in which the algorithm achieved up to 89.17% accuracy. Finally, in the wireless scenario, ToD-PheroCast achieved 81.02% accuracy. These results show that not only forecasting is possible in such scenarios, but that it may be done with high accuracy, online, and in a lightweight manner. / Dissertação (Mestrado)

In this thesis, we are concerned with content dissemination in mobile ad hoc networks. The scope of content dissemination is limited by network capacity, and sometimes the price to be paid for securing faster delivery. In the first part of the thesis, we address the issue of finding the maximum throughput that a mobile ad-hoc network can support. We have assumed that there is no price involved, and all nodes work as a team. The problem of determining the capacity region has long been known to be NP-hard even for stationary nodes. Mobility introduces an additional dimension of complexity because nodes now also have to decide when they should initiate route discovery. Since route discovery involves communication and computation overhead, it should not be invoked very often. On the other hand, mobility implies that routes are bound to become stale, resulting in sub-optimal performance if routes are not updated. We attempt to gain some understanding of these effects by considering a simple one-dimensional network model. The simplicity of our model allows us to use stochastic dynamic programming (SDP) to find the maximum possible network throughput with ideal routing and medium access control (MAC) scheduling. Using the optimal value as a benchmark, we also propose and evaluate the performance of a simple threshold-based heuristic. Unlike the optimal policy which requires considerable state information, the proposed heuristic is simple to implement and is not overly sensitive to the threshold value. We find empirical conditions for our heuristic to be near-optimal. Also, network scenarios when our heuristic does not perform very well are analyzed. We provide extensive numerical analysis and simulation results for different parameter settings of our model. Interestingly, we observe that in low density network the average throughput can first decrease with mobility, and then increase. This motivates us to study a mobile ad-hoc network when it is sparse and in a generalized environment, such as when movement of nodes is in a two-dimension plane. Due to sparseness, there are frequent disruptions in the connections and there may not be any end-to-end connection for delivery. The mobility of nodes may be used for carrying the forwarded message to the destination. This network is also known as a delay tolerant network. In the rest part of the thesis, we consider the relay nodes to be members of a group that charges a price for assisting in message transportation. First, we solve the problem of how to select first relay node when only one relay node can be chosen from a given number of groups. Next, we solve two problems, namely price-constrained delay minimization, and delay-constrained price optimization.

The increasing growth of mobile devices in the whole world, and the forecasts for the coming years has been indicated by several reports. Nonetheless, this need for ubiquitous collaboration has brought new possibilities and challenges to the scientific community. Mobile Ad hoc Networks (MANETs) emerges in this scenario allowing devices to interconnect autonomously, without the need of a fixed infrastructure, in order to provide communication and information services. Due to such decentralization and the natural constraints of mobile devices, it remains, to this day, a challenge to provide efficient routing for MANETs. In this dissertation we propose new routing enhancements based on policies for MANETs running the HTR protocol. We consider the role(s) a user associated to a device performs within an organization. Hence our policies can guide the routing based on these roles. With this scheme we improve communication according to different business needs and scenario requirements. To this end, we propose a set of policies that affects the routing behavior and present four case studies to present each policy. Then we analyze two policies in terms of end-to-end delay, and nodes’ lifetime. Through simulation we evaluate these metrics while varying parameters such as the amount of nodes participating in the network, the mobility characteristics, and the number of traffic sources. Our results show that it is possible to achieve these goals without causing great impact on the average end-to-end delay and energy consumption, two important metrics in any MANET evaluation. We explore the results in several scenarios and detail our findings, which can provide a different perspective for future MANET applications. / Submitted by João Arthur Martins (joao.arthur@ufpe.br) on 2015-03-10T18:42:15Z No. of bitstreams: 2 Dissertação Gabriela Coutinho.pdf: 1701782 bytes, checksum: 113328c2efdd1ba97f7a237d03cab574 (MD5) license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) / Made available in DSpace on 2015-03-11T17:46:06Z (GMT). No. of bitstreams: 2 Dissertação Gabriela Coutinho.pdf: 1701782 bytes, checksum: 113328c2efdd1ba97f7a237d03cab574 (MD5) license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) Previous issue date: 2013-09-13 / O crescimento das vendas de aparelhos móveis em todo o mundo, bem como as previsões para os próximos anos são apontadas em diversos relatórios. No entanto, essa necessidade de colaboração ubíqua trouxe novas possibilidades e desafios para a comunidade científica. Redes móveis ad hoc (Mobile Ad hoc Networks - MANETs) surgem diante deste cenário e permite que dispositivos se comuniquem de forma autônoma, sem a necessidade de uma infraestrutura predefinida para fornecer comunicação e serviços. Porém, essa descentralização junto com as restrições naturais dos dispositivos móveis, proporcionar roteamento eficiente para MANETs permanece um desafio. Este trabalho propõe novas melhorias para o roteamento em MANETs que utilizam o protocolo HTR. Também considera o papel que usuários associados aos dispositivos desempenham dentro de uma organização. Desta forma, as políticas desenvolvidas podem guiar o roteamento também com base nestes papéis. Com este esquema, é possível melhorar a comunicação de acordo com necessidades de negócio e requerimentos de cenário. Para este fim, esta dissertação propõe um conjunto de políticas que afetam o comportamento do roteamento e analisa os impactos em termos de atraso, energia gasta e tempo de vida dos nós. Através de simulações, essas métricas são avaliadas também com variação de parâmetros como a quantidade de nós que participam da simulação, as características de mobilidade e o número de fontes de tráfego. Resultados mostram que é possível atingir esses objetivos sem causar grande impacto negativo no atraso fim a fim e no consumo de energia, duas métricas importantes em avaliações de redes MANET. Nós exploramos esses resultados em diversos cenários e detalhamos nossas descobertas, que podem servir como uma perspectiva diferente para futuras aplicações de redes MANET.