Made available in DSpace on 2016-06-02T19:05:42Z (GMT). No. of bitstreams: 1 3072.pdf: 1703350 bytes, checksum: 5213111edf7f7c40880a68e93c0462c0 (MD5) Previous issue date: 2010-02-18 / Universidade Federal de Sao Carlos / Mobile computing devices often present high processing power and include several wireless network interfaces. 4G networks promise to provide a unified IP based infrastructure with QoS and security support for the communications using such devices. Transmission delays, and network disruptions, however, are often common when considering the current transmissions of mobile users. This work presents a software communications architecture which is tolerant to transmission delays and intermittent connectivity by exploring a hop-by-hop forwarding mode in DTNs. The proposed architecture is organized as a set of functional layers, which allow the use of different forwarding policies and network technologies. By providing the forwarding of objects, named bundles, an unlimited number of high level communication applications can be implemented on top of the architecture. Security aspects concerning the proper identification of users and transmission bundles, as well as the confidentiality and authentication of the received information are considered in the project of the developed architecture. Log keeping of the bundle forwarding activities performed by the architecture, including the interactions among users and the data passing operations, may be further investigated for use in different context aware forwarding and social organization algorithms. A partial implementation of the developed architecture was made and the results demonstrate the viability of its operation. / Dispositivos computacionais móveis comumente apresentam elevada capacidade de processamento e disponibilidade de múltiplas interfaces de comunicação em rede. Sob o ponto de vista da transmissão de dados, redes 4G deverão prover uma infraestrutura unificada baseada no uso do protocolo IP, com suporte a segurança e QoS para esses dispositivos. Atrasos de propagação, rupturas e perdas de conectividade, contudo, ainda são comuns quando se considera a mobilidade dos usuários. Este trabalho apresenta uma arquitetura de comunicação tolerante a atrasos e conectividade intermitente, que explora o modo de encaminhamento ponto a ponto para prover transmissões em redes DTNs. A arquitetura é organizada em camadas, possibilitando o uso de diferentes políticas de encaminhamento e de diferentes tecnologias de transmissão. Ao prover o encaminhamento de objetos de transmissão, chamados bundles, um número ilimitado de serviços de comunicação em alto nível pode ser implementado sobre a arquitetura desenvolvida. Questões de segurança na identificação dos usuários e dos bundles transmitidos, bem como a confidencialidade e a autenticação das informações são considerados no projeto da arquitetura desenvolvida. O registro de operações realizadas durante os encaminhamentos, incluindo contatos entre usuários e eventos de transmissão, pode ainda servir para alimentar uma base de dados a ser explorada por diferentes algoritmos relacionados a organizações sociais e políticas de encaminhamento cientes de contexto. Uma implementação parcial das funcionalidades previstas pela arquitetura foi realizada e os resultados obtidos mostram a viabilidade de sua operação.

Security is essential to communication between entities in the internet. Delay tolerant and disconnected Mobile Ad Hoc Networks (MANET) are a class of networks characterized by high end-to-end path latency and frequent end-to-end disconnections and are often termed as challenged networks. In these networks nodes are sparsely populated and without the existence of a central server, acquiring global information is difficult and impractical if not impossible and therefore traditional security schemes proposed for MANETs cannot be applied. This thesis reports trust management schemes for peer to peer (P2P) application in delay tolerant disconnected MANETs. Properties of a profile based file sharing application are analyzed and a framework for structured P2P overlay over delay tolerant disconnected MANETs is proposed. The framework is implemented and tested on J2ME based smart phones using Bluetooth communication protocol. A light weight Content Driven Data Propagation Protocol (CDDPP) for content based data delivery in MANETs is presented. The CDDPP implements a user profile based content driven P2P file sharing application in disconnected MANETs. The CDDPP protocol is further enhanced by proposing an adaptive opportunistic multihop content based routing protocol (ORP). ORP protocol considers the store-carry-forward paradigm for multi-hop packet delivery in delay tolerant MANETs and allows multi-casting to selected number of nodes. Performance of ORP is compared with a similar autonomous gossiping (A/G) protocol using simulations. This work also presents a framework for trust management based on dynamicity aware graph re-labelling system (DA-GRS) for trust management in mobile P2P applications. The DA-GRS uses a distributed algorithm to identify trustworthy nodes and generate trustable groups while isolating misleading or untrustworthy nodes. Several simulations in various environment settings show the effectiveness of the proposed framework in creating trust based communities. This work also extends the FIRE distributed trust model for MANET applications by incorporating witness based interactions for acquiring trust ratings. A witness graph building mechanism in FIRE+ is provided with several trust building policies to identify malicious nodes and detect collusive behaviour in nodes. This technique not only allows trust computation based on witness trust ratings but also provides protection against a collusion attack. Finally, M-trust, a light weight trust management scheme based on FIRE+ trust model is presented.

