Efficient Routing in VANETs Using MRRP Algorithm

Designing a reliable routing protocol for Vehicular Ad hoc Network (VANET) poses considerable challenges due to certain unique challenges inherently present in Vehicular Ad hoc Network (VANET) topology. Some of them are needed for vehicles acting as nodes having to abide by traffic rules, uncertain inter-vehicular speed variations that may affect link stability etc. Designing a routing protocol capable of dealing with multiple limiting conditions such as long congestion periods, link failures and handoffs is a challenging task, where most of the existing multipath routing protocol shows poor performance. In this paper, the proposed Multipath Route Restoration Protocol (MRRP)is aimed at providing a robust communication channel in case of link failure between nodes. This is realized by focusing on better route maintenance for the protocol. In a wireless network, a routing protocol determines the particular ways in which routers connect. In a wireless network, as the number of hops in a wireless communication path increases, various signal factors such as interference and path loss degrade the network performance. however, sending data over a longer distance will reduce throughput. Furthermore, link stability is substantially impacted by the unpredictable movement of vehicles. Multipath routing is regarded as a potential solution to improve packet delivery and end-to-end delay in VANETs

Position-based routing and MAC protocols for wireless ad-hoc networks

This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.This thesis presents the Forecasting Routing Technique (FORTEL), a routing protocol for Mobile Ad-Hoc Networks (MANETs) based on the nodes’ Location Information. FORTEL stores the nodes’ location information in the Location Table (LT) in order to construct routes between the source and the destination nodes. FORTEL follows the source routing strategy, which has rarely been applied in position-based routing. According to the source routing strategy, the end-to-end route is attached to the packet, therefore, the processing cost, in regards to the intermediate nodes that simply relay the packet according to route, is minimized. FORTEL’s key mechanisms include: first, the location update scheme, employed to keep the LT entries up-to-date with the network topology. Besides the mobility variation and the constant rate location update schemes applied, a window location update scheme is presented to increase the LT’s information accuracy. Second, the switching mechanism, between “Hello” message and location update employed, to reduce the protocol’s routing overhead. Third and most important is the route computation mechanism, which is integrated with a topology forecasting technique to construct up-to-date routes between the communication peers, aiming to achieve high delivery rate and increase the protocol robustness against the nodes’ movement. FORTEL demonstrates higher performance as compared to other MANET’s routing protocols, and it delivers up to 20% more packets than AODV and up to 60 % more than DSR and OLSR, while maintaining low levels of routing overhead and network delay at the same time. The effectiveness of the window update scheme is also discussed, and it proves to increase FORTEL’s delivery rate by up to 30% as compared to the other update schemes. A common and frequently occurring phenomenon, in wireless networks, is the Hidden Terminal problem that significantly impacts the communication performance and the efficiency of the routing and MAC protocols. Beaconless routing approach in MANETs, which delivers data packets without prior knowledge of any sort `of information, suffers from packet duplication caused by the hidden nodes during the contention process. Moreover, the throughput of the IEEE MAC protocol decreases dramatically when the hidden terminal problem occurs. RTS/CTS mechanism fails to eliminate the problem and can further degrade the network’s performance by introducing additional overhead. To tackle these challenges, this thesis presents two techniques, the Sender Suppression Algorithm and the Location-Aided MAC, where both rely on the nodes’ position to eliminate packet duplication in the beaconless routing and improve the performance of the 802.11 MAC respectively. Both schemes are based on the concept of grouping the nodes into zones and assign different time delay to each one. According to the Sender Suppression Algorithm, the sender’s forwarding area is divided into three zones, therefore, the local timer, set to define the time that the receiver has to wait before responding to the sender’s transmission, is added to the assigned zone delay. Following the first response, the sender interferes and suppresses the receivers with active timer of. On the other hand, the Location-Aided MAC, essentially a hybrid MAC, combines the concepts of time division and carrier sensing. The radio range of the wireless receiver is partitioned into four zones with different zone delays assigned to each zone. Channel access within the zone is purely controlled by CSMA/CA protocol, while it is time-based amongst zones. The effectiveness of the proposed techniques is demonstrated through simulation tests. Location-Aided MAC considerably improves the network’s throughput compared to CSMA/CA and RTS/CTS. However, remarkable results come when the proposed technique and the RTS/CTS are combined, which achieves up to 20% more throughput as compared to the standalone RTS/CTS. Finally, the thesis presents a novel link lifetime estimation method for greedy forwarding to compute the link duration between two nodes. Based on a newly introduced Stability-Aware Greedy (SAG) scheme, the proposed method incorporates the destination node in the computation process and thus has a significant advantage over the conventional method, which only considers the information of the nodes composing the link

Routing for Flying Networks using Software-Defined Networking

Nos últimos anos, os Veículos Aéreos Não Tripulados (UAVs) estão a ser usados de forma crescente em inúmeras aplicações, tanto militares como civis. A sua miniaturização e o preço reduzido abriram o caminho para o uso de enxames de UAVs, que permitem melhores resultados na realização de tarefas em relação a UAVs independentes. Contudo, para permitir a cooperação entre UAVs, devem ser asseguradas comunicações contínuas e fiáveis.Além disso, os enxames de UAVs foram identificados pela comunidade científica como meio para permitir o acesso à Internet a utilizadores terrestres em cenários como prestação de socorros e Eventos Temporários Lotados (TCEs), tirando partido da sua capacidade para transportar Pontos de Acesso (APs) Wi-Fi e células Long-Term Evolution (LTE). Soluções que dependem de uma Estação de Controlo (CS) capaz de posicionar os UAVs de acordo com as necessidades de tráfego dos utilizadores demonstraram aumentar a Qualidade de Serviço (QoS) oferecida pela rede. No entanto, estas soluções introduzem desafios importantes no que diz respeito ao encaminhamento do tráfego.Recentemente, foi proposta uma solução que tira partido do conhecimento da CS sobre o estado futuro da rede para atualizar dinamicamente as tabelas de encaminhamento de modo a que as ligações na rede voadora não sejam interrompidas, em vez de se recuperar da sua interrupção, como é o caso na maioria dos protocolos de encaminhamento existentes. Apesar de não considerar o impacto das reconfigurações na rede de acesso, como consequência da mobilidade dos APs, ou o balanceamento da carga na rede, esta abordagem é promissora e merece ser desenvolvida e implementada num sistema real.Esta dissertação tem como foco a implementação de um protocolo de encaminhamento para redes voadoras baseado em Software-Defined Networking (SDN). Especificamente, aborda os problemas de mobilidade e de balanceamento da carga na rede de uma perspetiva centralizada, garantindo simultaneamente comunicações ininterruptas e de banda-larga entre utilizadores terrestres e a Internet, permitindo assim que os UAVs se possam reposicionar e reconfigurar sem interferir com as ligações dos terminais à rede.In recent years, Unmanned Aerial Vehicles (UAVs) are being increasingly used in various applications, both military and civilian. Their miniaturisation and low cost paved the way to the usage of swarms of UAVs, which provide better results when performing tasks compared to single UAVs. However, to enable cooperation between the UAVs, always-on and reliable communications must be ensured.Moreover, swarms of UAVs are being targeted by the scientific community as a way to provide Internet access to ground users in scenarios such as disaster reliefs and Temporary Crowded Events (TCEs), taking advantage of the capability of UAVs to carry Wi-Fi Access Points (APs) or Long-Term Evolution (LTE) cells. Solutions relying on a Control Station (CS) capable of positioning the UAVs according to the users' traffic demands have been shown to improve the Quality of Service (QoS) provided by the network. However, they introduce important challenges regarding network routing.Recently, a solution was proposed to take advantage of the knowledge provided by a CS regarding how the network will change, by dynamically updating the forwarding tables before links in the flying network are disrupted, rather than recovering from link failure, as is the case in most of the existing routing protocols. Although it does not consider the impact of reconfigurations on the access network due to the mobility of the APs, it is a promising approach worthy of being improved and implemented in a real system.This dissertation focuses on implementing a routing solution for flying networks based on Software-Defined Networking (SDN). Specifically, it addresses the mobility management and network load balancing issues from a centralised perspective, while simultaneously enabling uninterruptible and broadband communications between ground users and the Internet, thus allowing UAVs to reposition and reconfigure themselves without interfering with the terminals' connections to the network

Proposta de um protocolo de roteamento autoconfigurável para redes mesh em Bluetooth Low Energy (BLE) baseado em proactive source routing

Orientador: Yuzo IanoTese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Elétrica e de ComputaçãoResumo: A Internet das Coisas (Internet of Things ¿ IoT) visa a criação de ambientes inteligentes como domótica, comunicação intra-veicular e redes de sensores sem fio (Wireless Sensor Network ¿ WSN), sendo que atualmente essa tecnologia vem crescendo de forma rápida. Uma das tecnologias sem fio utilizada para aplicações de curta distância que se encontra mais acessível à população, em geral, é o Bluetooth. No final de 2010, o Bluetooth Special Interest Group (Bluetooth SIG), lançou a especificação Bluetooth 4.0 e, como parte dessa especificação, tem-se o Bluetooth Low Energy (BLE). O BLE é uma tecnologia sem fio de baixíssimo consumo de potência, que pode ser alimentada por uma bateria tipo moeda, ou até mesmo por indução elétrica (energy harvesting). A natureza do Bluetooth (e BLE) é baseada na conexão do tipo Mestre/Escravo. Muitos estudos mostram como criar redes mesh baseadas no Bluetooth clássico, que são conhecidas como Scatternets, onde alguns nós são utilizados como escravos com o objetivo de repassar os dados entre os mestres. Contudo, o BLE não tinha suporte para a mudança entre mestre e escravo até o lançamento da especificação Bluetooth 4.1, em 2013. A capacidade de uma tecnologia sem fio para IoT de criar uma rede ad-hoc móvel (Mobile Ad-hoc Network ¿ MANET) é vital para poder suportar uma grande quantidade de sensores, periféricos e dispositivos que possam coexistir em qualquer ambiente. Este trabalho visa propor um novo método de autoconfiguração para BLE, com descoberta de mapa de roteamento e manutenção, sem a necessidade de mudanças entre mestre e escravo, sendo compatível com os dispositivos Bluetooth 4.0, assim como com os 4.1 e mais recentes. Qualquer protocolo de mensagens pode aproveitar o método proposto para descobrir e manter a topologia de rede mesh em cada um dos seus nósAbstract: Nowadays, the Internet of Things (IoT) is spreading rapidly towards creating smart environments. Home automation, intra-vehicular interaction, and wireless sensor networks (WSN) are among the most popular applications discussed in IoT literature. One of the most available and popular wireless technologies for short-range operations is Bluetooth. In late 2010, the Bluetooth Special Interest Group (SIG) launched the Bluetooth 4.0 Specification, which brings Bluetooth Low Energy (BLE) as part of the specification. BLE characterises as being a very low power wireless technology, capable of working on a coin-cell or even by energy scavenging. Nevertheless, the nature of Bluetooth (and BLE) has always been a connection-oriented communication in a Master/Slave configuration. Several studies exist showing how to create mesh networks for Classic Bluetooth, called Scatternets, by utilizing some nodes as slaves to relay data between Masters. However, BLE didn¿t support role changing until the 4.1 Specification released in 2013. The capability of a wireless technology to create a Mobile Ad-Hoc Network (MANET) is vital for supporting the plethora of sensors, peripherals, and devices that could coexist in any IoT environment. This work focuses on proposing a new autoconfiguring dynamic address allocation scheme for a BLE Ad-Hoc network, and a network map discovery and maintenance mechanism that doesn¿t require role changing, thus being possible to implement it in 4.0 compliant devices as well as 4.1 or later to develop a MANET. Any ad-hoc routing protocol can utilise the proposed method to discover, keep track, and maintain the mesh network node topology in each of their nodesDoutoradoTelecomunicações e TelemáticaDoutor em Engenharia ElétricaCAPE

LVMM: The Localized Vehicular Multicast Middleware - a Framework for Ad Hoc Inter-Vehicles Multicast Communications

This thesis defines a novel semantic for multicast in vehicular ad hoc networks (VANETs) and it defines a middleware, the Localized Vehicular Multicast Middleware (LVMM) that enables minimum cost, source-based multicast communications in VANETs. The middleware provides support to find vehicles suitable to sustain multicast communications, to maintain multicast groups, and to execute a multicast routing protocol, the Vehicular Multicast Routing Protocol (VMRP), that delivers messages of multicast applications to all the recipients utilizing a loop-free, minimum cost path from each source to all the recipients. LVMM does not require a vehicle to know all other members: only knowledge of directly reachable nodes is required to perform the source-based routing

Traffic engineering multi-layer optimization for wireless mesh network transmission a campus network routing protocol transmission performance inhancement

This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel UniversityThe wireless mesh network is a potential network for the future due to its excellent inherent characteristic for dynamic self-healing, self-configuration and self-organization. It also has the advantage of easy interoperability networking and the ability to form multi-linked ad-hoc networks. It has a decentralized topology, is cheap and highly scalable. Furthermore, its ease in deployment and easy maintenance are other inherent networking qualities. These aforementioned qualities of the wireless mesh network bring advantages to transmission capability of heterogeneous networks. However, transmissions in wireless mesh network create comparative performance based challenges such as congestion, load-balancing, scalability over increasing networks and coverage capacity. Consequently, these challenges and problems in the routing and switching of packets in the wireless mesh network routing protocols led to a proposal on the resolution of these failures with a combination algorithm and a management based security for the network and its transmitted packets. There are equally contentious services like reliability of the network and quality of service for real-time multimedia traffic flows with other challenges such as path computation and selection in the wireless mesh network. This thesis is therefore a cumulative proposal to the resolution of the outlined challenges and open research areas posed by using wireless mesh network routing protocol. It advances the resolution of these challenges in the mesh environment using a hybrid optimization – traffic engineering, to increase the effectiveness and the reliability of the network. It also proffers a cumulative resolution of the diverse contributions on wireless mesh network routing protocol and transmission. Adaptation and optimization are carried out on the wireless mesh network designed network using traffic engineering mechanism and technique. The research examines the patterns of mesh packet transmission and evaluates the challenges and failures in the mesh network packet transmission. It develops a solution based algorithm for resolutions and proposes the traffic engineering based solution.. These resultant performances and analysis are usually tested and compared over wireless mesh IEEE802.11n or other older proposed documented solution. This thesis used a carefully designed campus mesh network to show a comparative evaluation of an optimal performance of the mesh nodes and routers over a normal IEE802.11n based wireless domain network to show differentiation by optimization using the created algorithms. Furthermore, the indexes of performance being the metric are used to measure the utility and the reliability, including capacity and throughput at the destination during traffic engineered transmission. In addition, the security of these transmitted data and packets are optimized under a traffic engineered technique. Finally, this thesis offers an understanding to the security contribution using traffic engineering resolution to create a management algorithm for processing and computation of the wireless mesh networks security needs. The results of this thesis confirmed, completed and extended the existing predictions with real measurement

Application priority framework for fixed mobile converged communication networks

This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.The current prospects in wired and wireless access networks, it is becoming increasingly important to address potential convergence in order to offer integrated broadband services. These systems will need to offer higher data transmission capacities and long battery life, which is the catalyst for an everincreasing variety of air interface technologies targeting local area to wide area connectivity. Current integrated industrial networks do not offer application aware context delivery and enhanced services for optimised networks. Application aware services provide value-added functionality to business applications by capturing, integrating, and consolidating intelligence about users and their endpoint devices from various points in the network. This thesis mainly intends to resolve the issues related to ubiquitous application aware service, fair allocation of radio access, reduced energy consumption and improved capacity. A technique that measures and evaluates the data rate demand to reduce application response time and queuing delay for multi radio interfaces is proposed. The technique overcomes the challenges of network integration, requiring no user intervention, saving battery life and selecting the radio access connection for the application requested by the end user. This study is split in two parts. The first contribution identifies some constraints of the services towards the application layer in terms of e.g. data rate and signal strength. The objectives are achieved by application controlled handover (ACH) mechanism in order to maintain acceptable data rate for real-time application services. It also looks into the impact of the radio link on the application and identifies elements and parameters like wireless link quality and handover that will influence the application type. It also identifies some enhanced traditional mechanisms such as distance controlled multihop and mesh topology required in order to support energy efficient multimedia applications. The second contribution unfolds an intelligent application priority assignment mechanism (IAPAM) for medical applications using wireless sensor networks. IAPAM proposes and evaluates a technique based on prioritising multiple virtual queues for the critical nature of medical data to improve instant transmission. Various mobility patterns (directed, controlled and random waypoint) has been investigated and compared by simulating IAPAM enabled mobile BWSN. The following topics have been studied, modelled, simulated and discussed in this thesis: 1. Application Controlled Handover (ACH) for multi radios over fibre 2. Power Controlled Scheme for mesh multi radios over fibre using ACH 3. IAPAM for Biomedical Wireless Sensor Networks (BWSN) and impact of mobility over IAPAM enabled BWSN. Extensive simulation studies are performed to analyze and to evaluate the proposed techniques. Simulation results demonstrate significant improvements in multi radios over fibre performance in terms of application response delay and power consumption by upto 75% and 15 % respectively, reduction in traffic loss by upto 53% and reduction in delay for real time application by more than 25% in some cases

Rate-Adaptation Based Congestion Control for Vehicle Safety Communications

This thesis deals with the scalability of Vehicle Safety Communications (VSC), where vehicles exchange periodic status messages to support future driver assistance applications. We systematically develop a design methodology for congestion control in VSC and present a resulting protocol named PULSAR. While previous works typically focused on controlling channel load only, we thereby integrate a concept which allows the adaptation to operate within the limits defined by safety applications