First responders are continuously moving at an incident site and this movement requires them to access Service-Oriented Architecture services, such as a Web Map Service, via mobile wireless networks. First responders from inside a building often have problems in communicating to devices outside that building due to propagation obstacles. Dynamic user geometry and the propagation conditions of communicating from inside buildings to transceivers on the outside are difficult to model reliably in network planning software. Thus, leading commercial network simulation software and open source network simulator software do not model wireless links between transceivers inside and outside of buildings; new modeling software is needed. The discrete simulation runs in this investigation were built on events in a scenario that is typical of first-responder activities at an incident site. This scenario defined the geometry and node characteristics that were used in a mobile wireless network simulation to calculate expected connectivity based on propagation modeling, transceiver characteristics, and the environment. The author implemented in software a propagation model from the United States National Institute of Standards and Technology (NIST) to simulate radio wave propagation path loss during the scenario. Modifications to the NIST model propagation path loss method were generated to improve consistency in results calculated with the same node separation distances and radio wave obstacle environments. The final set of modifications made the NIST model more generalized by using more building material characteristics than the original version. The modifications in this study to the path loss model from NIST engineers were grounded on ad hoc network connectivity data collected at the operational scenario site. After changes in the NIST model were validated, 1,265 operational simulation runs were conducted with different numbers of deployed nodes in an operational incident-response scenario. Data were reduced and analyzed to compare measures of mobile ad hoc network effectiveness. Findings in this investigation resulted in two specific contributions to the body of knowledge in mobile wireless network design. First, data analysis indicated that specific changes to a recent path loss model from NIST produced results that were more generalized than the original model with respect to accommodating different building materials and enhancing the consistency of simulation results. Second, the results from the modified path loss model revealed an operational impact in using relay nodes to support public safety. Specifically, placing relay nodes at the entrance to a building and on odd-numbered floors improved connectivity in terms of first responders' accessing Web Services via mobile network devices, when moving through a building in an incident scenario.

Le nombre de terminaux mobiles communicants a fortement progressé ces dernières années. Cette évolution s'est accompagnée de l'intégration de technologies comme WiFi ou Bluetooth dans de multiples appareils (téléphones mobiles, PDA, ...). La connectivité supportée offre la possibilité de constituer des réseaux de façon spontanée, réseaux que l'on appelle réseaux mobiles ad hoc. Dans le cadre de la numérisation du champ de bataille, les militaires en opération sur le terrain seront à court terme équipés de terminaux mobiles communicants. L'objectif de cette thèse, financée par la DGA, est d'apporter des guides méthodologiques et des applications de référence pour aider à la conception de nouveaux services pour ces réseaux mobiles ad hoc en exploitant les spécificités du contexte militaire. Les contributions présentées s'appuient sur deux thèmes qui sont la collecte d'informations sur un champ d'opération et l'édition collaborative d'un document. / Abstract

With the rapid development in the areas of mobile manufacturing and multimedia communications, there is an increasing demand for Networked Virtual Environment (NVE) applications, such as Augmented Reality (AR), virtual walk-throughs, and massively multiplayer online games (MMOGs), on hand-held devices. Unfortunately, downloading and rendering a complex 3D scene is very computationally intensive and is not compatible with current mobile hardware specifications nor with available wireless bandwidth. Existing NVE applications deploy client/server based 3D streaming over thin mobile devices, which suffer from single point of failure, latency, and scalability issues. To address these issues, image-based rendering (IBR) and cloud-based 3D streaming have been introduced. The former introduces visual artifacts that reduce, and usually cancel, the realistic behaviors of the Virtual Environment (VE) application, while the latter is considered very expensive to implement. Peer-to-peer (P2P) 3D streaming is promising and affordable, but it has to tackle issues in object discovery and selection as well as content provider strategies. Distributing VE content over a mobile ad-hoc network (MANET) makes the system difficult to update due to the dynamic nature of the mobile clients. In order to tackle these issues, we came up with a novel protocol that combines the pros of both central and distributed approaches. Our proposed hybrid protocol, called OCTET, enables 3D scene streaming over thin devices in a way that can cope with current mobile hardware capabilities and mitigate the challenges of client/server and P2P 3D streaming. In fact, OCTET provides strategies that select, prioritize, and deliver only those objects that contribute to the user’s visible scene. OCTET is implemented using the "ns-2" simulation environment, and extensive experiments have clearly demonstrated significant achievements in mobile resource utilization, throughput, and system scalability.

