IPv6 Neighbor Discovery for Vehicular Networks

Vehicular Communication Networks (VCN) are critical enabling technologies that contribute to the advancement of Intelligent Transportation Systems. Although initially VCN were thought with a focus on safety, there is a myriad of IP-based applications for information and entertainment systems to be deployed in vehicular scenarios. To support IP-based applications, standard protocol stacks, including IEEE WAVE and the recent 3GPP C-V2X architectures, define the transport of IPv6 and related protocols on top of the specific wireless access technologies. One of the fundamental protocols for the use of IPv6 is Neighbor Discovery (ND), defined in RFC 4861. In this work, we evaluate the performance of the standard ND protocol and compare it to recent works, including several IETF Internet-drafts, that propose enhancements for the IP registration and duplicate detection processes in the dynamic environment of VCN.Sociedad Argentina de Informática e Investigación Operativ

Route discovery schemes in Mobile Ad hoc Networks with variable-range transmission power

Broadcasting in MANETs is important for route discovery but consumes significant amounts of power that is difficult to renew for devices that rely heavily on batteries. Most existing routing protocols make use of a broadcast scheme known as simple flooding. In such an on-demand routing protocol (e.g. AODV) the source node originates a Route Request (RREQ) packet that is blindly rebroadcast via neighbouring nodes to all nodes in the network. Simple flooding leads to serious redundancy, together with contention, and collisions, which is often called the broadcast storm problem. This thesis proposes two improvement strategies: topology control (adjusting transmission power) and reduced retransmissions (reducing redundant rebroadcasts) to reduce energy consumption. For energy efficient route discovery the main idea is to reduce the energy consumed per broadcast during route discovery. An Energy Efficient Adaptive Forwarding Algorithm (called EEAFA) is proposed to reduce the impact of RREQ packet flooding in on-demand routing protocols. The algorithm operates in two phases: 1) Topology construction phase, which establishes a more scalable and energy efficient network structure where nodes can adjust their transmission power range dynamically, based on their local density. 2) A Forwarding Node Determination phase, that utilises network information provided by the constructed topology, where nodes independently decide to forward a RREQ packet or not without relying on GPS or any distance calculations. A further Enhanced EEAFA (called E-EEAFA) algorithm is also proposed, which combines two techniques: graph colouring and sectoring techniques. Graph colouring increases awareness at network nodes to improve the determination of a forwarding node, while the sectoring technique divides neighbours into different forwarding sectors. This helps to reduce overlap between forwarding nodes and select suitable nodes in each sector to forward RREQ packets. These techniques are employed in a distributed manner and collaborate to reduce the number of forwarding nodes, which thus reduces the volume of RREQ packets populating the network. These algorithms have been validated as effective by NS2 simulation studies that are detailed in the thesis

Mobile Ad-Hoc Networks

Being infrastructure-less and without central administration control, wireless ad-hoc networking is playing a more and more important role in extending the coverage of traditional wireless infrastructure (cellular networks, wireless LAN, etc). This book includes state-of-the-art techniques and solutions for wireless ad-hoc networks. It focuses on the following topics in ad-hoc networks: quality-of-service and video communication, routing protocol and cross-layer design. A few interesting problems about security and delay-tolerant networks are also discussed. This book is targeted to provide network engineers and researchers with design guidelines for large scale wireless ad hoc networks

Mecanismos de facturação segura em redes auto-organizadas