Submitted by Erika Demachki (erikademachki@gmail.com) on 2015-02-05T19:42:01Z No. of bitstreams: 2 Dissertação - Diógenes Antonio Marques José - 2014.pdf: 9980108 bytes, checksum: eea0a39505448f7845d92bdbb4716ff2 (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) / Approved for entry into archive by Erika Demachki (erikademachki@gmail.com) on 2015-02-05T19:42:44Z (GMT) No. of bitstreams: 2 Dissertação - Diógenes Antonio Marques José - 2014.pdf: 9980108 bytes, checksum: eea0a39505448f7845d92bdbb4716ff2 (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) / Made available in DSpace on 2015-02-05T19:42:45Z (GMT). No. of bitstreams: 2 Dissertação - Diógenes Antonio Marques José - 2014.pdf: 9980108 bytes, checksum: eea0a39505448f7845d92bdbb4716ff2 (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) Previous issue date: 2014-06-05 / This work contributes with an extension to the Optimized Link State Routing protocol (OLSR) called Fuzzy Cost OLSR (OLSR-FC). In order to prevent selfish nodes as well as to improve the traffic flow over Mobile Ad-hoc Networks (MANETs), the routing metrics implemented in OLSR-FC make use of a Fuzzy Inference System (FIS) composed of 8 inference rules. Aiming at the choose of paths with low packet loss, better energy capacity and high connectivity, OLSR-FC implements a procedure of election of routes that takes into account the following parameters: Packet Loss Index (PLI), Residual Energy (RE) and Connectivity Index (CI). The OLSR-FC was evaluated by simulation through the NS- 2, in which two scenarios were implemented: a static one with 10 nodes (in testing phase), and a mobile one with up to 50 nodes. In the former scenario, a comparison was made between OLSR-FC and the original OLSR protocol which results showed that OLSR-FC overcomes OLSR in terms of throughput the packet loss. In the latter scenario, besides the original OLSR protocol, OLSR-FC was also faced up with the OLSR-ETX, OLSR-ML and OLSR-MD extensions in terms of the following performance metrics: throughput, energy consumption, packet loss rate, overhead, delay end-to-end, jitter, and packet delivery rate. In this context, results pointed that OLSR-FC achieved better performance in scenarios with a maximum of 10% of selfish nodes in comparison with every OSLR extension and the OLSR. Besides, by evaluating the main network performance metrics, such as throughput and delivery packet rate, OLSR-FC achieved eleven favorable cases against five cases in comparison with OLSR protocol. / O presente trabalho propõe uma extensão ao protocolo Optimized Link State Routing (OLSR) denominada OLSR Fuzzy Cost (OLSR-FC). A métrica de roteamento utilizada pelo OLSR-FC faz uso de um Sistema de Inferência Fuzzy (SIF), composto por 8 regras de inferência, que tem como objetivos evitar nós egoístas e melhorar o fluxo do tráfego nas redes móveis ad-hoc (MANETs). O critério de escolha de rotas leva em consideração os seguintes parâmetros: Índice de Perda de Pacotes (IPP), Energia Residual (ER) e Índice de Conectividade (IC), o propósito disso, consiste em escolher caminhos que possuam baixa perda de pacotes, melhor capacidade energética e alta conectividade. A proposta foi avaliada por simulação utilizando o simulador de redes NS-2. Foram considerados na avaliação dois cenários, um estático com 10 nós (utilizado na fase de testes) e um móvel com até 50 nós. No cenário estático o OLSR-FC foi comparado ao OLSR e os resultados mostraram que a proposta obtém vantagens com relação às métricas de desempenho vazão e perda de pacotes. No cenário móvel o OLSR-FC, além do OLSR, foi comparado às extensões OLSR-ETX, OLSR-ML e OLSR-MD, com relação as seguintes métricas de desempenho: vazão, consumo de energia, perda de pacotes, overhead, atraso fim-a-fim, jitter e taxa de entrega de pacotes. Nesse contexto, os resultados obtidos mostram que em ambientes com até 10% de nós egoístas o OLSR-FC obtém melhor desempenho que as extensões testadas e com relação ao OLSR, na mesma situação, avaliando as principais métricas de desempenho de redes, como vazão e taxa de entrega de pacotes, o OLSR-FC obteve onze casos favoráveis contra apenas cinco casos do OLSR.