1. CONTEXTO1.1. MANETMANET (Mobile and Ad hoc NETworks) (Redes móviles sin cables) son redes formadas por nodos móviles. Se comunican sin cables i lo hacen de manera 'ad hoc'. En este tipo de redes, los protocolos de enrutamiento tienen que ser diferentes de los utilizados en redes fijas.Hoy en día, existen protocolos de enrutamiento capaces de operar en este tipo de redes. No obstante, son completamente inseguras y confían en que los nodos no actuarán de manera malintencionada. En una red donde no se puede contar con la presencia de servidores centrales, se necesita que los nodos puedan comunicarse sin el riesgo de que otros nodos se hagan pasar por aquellos con quien quieren comunicarse. En una red donde todo el mundo es anónimo conceptos como identidad y confianza deben ser redefinidos.1.2. AODVAd Hoc On-Demand Vector Routing (AODV) es un protocolo de enrutamiento reactivo para redes MANET. Esto significa que AODV no hace nada hasta que un nodo necesita transmitir un paquete a otro nodo para el cual no tiene ruta. AODV sólo mantiene rutas entre nodos que necesitan comunicarse. Sus mensajes no contienen información de toda la ruta, solo contienen información sobre el origen i el destino. Por lo tanto los mensajes de AODV tienen tamaño constante independientemente del numero de nodos de la ruta. Utiliza números de secuencia para especificar lo reciente que es una ruta (en relación con otra), lo cual garantiza ausencia de 'loops' (bucles).En AODV, un nodo realiza un descubrimiento de ruta haciendo un 'flooding' de la red con un mensaje llamado 'Route Request' (RREQ). Una vez llega a un nodo que conoce la ruta pedida responde con un 'Route Reply' (RREP) que viaja de vuelta al originador del RREQ. Después de esto, todos los nodos de la ruta descubierta conocen las rutas hacia los dos extremos de la ruta.2. CONTRIBUTIONS2.1. SAODVSAODV (Secure Ad hoc On-Demand Distance Vector) es una extensión de AODV que protege el mecanismo de descubrimiento de ruta. Proporciona funcionalidades de seguridad como ahora integridad i autenticación.Se utilizan firmas digitales para autenticar los campos de los mensajes que no son modificados en ruta y cadenas de hash para proteger el 'hop count' (que es el único campo que se modifica en ruta).2.2. SAKMSAKM (Simple Ad hoc Key Management) proporciona un sistema de gestión de llaves que hace posible para cada nodo obtener las llaves públicas de los otros nodos de la red. Además, permite que cada nodo pueda verificar la relación entre la identidad de un nodo y la llave pública de otro.Esto se consigue a través del uso de direcciones estadísticamente únicas y criptográficamente verificables.2.2.1. Verificación pospuestaEl método 'verificación pospuesta' permite tener rutas pendientes de verificación. Estas serán verificadas cuando el procesador disponga de tiempo para ello y (en cualquier caso) antes de que esas rutas deban ser utilizadas para transmitir paquetes.2.3. Detección de atajosCuando un protocolo de enrutamiento para redes MANET realiza un descubrimiento de ruta, no descubre la ruta más corta sino la ruta a través de la cual el mensaje de petición de ruta viajó más rápidamente. Además, debido a que los nodos son móviles, la ruta que era la más corta en el momento del descubrimiento puede dejar de ser-lo en breve. Esto causa un retraso de transmisión mucho mayor de lo necesario y provoca muchas más colisiones de paquetes.Para evitar esto, los nodos podrían realizar descubrimientos de atajos periódicos para las rutas que están siendo utilizadas. Este mismo mecanismo puede ser utilizado para 'recuperar' rutas que se han roto. / 1. BACKGROUND1.1. MANETMANET (Mobile and Ad hoc NETworks) are networks formed by nodes that are mobile. They use wireless communication to speak among them and they do it in an ad hoc manner. In this kind of networks, routing protocols have to be different than from the ones used for fixed networks. In addition, nodes use the air to communicate, so a lot of nodes might hear what a node transmits and there are messages that are lost due to collisions.Nowadays, routing in such scenario has been achieved. Nevertheless, if it has to be broadly used, it is necessary to be able to do it in a secure way. In a network where the existance of central servers cannot be expected, it is needed that nodes will be able to communicate without the risk of malicious nodes impersonating the entities they want to communicate with. In a network where everybody is anonymous, identity and trust need to be redefined.1.2. AODVAd Hoc On-Demand Vector Routing (AODV) protocol is a reactive routing protocol for ad hoc and mobile networks. That means that AODV does nothing until a node needs to transmit a packet to a node for which it does not know a route. In addition, it only maintains routes between nodes which need to communicate. Its routing messages do not contain information about the whole route path, but only about the source and the destination. Therefore, routing messages have a constant size, independently of the number of hops of the route. It uses destination sequence numbers to specify how fresh a route is (in relation to another), which is used to grant loop freedom.In AODV, a node does route discovery by flooding the network with a 'Route Request' message (RREQ). Once it reaches a node that knows the requested route, it replies with a 'Route Reply' message (RREP) that travels back to the originator of the RREQ. After this, all the nodes of the discovered path have routes to both ends of the path. 2. CONTRIBUTIONS2.1. SAODVThe Secure Ad hoc On-Demand Distance Vector (SAODV) is an extension of the AODV routing protocol that can be used to protect the route discovery mechanism providing security features like integrity and authentication.Two mechanisms are used to secure the AODV messages: digital signatures to authenticate the non-mutable fields of the messages, and hash chains to secure the hop count information (the only mutable information in the messages).The information relative to the hash chains and the signatures is transmitted with the AODV message as an extension message.2.2. SAKMSimple Ad hoc Key Management (SAKM) provides a key management system that makes it possible for each ad hoc node to obtain public keys from the other nodes of the network. Further, each ad hoc node is capable of securely verifying the association between the identity of a given ad hoc node and the public key of that node.This is achieved by using statistically unique and cryptographically verifiable address.2.2.1. Delayed VerificationDelayed verification allows to have route entries and route entry deletions in the routing table that are pending of verification. They will be verified whenever the node has spared processor time or before these entries should be used to forward data packages.2.3. Short Cut DetectionWhen a routing protocol for MANET networks does a route discovery, it does not discover the shortest route but the route through which the route request flood traveled faster. In addition, since nodes are moving, a route that was the shortest one at discovery time might stop being so in quite a short period of time. This causes, not only a much bigger end-to-end delay, but also more collisions and a faster power consumption.In order to avoid all the performance loss due to these problems, nodes could periodically discover shortcuts to the active routes that can be used with any destination vector routing protocol. The same mechanism can be used also as a bidirectional route recovery mechanism.