Mestrado em Engenharia Electrónica e TelecomunicaçõesAs redes ad-hoc e as redes auto-organizadas constituem uma área de investigação com grande interesse. Estas redes são uteis em cenários onde seja necessária uma rede de baixo custo, elevada adaptabilidade e reduzido tempo de criação. As redes infra-estruturadas, tendo uma gestão centralizada, estão agora a começar a adoptar os conceitos de redes autoorganizadas nas suas arquitecturas. Ao contrário dos sistemas centralizados, redes auto-organizadas requerem que todos os terminais participantes operem de acordo com o melhor interesse da rede. O facto de, em redes ad-hoc, os equipamentos possuírem recursos limitados, pôe em causa este requisito levando a comportamentos egoístas. Este comportamento é espectavel criando problemas nas redes auto-organizativas, ameaçando o funcionamento de uma rede inteira. Algumas propostas foram ja criadas de modo a motivar a sua utilização correcta. Destas, algumas são baseadas em trocas de credito entre utilizadores, outras preveêm a existência de entidades gestoras de creditos. Estas ultimas propostas, que irão ser o foco desta dissertação, permitem a facil integração de redes ad-hoc com redes infra-estruturadas e geridas por um operador. Este trabalho descreve o estado da arte actual e, com algum detalhe, os métodos utilizados e as solucões relevantes para esta area. São propostas duas novas soluções de taxação para estas redes. Ambas as soluções possibilitam a integração das redes com metodos de taxação habituais em redes geridas por operadores. Para além disto, a motivação à participaçãao é aumentada através de incentivos ao encaminhamento de pacotes. Todos os processos são criptograficamente seguros através da utilização de métodos standard como DSA sobre Curvas Elípticas e funções de síntese robustas. As soluções propostas são descritas analiticamente e analisadas, sendo os os resultados obtidos comparados com outra proposta do estado da arte. Um exaustivo trabalho de simulação é igualmente descrito de forma a avaliar as soluções em cenários mais complexos. Os resultados obtidos em simulação são avaliados tendo em conta a variação de várias métricas como mobilidade, carga na rede, protocolo de encaminhamento e protocolo de transporte. No final, a arquitectura, implementação e resultados obtidos com uma implementação real de uma das propostas e os seus resultados analisados.Self-organised and ad-hoc networks are an area with an existing large research community. These networks are much useful in scenarios requiring a rapidly deployed, low cost and highly adaptable network. Recently, infrastructure networks, which are managed in a much centralised form, are starting to introduce concepts of self-organised networks in its architecture. In opposition to centralised systems, self-organisation creates the necessity for all nodes to behave according to the best interest of the network. The fact that in many ad-hoc networks nodes have scarce resources poses some threats to this requirement. As resources decreases, such as battery or wireless bandwidth, nodes can start acting selfishly. This behaviour is known to bring damage to self-organised networks and threatens the entire network. Several proposals were made in order to promote the correct usage of the network. Some proposals are based on local information and direct credit exchange while others envision the existence of a central bank. The later solutions are further elaborated in this thesis, as they make possible integration of ad-hoc network with operator driven infrastructures. This work presents the current state-of-the-art on the area providing a detailed insight on the methods adopted by each solution presented. Two novel solutions are proposed providing charging support for integrated ad-hoc networks. Both solutions provide means of integration with standard management methods found in operator networks. Also, node´s motivation is increased through the reward of nodes forwarding data packets. The entire process is cryptographically secure, making use of standard methods such as Elliptic Curve DSA and strong digest functions. The solutions proposed are described and analysed analytically, comparing the results with other state-of-the-art proposals. Extensive simulation work is also presented which furthers evaluates the solutions in complex scenarios. Results are obtained from these scenarios and several metrics are evaluated taking in consideration mobility, network load, routing protocol and transport protocol. The architecture and results obtained with a real implementation are finally presented and analysed

Topics on modelling and simulation of wireless networking protocols

