Virtual Router Approach For Wireless Ad Hoc Networks

Wireless networks have become increasingly popular in recent years. There are two variations of mobile wireless networks: infrastructure mobile networks and infrastructureless mobile networks. The latter are also known as mobile ad hoc network (MANET). MANETs have no fixed routers. Instead, mobile nodes function as relay nodes or routers, which discover and maintain communication connections between source nodes and destination nodes for various data transmission sessions. In other words, an MANET is a self-organizing multi-hop wireless network in which all nodes within a given geographical area participate in the routing and data forwarding process. Such networks are scalable and self-healing. They support mobile applications where an infrastructure is either not available (e.g., rescue operations and underground networks) or not desirable (e.g., harsh industrial environments). In many ad hoc networks such as vehicular networks, links among nodes change constantly and rapidly due to high node speed. Maintaining communication links of an established communication path that extends between source and destination nodes is a significant challenge in mobile ad hoc networks due to movement of the mobile nodes. In particular, such communication links are often broken under a high mobility environment. Communication links can also be broken by obstacles such as buildings in a street environment that block radio signal. In a street environment, obstacles and fast moving nodes result in a very short window of communication between nodes on different streets. Although a new communication route can be established when a break in the communication path occurs, repeatedly reestablishing new routes incurs delay and substantial overhead. To address this iv limitation, we introduce the Virtual Router abstraction in this dissertation. A virtual router is a dynamically-created logical router that is associated with a particular geographical area. Its routing functionality is provided by the physical nodes (i.e., mobile devices) currently within the geographical region served by the virtual router. These physical nodes take turns in forwarding data packets for the virtual router. In this environment, data packets are transmitted from a source node to a destination node over a series of virtual routers. Since virtual routers do not move, this scheme is much less susceptible to node mobility. There can be two virtual router approaches: Static Virtual Router (SVR) and Dynamic Virtual Router (DVR). In SVR, the virtual routers are predetermined and shared by all communication sessions over time. This scheme requires each mobile node to have a map of the virtual routers, and use a global positioning system (GPS) to determine if the node is within the geographical region of a given router. DVR is different from SVR with the following distinctions: (1) virtual routers are dynamically created for each communication sessions as needed, and deprecated after their use; (2) mobile nodes do not need to have a GPS; and (3) mobile nodes do not need to know whereabouts of the virtual routers. In this dissertation, we apply Virtual Router approach to address mobility challenges in routing data. We first propose a data routing protocol that uses SVR to overcome the extreme fast topology change in a street environment. We then propose a routing protocol that does not require node locations by adapting a DVR approach. We also explore how the Virtual Router Approach can reduce the overhead associated with initial route or location requests used by many existing routing protocols to find a destination. An initial request for a destination is expensive v because all the nodes need to be reached to locate the destination. We propose two broadcast protocols; one in an open terrain environment and the other in a street environment. Both broadcast protocols apply SVR. We provide simulation results to demonstrate the effectiveness of the proposed protocols in handling high mobility. They show Virtual Router approach can achieve several times better performance than traditional routing and broadcast approach based on physical routers (i.e., relay nodes

A practical approach to network-based processing

The usage of general-purpose processors externally attached to routers to play virtually the role of active coprocessors seems a safe and cost-effective approach to add active network capabilities to existing routers. This paper reviews this router-assistant way of making active nodes, addresses the benefits and limitations of this technique, and describes a new platform based on it using an enhanced commercial router. The features new to this type of architecture are transparency, IPv4 and IPv6 support, and full control over layer 3 and above. A practical experience with two applications for path characterization and a transport gateway managing multi-QoS is described.Most of this work has been funded by the IST project GCAP (Global Communication Architecture and Protocols for new QoS services over IPv6 networks) IST-1999-10 504. Further development and application to practical scenarios is being supported by IST project Opium (Open Platform for Integration of UMTS Middleware) IST-2001-36063 and the Spanish MCYT under projects TEL99-0988-C02-01 and AURAS TIC2001-1650-C02-01.Publicad

Implementation and evaluation of the sensornet protocol for Contiki

Sensornet Protocol (SP) is a link abstraction layer between the network layer and the link layer for sensor networks. SP was proposed as the core of a future-oriented sensor node architecture that allows flexible and optimized combination between multiple coexisting protocols. This thesis implements the SP sensornet protocol on the Contiki operating system in order to: evaluate the effectiveness of the original SP services; explore further requirements and implementation trade-offs uncovered by the original proposal. We analyze the original SP design and the TinyOS implementation of SP to design the Contiki port. We implement the data sending and receiving part of SP using Contiki processes, and the neighbor management part as a group of global routines. The evaluation consists of a single-hop traffic throughput test and a multihop convergecast test. Both tests are conducted using both simulation and experimentation. We conclude from the evaluation results that SP's link-level abstraction effectively improves modularity in protocol construction without sacrificing performance, and our SP implementation on Contiki lays a good foundation for future protocol innovations in wireless sensor networks

New Mobility Trends in Data Networks

Dizertační práce se zabývá návrhem nového algoritmu řízení handoveru v rámci protokolu Mobile IPv6, který umožní nasazení tohoto protokolu v leteckých datových sítích. Existující algoritmy řízení handoveru sice dosahují dostatečné výkonnosti v konvenčních pozemních bezdrátových sítích disponujích velkou šířkou pásma a nízkou latencí, jako jsou WiFi nebo UMTS, ale jak ukazuje tato práce, nasazení těchto algoritmů prostředí leteckých datových sítí nepřináší očekávané výhody. Analýza ukazuje, že v úzkopásmových leteckých sítích trpí tyto algoritmy řízení handoveru velkou latencí a způsobují značnou režii. Nový algoritmus řízení handoveru v MIPv6 navržený v této práci je založený na jednoduché myšlence: ''Já jsem letadlo, já vím, kam letím!'' To znamená, že pohyb letadla není náhodný, ale vysoce předvídatelný. Díky tomu je možno předvídat handovery mezi přístupovými sítěmi podél očekávané trajektorie letadla a vykonat nezbytné operace pro přípravu handoverů již na zemi, kde je letadlo připojeno k širokopásmové síti letiště. Tato dizertační práce dále uvádí porovnání existujících algoritmů řízení handoveru s nově navrženým pomocí analytické metody ohodnocení handoveru. Díky tomu je možno kvantifikovat výhody, které nový algoritmus přináší a taktéž popsat slabiny algoritmů existujících.The doctoral thesis is focused on a design of novel Mobile IPv6 handover strategy suitable for deployment in aeronautical data networks. The current handover strategies provide sufficient performance in the conventional ground networks such as WiFi or UMTS that dispose high bandwidth and low latency. However, as this thesis shows, deploying these handover strategies in aeronautical data link environment does not bring desired benefits - the handover latency is high and the related overhead gets high as well. The novel MIPv6 handover strategy presented in this thesis is based on a simple thought: ''I am an aircraft, I know where I'm flying!'' This means that the movement of the aircraft is not random, it is highly predictable. Thanks to that, inter-network handovers may be anticipated and necessary IP handover related actions can be taken in advance, while the aircraft is connected via a broadband ground link at the origination airport. The thesis also presents a comparison of the existing handover strategies with the proposed new one conducted using an analytical approach. This allows to quantify the benefits of the novel handover strategy and the drawbacks of the current ones.

Intelligent based Packet Scheduling Scheme using Internet Protocol/Multi-Protocol Label Switching (IP/MPLS) Technology for 5G. Design and Investigation of Bandwidth Management Technique for Service-Aware Traffic Engineering using Internet Protocol/Multi-Protocol Label Switching (IP/MPLS) for 5G

Multi-Protocol Label Switching (MPLS) makes use of traffic engineering (TE) techniques and a variety of protocols to establish pre-determined highly efficient routes in Wide Area Network (WAN). Unlike IP networks in which routing decision has to be made through header analysis on a hop-by-hop basis, MPLS makes use of a short bit sequence that indicates the forwarding equivalence class (FEC) of a packet and utilises a predefined routing table to handle packets of a specific FEC type. Thus header analysis of packets is not required, resulting in lower latency. In addition, packets of similar characteristics can be routed in a consistent manner. For example, packets carrying real-time information can be routed to low latency paths across the networks. Thus the key success to MPLS is to efficiently control and distribute the bandwidth available between applications across the networks. A lot of research effort on bandwidth management in MPLS networks has already been devoted in the past. However, with the imminent roll out of 5G, MPLS is seen as a key technology for mobile backhaul. To cope with the 5G demands of rich, context aware and multimedia-based user applications, more efficient bandwidth management solutions need to be derived. This thesis focuses on the design of bandwidth management algorithms, more specifically QoS scheduling, in MPLS network for 5G mobile backhaul. The aim is to ensure the reliability and the speed of packet transfer across the network. As 5G is expected to greatly improve the user experience with innovative and high quality services, users’ perceived quality of service (QoS) needs to be taken into account when deriving such bandwidth management solutions. QoS expectation from users are often subjective and vague. Thus this thesis proposes the use of fuzzy logic based solution to provide service aware and user-centric bandwidth management in order to satisfy requirements imposed by the network and users. Unfortunately, the disadvantage of fuzzy logic is scalability since dependable fuzzy rules and membership functions increase when the complexity of being modelled increases. To resolve this issue, this thesis proposes the use of neuro-fuzzy to solicit interpretable IF-THEN rules.The algorithms are implemented and tested through NS2 and Matlab simulations. The performance of the algorithms are evaluated and compared with other conventional algorithms in terms of average throughput, delay, reliability, cost, packet loss ratio, and utilization rate. Simulation results show that the neuro-fuzzy based algorithm perform better than fuzzy and other conventional packet scheduling algorithms using IP and IP over MPLS technologies.Tertiary Education Trust Fund (TETFUND

Air Traffic Management Abbreviation Compendium

As in all fields of work, an unmanageable number of abbreviations are used today in aviation for terms, definitions, commands, standards and technical descriptions. This applies in general to the areas of aeronautical communication, navigation and surveillance, cockpit and air traffic control working positions, passenger and cargo transport, and all other areas of flight planning, organization and guidance. In addition, many abbreviations are used more than once or have different meanings in different languages. In order to obtain an overview of the most common abbreviations used in air traffic management, organizations like EUROCONTROL, FAA, DWD and DLR have published lists of abbreviations in the past, which have also been enclosed in this document. In addition, abbreviations from some larger international projects related to aviation have been included to provide users with a directory as complete as possible. This means that the second edition of the Air Traffic Management Abbreviation Compendium includes now around 16,500 abbreviations and acronyms from the field of aviation

The Pull Paradigm : foundations of user-centric advanced driver assistant systems based on bidirectional car2X communication

This thesis develops applications for vehicular ad-hoc networks that go far beyond the currently established areas of driving safety and traffic efficiency. The ad-hoc network is regarded as a dynamic information resource which is available to any vehicle at any time. In contrast to current state-of-the-art research, the proposed Pull Paradigm starts at the user\u27s vehicle rather than at an information source somewhere in the network, e.g. a braking car. To access information from highly dynamic ad-hoc networks, bidirectional communication and information discovery and retrieval play a vital role. Therefore, in the course of the work, the applicability of the Pull Paradigm to established vehicular ad-hoc networks is thoroughly examined and missing aspects are identified. It turns out that a number of enhancements to almost all layers of the network stack are necessary in order to apply the Pull Paradigm using existing technology. The central elements here are two novel algorithms for managing information flow and dissemination in ad-hoc networks, which are at first formulated from the abstract perspective of graph theory. Using the knowledge gained leads to the development of PADE, a platform that supports development of vehicular ad-hoc network applications. The designed algorithms are then implemented as a routing scheme, integrated and evaluated in large, simulated city scenarios. Furthermore, PADE combines real\u27\u27 and simulated communication technologies and abstracts from them, so that applications can be transferred from the lab into a test vehicle with minimal effort. In order to achieve this ambitious goal, PADE builds on a number of existing simulation and communication technologies. The practical applicability of the Pull approach is shown in two demonstrators that are integrated into a BMW 5 series test vehicle. The presentation module of the PADE platform was tested in the currently largest field operational test for vehicular ad-hoc communication. Over 400 drivers in 120 vehicles experienced the system on a daily basis.In dieser Doktorarbeit werden Anwendungen für Fahrzeug Ad-hoc Netzwerke erarbeitet, die weit über die derzeit etablierten Bereiche der Fahrsicherheit und Verkehrseffizienz hinausgehen. Das Ad-hoc Netzwerk wird dabei als dynamische Informationsressource angesehen, die jedem Fahrzeug zu jedem Zeitpunkt zur Verfügung steht. Im Gegensatz zum derzeitigen Stand der Forschung geht das vorgestellte Pull Paradigma vom Fahrzeug des Benutzers und nicht von der Informationsquelle aus, z.B. einem bremsenden Fahrzeug. Für den Zugriff auf Informationen aus hochdynamischen Ad-hoc Netzen, spielen bidirektionale Kommunikation, Informationssuche und -rücktransport eine entscheidende Rolle. Im Verlauf der Arbeit wird deshalb die Anwendbarkeit des Pull Paradigmas auf etablierte Fahrzeug Ad-hoc Netze untersucht und fehlende Aspekte identifiziert. Es zeigt sich, dass eine Reihe an Erweiterungen auf fast allen Ebenen des Netzwerkstapels nötig sind damit die bestehende Technologie um das Pull Paradigma erweitert werden kann. Zentraler Punkt hierbei sind zwei neuartige Algorithmen zur Informationsverwaltung und -verbreitung in Ad-hoc Netzwerken die zunächst abstrakt aus Sicht der Graphentheorie formuliert werden. Mit Hilfe der gewonnenen Erkenntnisse wird PADE, eine Plattform zur Entwicklung von Anwendungen für Fahrzeug Ad-hoc Netze, entwickelt. Die entworfenen Algorithmen werden dann als Routingverfahren im Netzwerkstapel realisiert, in diesen integriert und auf großflächigen Stadtszenarien im Simulator evaluiert. Des Weiteren vereint PADE echte\u27\u27 und simulierte Kommunikationstechnologien und abstrahiert von diesen, sodass Anwendungen mit minimalem Aufwand vom Labor in ein Testfahrzeug überführt werden können. Um dieses ambitionierte Ziel zu erreichen, wird auf einer Reihe bereits bestehender Simulations- und Kommunikationstechnologien aufgebaut. Die praktische Anwendbarkeit des Pull Paradigmas wird anschließend in zwei Demonstratoren implementiert und in ein BMW 5er Testfahrzeug integriert. Das Präsentationsmodul der PADE Plattform wurde im derzeit weltgrößten Feldversuch für Fahrzeug Ad-hoc Kommunikation von über 400 Fahrern in 120 Fahrzeugen im Alltag getestet