No description available.

Security is essential to communication between entities in the internet. Delay tolerant and disconnected Mobile Ad Hoc Networks (MANET) are a class of networks characterized by high end-to-end path latency and frequent end-to-end disconnections and are often termed as challenged networks. In these networks nodes are sparsely populated and without the existence of a central server, acquiring global information is difficult and impractical if not impossible and therefore traditional security schemes proposed for MANETs cannot be applied. This thesis reports trust management schemes for peer to peer (P2P) application in delay tolerant disconnected MANETs. Properties of a profile based file sharing application are analyzed and a framework for structured P2P overlay over delay tolerant disconnected MANETs is proposed. The framework is implemented and tested on J2ME based smart phones using Bluetooth communication protocol. A light weight Content Driven Data Propagation Protocol (CDDPP) for content based data delivery in MANETs is presented. The CDDPP implements a user profile based content driven P2P file sharing application in disconnected MANETs. The CDDPP protocol is further enhanced by proposing an adaptive opportunistic multihop content based routing protocol (ORP). ORP protocol considers the store-carry-forward paradigm for multi-hop packet delivery in delay tolerant MANETs and allows multi-casting to selected number of nodes. Performance of ORP is compared with a similar autonomous gossiping (A/G) protocol using simulations. This work also presents a framework for trust management based on dynamicity aware graph re-labelling system (DA-GRS) for trust management in mobile P2P applications. The DA-GRS uses a distributed algorithm to identify trustworthy nodes and generate trustable groups while isolating misleading or untrustworthy nodes. Several simulations in various environment settings show the effectiveness of the proposed framework in creating trust based communities. This work also extends the FIRE distributed trust model for MANET applications by incorporating witness based interactions for acquiring trust ratings. A witness graph building mechanism in FIRE+ is provided with several trust building policies to identify malicious nodes and detect collusive behaviour in nodes. This technique not only allows trust computation based on witness trust ratings but also provides protection against a collusion attack. Finally, M-trust, a light weight trust management scheme based on FIRE+ trust model is presented.

In the wake of major disasters, the failure of existing communications infrastructure and the subsequent lack of an effective communication solution results in increased risks, inefficiencies, damage and casualties. Currently available options such as satellite communication are expensive and have limited functionality. A robust communication solution should be affordable, easy to deploy, require little infrastructure, consume little power and facilitate Internet access. Researchers have long proposed the use of ad hoc wireless networks for such scenarios. However such networks have so far failed to create any impact, primarily because they are unable to handle network transience and have usability constraints such as static topologies and dependence on specific platforms. LifeNet is a WiFi-based ad hoc data communication solution designed for use in highly transient environments. After presenting the motivation, design principles and key insights from prior literature, the dissertation introduces a new routing metric called Reachability and a new routing protocol based on it, called Flexible Routing. Roughly speaking, reachability measures the end-to-end multi-path probability that a packet transmitted by a source reaches its final destination. Using experimental results, it is shown that even with high transience, the reachability metric - (1) accurately captures the effects of transience (2) provides a compact and eventually consistent global network view at individual nodes, (3) is easy to calculate and maintain and (4) captures availability. Flexible Routing trades throughput for availability and fault-tolerance and ensures successful packet delivery under varying degrees of transience. With the intent of deploying LifeNet on field we have been continuously interacting with field partners, one of which is Tata Institute of Social Sciences India. We have refined LifeNet iteratively refined base on their feedback. I conclude the thesis with lessons learned from our field trips so far and deployment plans for the near future.

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.