The use of computer simulation to study complex systems has grown significantly over the past several decades. This is especially true with regard to computer networks, where simulation has become a widespread tool used in academic, commercial and military applications. Computer model representations of communication protocol stacks are used to replicate and predict the behavior of real world counterparts to solve a variety of problems.The performance of simulators, measured in both accuracy of results and run time, is a constant concern to simulation users. The running time for high delity simulation of large-scale mobile ad hoc networks can be prohibitively high. The execution time of propagation e ects calculations for a single transmission alone can grow unmanageable to account for all potential receivers. Discrete event simulators can also su er from excessive generation and processing of events, both due to network size and model complexity. In this thesis, three levels of abstracting the Institute of Electrical and Electronics Engineers (IEEE) 802.11 Request to Send/Clear to Send (RTS/CTS) channel access mechanism are presented. In the process of assessing the abstractions' ability to mitigate runtimecost while retaining comparable results to that of a commercially available simulator, OPNET, the abstractions were found to be better suited to collecting one metric over another.Performance issues aside, simulation is an ideal choice for use in prototyping and developing protocols. The costs of simulation are orders of magnitude smaller than that of network testbeds, especially after factoring in the logistics, maintenance, and space required to test live networks. For instance, Internet Protocol version 6 (IPv6) stateless address autocon guration protocols have yet to be convincingly shown to cope with the dynamic, infrastructure-free environment of Mobile Ad hoc Networks (MANETs). This thesis provides a literature survey of autocon guration schemes designed for MANETs, with particular focus on a stateless autocon guration scheme by Jelger andNoel (SECON 2005). The selected scheme provides globally routable IPv6 pre xes to a MANET attached to the Internet via gateways. Using OPNET simulation, the Jelger-Noel scheme is examined with new cluster mobility models, added gateway mobility, and varied network sizes. Performance of the Jelger-Noel scheme, derived from overhead, autocon gura ion time and pre x stability metrics, was found to be highly dependent on network density, and suggested further re nement before deployment.Finally, in cases where a network testbed is used to test protocols, it is still advantageous to run simulations in parallel. While testbeds can help expose design aws due to code or hardware di erences, discrete event simulation environments can o er extensive debugging capabilities andevent control. The two tools provide independent methods of validating the performance of protocols, as well as providing useful feedback on correct protocol implementation and con guration. This thesis presents the Open Shortest Path First (OSPF) routing protocol and its MANET extensions as candidate protocols to test in simulated and emulated MANETs. The measured OSPF overhead from both environments was used as a benchmark to construct equivalent MANET representations and protocol con guration, made particularly challenging due to the wired nature of the emulation testbed. While attempting to duplicate and validate results of a previous OSPF study, limitations of the simulated implementation of OSPF were revealed.M.S., Electrical Engineering -- Drexel University, 200

Modeling and Performance Evaluation of MANET Handover

A Mobile Ad Hoc Network (MANET) is an unstructured collection of wireless nodes that move arbitrarily and use multi-hop protocols to communicate between each other. There is not a predefined infrastructure in a MANET as there is in other types of wireless networks. Now days, MANET networks integrate with other networks, like the Internet, permitting ad hoc nodes to communicate with hosts placed in any part of the world. But the integration of MANETs with fixed infrastructures must be carefully studied to evaluate how it performs. In such integrated scenario, commonly known as Hybrid Ad Hoc Network, a MANET can be seen as an extension to the existing infrastructure, whose mobile nodes seamlessly communicate with hosts on the fixed network by forwarding packets throughout the gateways found on the edge that join both types of network. Connecting MANETs to the Internet does not come without difficulties. Ad hoc routing protocols work different than the regular routing protocols used on the Internet, and their interoperability becomes an important issue. But when MANETs integrate with the Internet, a more demanding challenge emerges if node mobility is considered. A moving node may lose registration with its current gateway, and may then need to register to a different gateway (a handover) to continue communicating. During a handover, any ongoing communication will be interrupted affecting network performance. In order to improve this performance, an IP mobility management protocol must be used. The main objective of this research is to develop a model that may be used to evaluate the performance of MANET handovers under different scenarios. Different issues about MANET integration with the Internet are considered: the IP mobility protocol implemented, the external route computation procedure, the type of ad hoc routing protocol used, and the gateway discovery approach used. For this evaluation, a mobile node in a MANET holding a communication with a correspondent node in the Internet roams to a different sub-network, having to change its registration to a different gateway. The different scenarios considered to evaluate the handover performance include the use of different types of MANET protocols, the use of different gateway discovery approaches, and the use of different versions of the Mobile IP protocol. During the research a review was made of the functioning conditions for the proposed scenario. Then, a handover model was proposed, which was used to develop some metrics that were later used to evaluate the MANET handover performance. This metrics are the broken communication time, the probability of handover failure, and the average communication interruption time. In all the results found, we could confirm that the proactive discovery approach has a better handover performance than the reactive discovery approach, which permit us to conclude that regardless the MANET routing protocol, and the Mobile IP version, the proactive agent discovery approach should be used in highly mobile scenarios, preferable, with the reactive routing protocol