Les xarxes mòbils ad-hoc, també conegues com a MANETs, han estat des de fa ja molt temps objectiu d'estudi per part de la comunitat científica. No obstant això, la seva importància dins el món de la indústria és encara molt baix. Aquests tipus de xarxes, formades per dispositius mòbils tals com smartphones o portàtils, poden ser usades per exemple en entorns mòbils com els campus universitaris, els centres de conferència, o en les indústries militars, de seguretat ciutadana, etc. Per poder establir comunicacions fiables entre els diferents dispositius d'una MANET fa falta un stack de comunicacions. Des de sempre, la comunitat científica ha basat els seus esforços en optimitzar l'stack de comunicacions TCP/IP, l'stack per excel·lència en la majoria de les xarxes actuals. Enlloc de dissenyar un nou stack de comunicacions, els científics han intentat adaptar i millorar les solucions ja existents provinents del món de les xarxes cablejades. Nosaltres, en canvi, creiem que un nou stack de comunicacions específicament dissenyat per a les MANETs és indispensable si el que volem és aconseguir comunicacions fiables en aquest tipus de xarxes, les quals tenen propietats molt diferents a les de les xarxes cablejades. En aquesta tesi presentem el que avui en dia encara no existeix: un nou stack de comunicacions específicament dissenyat per MANETs. Aquest stack és un exemple de com molts dels mecanismes usats en el món de les xarxes cablejades han de ser redissenyats des de la seva base si del que es tracta és de dissenyar protocols per a xarxes mòbils ad-hoc. En definitiva, nosaltres creiem que els resultats presentats en aquesta tesi demostren el potencial d'aquest nou stack de comunicacions per a les MANETs. / Mobile ad-hoc networks have received considerable attention in the wireless communications research community. Nevertheless, its importance in industry is still low. Self-organized MANETs of smartphones or laptops can be used, for example, in military, public safety and disaster relief, conference, or campus environments. In order to enable communications between nodes inside a MANET, a communications stack is needed in each node of the network. Research in this area was always focused on optimizing the TCP/IP stack, the stack par excellence in the majority of our current networks. Instead of designing a complete new communications stack, researchers focused their work mainly on improving already existing solutions coming from the wired networks. However, we think that a complete and new communications stack specifically designed for MANETs is needed if we want to achieve robust communications in this type of networks, which have properties very different from what wired networks have. In this thesis we present what nowadays is still missing: a novel communications stack specifically designed for mobile ad-hoc networks. The MStack is an example of how some of the basic assumptions and mechanisms used in wired or wireless infrastructure networks must be fundamentally modified when dealing with MANETs. All in all, we believe that the results presented in this thesis provide interesting insights into the potential of the MStack in MANETs.