La dissémination d’information dans les réseaux VANET est une opération fondamentale pour la sécurité routière. Il est dès lors nécessaire de concevoir et mettre en oeuvre des algorithmes efficaces et adaptatifs pour la dissémination d’informations sélectives et pertinentes.Dans ce travail, des approches Bio-inspirées sont proposées, à partir des comportements auto-organisés des essaims comme les colonies de fourmis et d’abeilles. Ces approches visent à fournir à chaque véhicule des informations en provenance de son environnement et alerter les conducteurs. Dans la première approche, le système de communication direct et indirect des fourmis est utilisé. Les fourmis partagent les informations sur les sources de nourriture avec des membres de la colonie en sécrétant la phéromone sur leurs chemins. La deuxième approche est inspirée par le système de communication des abeilles. Les abeilles partagent les informations à propos des sources de nourriture avec les autres membres de la ruche par des messages spécifiques, selon l’importance de ces sources.Une nouvelle mesure de "pertinence" associée aux messages est définie, par analogie à la sécrétion des phéromones des fourmis et au niveau de l’intensité des messages pour les abeilles, pour disséminer des informations de sécurité dans une zone géographique. Les simulations sont effectuées en utilisant le simulateur NS2 pour mesurer l’efficacité des approches proposées sous différentes conditions, en particulier en termes de densités et vitesses des véhicules. / Information dissemination in Vehicular Ad hoc Networks (VANETs) is a fundamental operation to increase the safety awareness among vehicles on roads. Thus, the design and implementation of efficient and scalable algorithms for relevant information dissemination constitutes a major issue that should be tackled.In this work, bio-inspired information dissemination approaches are proposed, that use self-organization principles of swarms such as Ant and Honey Bee colonies. These approaches are targeted to provide each vehicle with the required information about its surrounding and assist drivers to be aware of undesirable road conditions. In the first approach, Ant’s direct and indirect communication systems are used. Ants share information about food findings with colony members by throwing pheromone on the returning to the nest. The second, an RSU-based approach is inspired by the Bee communication system. Bees share profitable food sources with hive-mates in their hive by specific messages.A “relevance” value associated to the emergency messages is defined as an analogue to pheromone throwing in Ant colony, and as an analogue to profitability level in Bee colony, to disseminate safety information within a geographical area. Simulations are conducted using NS2 network simulator and relevant metrics are evaluated under different node speeds and network densities to show the effectiveness of the proposed approaches.