A security architecture for IPv6 enabled wireless medical sensor networks.

We present the design of an IPv6 enabled wireless sensor network based on the IEEE 802.15.4 standard for medical monitoring. We design a routing mechanism for efficient flooding, a hop-by-hop error recovery and congestion control mechanism for reliable packet delivery and a lightweight security architecture for the medical monitoring system. We extend the widely used Extensible Authentication Protocol (EAP) to employ the Generalized Pre-shared Key (GPSK) authentication method with some optimizations for securing the system. We use the 3-party EAP model with the Personal Area Network Coordinator (PAN coordinator) of IEEE 802.15.4 standard as the EAP authenticator for authenticating sensor nodes within the radio range of the PAN coordinator. In order to use EAP authentication for a sensor node several hops away from the PAN coordinator, we define a new role (relay authenticator) for its coordinator which tunnels EAP messages to the PAN coordinator securely. We define EAP message encapsulation for IEEE 802.15.4 networks and a key hierarchy for the security architecture. We have simulated the system and shown that EAP based authentication is feasible in wireless sensor networks.The original print copy of this thesis may be available here: http://wizard.unbc.ca/record=b136235

BATSEN: Modifying the BATMAN Routing Protocol for Wireless Sensor Networks

The proliferation of autonomous Wireless Sensor Networks (WSN) has spawned research seeking power efficient communications to improve the lifetime of sensor motes. WSNs are characterized by their power limitations, wireless transceivers, and the converge-cast communications techniques. WSN motes use low-power, lossy radio systems deployed in dense, random topologies, working sympathetically to sense and notify a sink node of the detectable information. In an effort to extend the life of battery powered motes, and hence the life of the network, various routing protocols have been suggested in an effort to optimize converge-cast delivery of sensor data. It is well known that reducing the overhead required to perform converge-cast routing and communications reduces the effects of the primary power drain in the mote, the transceiver. Furthermore, WSNs are not well protected; network security costs energy both in computation and in RF transmission. This paper investigates the use of a Mobile Ad-hoc Networking (MANET) routing protocol known as B.A.T.M.A.N. in WSN. This thesis proposes that the features of B.A.T.M.A.N. in the MANET realm may prove beneficial to the WSN routing domain; and that slight modifications to the routing technique may prove beneficial beyond current protocol technologies. The B.A.T.M.A.N. variant will be compared against the contemporary LEACH WSN routing protocol to discern any potential energy savings

Integration of unidirectional technologies into wireless back-haul architecture

This thesis was submitted for the degree of Docter of Philosophy and awarded by Brunel University.Back-haul infrastructures of today's wireless operators must support the triple-play services demanded by the market or regulatory bodies. To cope with increasing capacity demand, the EU FP7 project CARMEN has developed a cost-effective heterogeneous multi-radio wireless back-haul architecture, which may also leverage the native multicast capabilities of broadcast technologies such as DVB-T to off-load high-bandwidth broadcast content delivery. However, the integration of such unidirectional technologies into a packet-switched architecture requires careful considerations. The contribution of this thesis is the investigation, design and evaluation of protocols and mechanisms facilitating the integration of such unidirectional technologies into the wireless back-haul architecture so that they can be configured and utilized by the spectrum and capacity optimization modules. This integration mainly concerns the control plane and, in particular, the aspects related to resource and capability descriptions, neighborhood, link and Multi Protocol Label Switching (MPLS) Label-Switched Path (LSP) monitoring, unicast and multicast LSP signalling as well as topology forming and maintenance. During the course of this study we have analyzed the problem space, proposed solutions to the resulting research questions and evaluated our approach. Our results show that the now Unidirectional Technology (UDT)-aware architecture can readily consider Unidirectional Technologies (UDTs) to distribute, for example, broadcast content