In crucial times, such as natural disasters like Earthquakes, Floods, military attack, rescue and emergency operations, etc., it is not possible to maintain an infrastructure. In these situations, wireless Mobile Ad-Hoc networks can be an alternative to wired networks. In our thesis, due to the importance of MANET (Mobile Ad-hoc Network) applications, we do research on MANET and its subtype IMANET (Internet based Mobile Ad-hoc Network). In MANETs, finding an optimum path among nodes is not a simple issue due to the random mobility of nodes and topology changes frequently. Simple routing algorithms like Shortest Path, Dijksta‟s and Link State fail to find route in such dynamic scenarios. A number of ad-hoc protocols (Proactive, Reactive, Hybrid and Position based) have been developed for MANETs. In this thesis, we have designed an IMANET in OPNET 14.5 and tested the performance of three different routing protocols namely OLSR (Optimum Link State Routing), TORA (Temporarily Ordered Routing Algorithm) and AODV (Ad-hoc On-demand Distance Vector) in different scenarios by varying the number of nodes and the size of the area. The experimental results demonstrate that among the three protocols, none of the routing protocol can ensure good quality HTTP and voice communication in all our considered scenarios.

A packet will be dropped when it arrives at a congested node in a routing path. The authors of [22] proposed the CRP protocol that can alleviate the congestion problem by splitting the traffic to the bypass nodes. In this thesis, we propose a new routing protocol, called MIMO-assisted congestion-adaptive routing protocol (MCRP for short), for multi-hop mobile ad hoc networks (MANETs for short). In MCRP, nodes periodically record the information of their rate-link/range-link neighbors. MCRP alleviates the congestion problem by dynamically adjusting the MIMO antenna mode and splitting the traffic to the downstream range-link neighbors. In addition, MCRP can quickly reestablish the routing path when it is broken due to node failure or mobility. Simulation results show that MCRP outperforms the existing protocols in terms of packet delivery ratio and end-to-end throughput.

Multicasting in mobile ad hoc networks (MANETs) is an efficient method for group communications that has received considerable attention. However, developing a scalable, robust and efficient multicast method in MANETs is difficult owing to group membership management and the ability to maintain a multicast structure over a dynamic topology. This work presents a novel Robust Mesh-based Multicast Protocol (RMMP) that integrates the advantages of tree-based and mesh-based multicast protocols and reduces data recovery time when paths break. The proposed RMMP is performed in two ways. One is to construct a multicast structure using a binary tree, and the other is to provide a second-route discovery scheme. The former distributes transmission averagely among member nodes, and the latter reduces the number of articulation nodes to eliminate loss of data packets. Simulation results demonstrate that the RMMP is suitable for heavy traffic loads, and achieves a high delivery ratio. Furthermore, the RMMP is robust in recovering data transmission when paths break.

none

<p>The use of mobile ad-hoc networks (MANETs) is growing. The issue of security in MANETs is not trivial, since such networks have no fixed infrastructure and therefor centralised security is not applicable. MANETs are also more sensitive to attacks due to their wireless communication channels and their spontaneous nature.</p><p>All kind of cooperation requires a sense of trust. The opinion about trust in other entities can be used as a mean to dynamically allow for secure cooperation in MANETs, as soft security. And also to counter some of the inherited security problems of MANETs.</p><p>To use opinions as a security paradigm in MANETs the opinions about other nodes has to be spread as reputation about a node. This reputation spreading can be done through spreading of opinions or the spreading of evidences about a nodes behaviour.</p><p>In this work evidence and reputation spreading are compared to each other. This comparison shows that they are quite similar from a security point of view but that they differ in scalability.</p>