A Mobile Ad hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network without the need for base stations or any other pre–existing network infrastructure. In a peer-to-peer fashion, mobile nodes can communicate with each other by using wireless multihop communication. Due to its low cost, high flexibility, fast network establishment and self-reconfiguration, ad hoc networking has received much interest during the last ten years. However, without a fixed infrastructure, frequent path changes cause significant numbers of routing packets to discover new paths, leading to increased network congestion and transmission latency over fixed networks. Many on-demand routing protocols have been developed by using various routing mobility metrics to choose the most reliable routes, while dealing with the primary obstacle caused by node mobility. ¶ In the first part, we have developed an analysis framework for mobility metrics in random mobility model. Unlike previous research, where the mobility metrics were mostly studied by simulations, we derive the analytical expressions of mobility metrics, including link persistence, link duration, link availability, link residual time, link change rate and their path equivalents. We also show relationships between the different metrics, where they exist. Such exact expressions constitute precise mathematical relationships between network connectivity and node mobility. ¶ We further validate our analysis framework in Random Walk Mobility model (RWMM). Regarding constant or random variable node velocity, we construct the transition matrix of Markov Chain Model through the analysis of the PDF of node separation after one epoch. In addition, we present intuitive and simple expressions for the link residual time and link duration, for the RWMM, which relate them directly to the ratio between transmission range and node speed. We also illustrate the relationship between link change rate and link duration. Finally, simulation results for all mentioned mobility metrics are reported which match well the proposed analytical framework. ¶ In the second part, we investigate the mobility metric applications on caching strategies and hierarchy routing algorithm. When on-demand routing employed, stale route cache information and frequent new-route discovery in processes in MANETs generate considerable routing delay and overhead. This thesis proposes a practical route caching strategy to minimize routing delay and/or overhead by setting route cache timeout to a mobility metric, the expected path residual time. The strategy is independent of network traffic load and adapts to various non-identical link duration distributions, so it is feasible to implement in a real-time route caching scheme. Calculated results show that the routing delay achieved by the route caching scheme is only marginally more than the theoretically determined minimum. Simulation in NS-2 demonstrates that the end-to-end delay from DSR routing can be remarkably reduced by our caching scheme. By using overhead analysis model, we demonstrate that the minimum routing overhead can be achieved by increasing timeout to around twice the expected path residual time, without significant increase in routing delay. ¶ Apart from route cache, this thesis also addresses link cache strategy which has the potential to utilize route information more efficiently than a route cache scheme. Unlike some previous link cache schemes delete links at some fixed time after they enter the cache, we proposes using either the expected path duration or the link residual time as the link cache timeout. Simulation results in NS-2 show that both of the proposed link caching schemes can improve network performance in the DSR by reducing dropped data packets, latency and routing overhead, with the link residual time scheme out-performing the path duration scheme. ¶ To deal with large-scale MANETs, this thesis presents an adaptive k-hop clustering algorithm (AdpKHop), which selects clusterhead (CH) by our CH selection metrics. The proposed CH selection criteria enable that the chosen CHs are closer to the cluster centroid and more stable than other cluster members with respect to node mobility. By using merging threshold which is based on the CH selection metric, 1-hop clusters can merge to k-hop clusters, where the size of each k-hop cluster adapts to the node mobility of the chosen CH. Moreover, we propose a routing overhead analysis model for k-hop clustering algorithm, which is determined by a range of network parameters, such as link change rate (related to node mobility), node degree and cluster density. Through the overhead analysis, we show that an optimal k-hop cluster density does exist, which is independent of node mobility. Therefore, the corresponding optimal cluster merging threshold can be employed to efficiently organise k-hop clusters to achieve minimum routing overhead, which is highly desirable in large-scale networks. ¶ The work presented in this thesis provides a sound basis for future research on mobility analysis for mobile ad hoc networks, in aspects such as mobility metrics, caching strategies and k-hop clustering routing protocols.

In the wake of major disasters, the failure of existing communications infrastructure and the subsequent lack of an effective communication solution results in increased risks, inefficiencies, damage and casualties. Currently available options such as satellite communication are expensive and have limited functionality. A robust communication solution should be affordable, easy to deploy, require little infrastructure, consume little power and facilitate Internet access. Researchers have long proposed the use of ad hoc wireless networks for such scenarios. However such networks have so far failed to create any impact, primarily because they are unable to handle network transience and have usability constraints such as static topologies and dependence on specific platforms. LifeNet is a WiFi-based ad hoc data communication solution designed for use in highly transient environments. After presenting the motivation, design principles and key insights from prior literature, the dissertation introduces a new routing metric called Reachability and a new routing protocol based on it, called Flexible Routing. Roughly speaking, reachability measures the end-to-end multi-path probability that a packet transmitted by a source reaches its final destination. Using experimental results, it is shown that even with high transience, the reachability metric - (1) accurately captures the effects of transience (2) provides a compact and eventually consistent global network view at individual nodes, (3) is easy to calculate and maintain and (4) captures availability. Flexible Routing trades throughput for availability and fault-tolerance and ensures successful packet delivery under varying degrees of transience. With the intent of deploying LifeNet on field we have been continuously interacting with field partners, one of which is Tata Institute of Social Sciences India. We have refined LifeNet iteratively refined base on their feedback. I conclude the thesis with lessons learned from our field trips so far and deployment plans for the near future.