The design and performance evaluation of a proactive multipath routing protocol for mobile ad hoc networks

Due to unpredictable network topology changes, routing in Mobile Ad Hoc Networks (MANET) is an important and challenging research area. The routing protocol should detect and maintain a good route(s) between source and destination nodes in these dynamic networks. Many routing protocols have been proposed for mobile ad hoc networks, and none can be considered as the best under all conditions. This thesis presents the design and implementation of a new proactive multipath MANET routing protocol. The protocol, named Multipath Destination Sequenced Distance Vector (MDSDV), is based on the well known single path Destination Sequenced Distance Vector (DSDV). We show that the protocol finds node-disjoint paths, i.e., paths which do not have any nodes in common, except for the source and the destination. The thesis presents a systematic evaluation of MDSDV in comparison with three well known protocols: one proactive (DSDV), and two reactive (AODV) and (DSR). MDSDV behaves very well in terms of its packet delivery fraction and data dropped in both static and dynamic networks. It delivers nearly 100% of data in dense networks (networks with more than 20 nodes). The speed of the nodes and the number of sources have a low impact on its performance

Spatial Multipath Location Aided Routing

Mobile ad-hoc networks (MANETs) are infrastructure-free networks of mobile nodes that communicate with each other wirelessly. There are several routing schemes that have been proposed and several of these have been already extensively simulated or implemented as well. The primary applications of such networks have been in disaster relief operations, military use, conferencing and environment sensing. There are several ad hoc routing algorithms at present that utilize position information (usually in two dimensional terms) to make routing decisions at each node. Our goal is to utilize three-dimensional (3D) position information to provide more reliable as well as efficient routing for certain applications. We thus describe extensions to various location aware routing algorithms to work in 3D. We propose a new hierarchical, zone-based 3D routing algorithm, based on GRID by Liao, Tseng and Sheu. Our new algorithm called Hyper-GRID is a hybrid algorithm that uses multipath routing (alternate path caching) in 3D. We propose replacing LAR with Multipath LAR (MLAR) in GRID. We have implemented MLAR and are validating MLAR through simulation using ns-2 and studying its efficiency, scalability and other properties. We use a random waypoint mobility model and compare our MLAR approach versus LAR, AODV and AOMDV in both 2D and 3D for a range of traffic and mobility scenarios. Our simulation results demonstrate the performance benefits of MLAR over LAR and AODV in most mobility situations. AOMDV delivers more packets than MLAR consistently, but does so at the cost of more frequent flooding of control packets and thus higher bandwidth usage than MLAR

Predicting and Recovering Link Failure Localization Using Competitive Swarm Optimization for DSR Protocol in MANET

Portable impromptu organization is a self-putting together, major construction-less, independent remote versatile hub that exists without even a trace of a determined base station or government association. MANET requires no extraordinary foundation as the organization is unique. Multicasting is an urgent issue in correspondence organizations. Multicast is one of the effective methods in MANET. In multicasting, information parcels from one hub are communicated to a bunch of recipient hubs all at once, at a similar time. In this research work, Failure Node Detection and Efficient Node Localization in a MANET situation are proposed. Localization in MANET is a main area that attracts significant research interest. Localization is a method to determine the nodes’ location in the communication network. A novel routing algorithm, which is used for Predicting and Recovering Link Failure Localization using a Genetic Algorithm with Competitive Swarm Optimization (PRLFL-GACSO) Algorithm is proposed in this study to calculate and recover link failure in MANET. The process of link failure detection is accomplished using mathematical modelling of the genetic algorithm and the routing is attained using the Competitive Swarm optimization technique. The result proposed MANET method makes use of the CSO algorithm, which facilitates a well-organized packet transfer from the source node to the destination node and enhances DSR routing performance. Based on node movement, link value, and endwise delay, the optimal route is found. The main benefit of the PRLFL-GACSO Algorithm is it achieves multiple optimal solutions over global information. Further, premature convergence is avoided using Competitive Swarm Optimization (CSO). The suggested work is measured based on the Ns simulator. The presentation metrix are PDR, endwise delay, power consumption, hit ratio, etc. The presentation of the proposed method is almost 4% and 5% greater than the present TEA-MDRP, RSTA-AOMDV, and RMQS-ua methods. After, the suggested method attains greater performance for detecting and recovering link failure. In future work, the hybrid multiway routing protocols are presented to provide link failure and route breakages and liability tolerance at the time of node failure, and it also increases the worth of service aspects, respectively

Improving routing performance of multipath ad hoc on-demand distance vector in mobile add hoc networks.

The aim of this research is to improve routing fault tolerance in Mobile Ad hoc Networks (MANETs) by optimising mUltipath routing in a well-studied reactive and single path routing protocol known as Ad hoc On-demand Distance Vector (AODV). The research also aims to prove the effect of varying waiting time of Route Reply (RREP) procedure and utilising the concept of efficient routes on the performance of multipath extensions to AODV. Two novel multipath routing approaches are developed in this thesis as new extensions to AODV to optimise routing overhead by improving Route Discovery Process (RDP) and Route Maintenance Process (RMP) of multipath AODV. The first approach is a Iinkdisjoint multipath extension called 'Thresho)d efficient Routes in multipath AODV' (TRAODV) that optimises routing packets ~verhead by improving the RDP of AODV which is achieved by detecting the waiting time required for RREP procedure to receive a threshold number of efficient routes. The second approach is also a link-disjoint mUltipath extension called 'On-demand Route maintenance in Multipath AoDv' (ORMAD) which is an extension to TRAODV that optimises routing packets and delay overhead by improving the RMP of TRAODV. ORMAD applies the concepts of threshold waiting time and efficient routes to both phases RDP and RMP. It also applies RMP only to efficient routes which are selected in the RDP and when a route fails, it invokes a local repair procedure between upstream and downstream nodes of the broken link. This mechanism produces a set of alternative subroutes with less number of hops which enhances route efficiency and consequently minimises the routing overhead. TRAODV and ORMAD are implemented and evaluated against two existing multipath extensions to,AODV protocol and two traditional multipath protocols. The existing extensions to AODV used in the evaluation are a well-known protocol called Ad hoc On-demand Multipath Distance Vector (AOMDV) and a recent extension called Multiple Route AODV (MRAODV) protocol which is extended in this thesis to the new approach TRAODV while the traditional multipath protocols used in the evaluation are Dynamic Source Routing (DSR) and Temporally Ordered Routing Algorithm (TORA). Protocols are implemented using NS2 and evaluated under the same simulation environment in terms of four performance metrics; packet delivery fraction, average end-to-end delay, routing packets overhead, and throughput. Simulation results of TRAODV evaluation show that the average number of routes stored in a routing table of MRAODV protocol is always larger than the average number of routes in TRAODV. Simulation results show that TRAODV reduces the overall routing packets overhead compared to both extensions AOMDV and MRAODV, especially for large network size and high mobility. A vital drawback of TRAODV is that its performance is reduced compared to AOMDV and MRAODV in terms of average end-to-end delay. Additionally, TORA still outperforms TRAODV and the other extensions to AODV in terms of routing packets overhead. In order to overcome the drawbacks of TRAODV, ORMAD is developed by improving the RDP of TRAODV. The performance of ORMAD is evaluated against RREP waiting time using the idea of utilising the efficient routes in both phases RDP and RMP. Simulation results of ORMAD show that the performance is affected by varying the two RREP waiting times of both RDP and RMP in different scenarios. As shown by the simulation results, applying the short and long waiting times in both phases tends to less performance in terms of routing packets overhead while applying the moderate waiting times tends to better performance. ORMAD enhances routing packets overhead and the average end-to-end delay compared to TRAODV, especially in high mobility scenarios. ORMAD has the closest performance to TORA protocol in terms of routing packets overhead compared to ~M~a~M~OW . Relevant concepts are formalised for ORMAD approach and conducted as an analytical model in this thesis involving the\vhole process of multipath routing in AODV extensions. ORMAD analytical model describes how the two phases RDP and RMP interact with each other with regard to two performance metrics; total number of detected routes and Route Efficiency.EThOS - Electronic Theses Online ServiceGBUnited Kingdo

Implementation of Multipath and Multiple Description Coding in OLSR

In this paper we discussed the application and the implementation of multipath routing and multiple description coding (MDC) extension of OLSR, called MP-OLSR. It is based on the link state algorithm and employs periodic exchange of messages to maintain topology information of the networks. In the mean time, it updates the routing table in an on-demand scheme and forwards the packets in multiple paths which have been determined at the source. If a link failure is detected, the algorithm recovers the route automatically. Concerning the instability of the wireless networks, the multiple description coding is used to improve reliability of the network transmission, and several methods are proposed to allocate the redundancy in different paths. The simulation in NS2 shows that the new protocol can effectively improve the performance of the networks. The implementation of MP-OLSR is also proposed in the end

Mobile-IP ad-hoc network MPLS-based with QoS support.

The support for Quality of Service (QoS) is the main focus of this thesis. Major issues and challenges for Mobile-IP Ad-Hoc Networks (MANETs) to support QoS in a multi-layer manner are considered discussed and investigated through simulation setups. Different parameters contributing to the subjective measures of QoS have been considered and consequently, appropriate testbeds were formed to measure these parameters and compare them to other schemes to check for superiority. These parameters are: Maximum Round-Trip Delay (MRTD), Minimum Bandwidth Guaranteed (MBG), Bit Error Rate (BER), Packet Loss Ratio (PER), End-To-End Delay (ETED), and Packet Drop Ratio (PDR) to name a few. For network simulations, NS-II (Network Simulator Version II) and OPNET simulation software systems were used.Dept. of Electrical and Computer Engineering. Paper copy at Leddy Library: Theses & Major Papers - Basement, West Bldg. / Call Number: Thesis2005 .A355. Source: Masters Abstracts International, Volume: 44-03, page: 1444. Thesis (M.Sc.)--University of Windsor (Canada), 2005

Variable power transmission in highly Mobile Ad-Hoc Networks

Mobile Ad Hoc Networks pose challenges in terms of power control, due to their fixed transmission power, the mobility of nodes and a constantly changing topology. High levels of power are needed in wireless networks, particularly for routing. As a result of the increase in the number of communication devices being used, there is the challenge of increased density within these networks, and a need to extend the battery life of communication devices. In order to address this challenge, this thesis presents the development of a new protocol (Dynamic Power AODV), which is an enhancement of the Ad Hoc On Demand Distance Vector (AODV) protocol. The new protocol dynamically adjusts the transmission power based on the range, which depends on node density. This thesis provides a systematic evaluation of the performance of DP-AODV, in a high speed and high density environment, in comparison with three other routing protocols. The experiments demonstrated that DP-AODV performed better than two of the protocols in all scenarios. As compared to the third protocol (AOMDV), DP-AODV gave better performance results for throughput and Power Consumption, but AOMDV performed better in terms of Packet Delivery Fraction rate and End-to-End Delay in some cases

Ein dienstgütebasiertes Routingprotokoll für ein selbstorganisiertes Kommunikationsnetz

Mobile Ad-hoc Networks (MANETs) are characterized by two dimensions namely, anywhere and anytime. The freely moving participating nodes can form an ad hoc network anywhere, and the mobile nodes can join or leave the network anytime. A particular mobile node in a MANET can communicate with all the other nodes using the multihop communication. Thus, MANETs offer a vast range of applications in various domains like entertainment, military, emergency, etc. However, the implementation of real-time applications like voice/video calling that demands stringent quality requirements over MANETs is a major challenge. This challenge arises due to the unplanned and dynamic nature of MANETs, due to the unreliability of wireless links, due to the scarcity of resources like battery, bandwidth, processing power, due to the large-scale nature of MANETs, etc. This issue can be addressed at the network layer or the routing protocol, which establishes multiple routes from source to destination and adapts to the dynamicity of MANETs without compromising on the quality requirements. The primary goal of this work is the investigation and development of such a routing algorithm that supports real-time applications over MANETs. For adaptive multipath routing, we studied Ant Colony Optimization (ACO) algorithms originate from the fields of Swarm Intelligence (SI) while Quality of Service (QoS) computation is carried out by cleverly utilizing the monitoring feature of the Simple Network Management Protocol (SNMP). So, combining these two mechanisms we propose a powerful adaptive multipath QoS-aware Routing protocol based on ACO (QoRA). We discuss and investigate the internal working of QoRA and perform detailed simulation studies in the network simulator ns-3. Finally, we discuss the implementation of QoRA routing algorithms in a real world testbed.Mobile Ad-hoc-Netze (MANETs) ermöglichen eine Kommunikation überall zu jedem Zeitpunkt. Frei sich bewegende Knoten können überall ein solches Netz bilden, wobei die Teilnehmer zu jeder Zeit dem Netz beitreten oder es wieder verlassen können. Ein teilnehmender Knoten in einem MANET kommuniziert mit allen anderen über Multi-Hop-Kommunikation. So ermöglicht ein MANET viele unterschiedliche Anwendungen aus verschiedenen Domänen wie beispielsweise Unterhaltungskommunikation, Notfallkommunikation oder Einsatzkommunikation. Allerdings benötigen Echtzeitanwendungen wie Telefonie oder Videokommunikation eine stringente Kommunikationsdienstgüte, was für MANETs eine große Herausforderung darstellt. Diese Herausforderung hat viele Gründe: das dynamische und unvorhersehbare Verhalten der Knoten im MANET, die Unzuverlässigkeit der drahtlosen Kommunikation, die Beschränkung der zur Verfügung stehenden Kommunikationsressourcen (wie Batterielaufzeit, Bandbreite oder Prozessorleistung), die relativ große Abdeckung durch ein MANET. Die Herausforderung kann in der Vermittlungsschicht durch ein spezielles Routingprotokoll gelöst werden, das mehrere gleichzeitige Pfade von der Quelle zum Ziel verwendet, sodass die Dynamik in einem MANET Berücksichtigung findet ohne dass die Dienstgüte kompromittiert werden muss. Das vorrangige Ziel dieser Arbeit ist die Erforschung und Entwicklung eines solchen Routingverfahrens, das Echtzeitanwendungen in einem MANET unterstützt. Für das adaptive Mehrwegerouting wurde ein Ameisenalgorithmus (Ant Colony Optimization, ACO) angewendet, der das Prinzip der Schwarmintelligenz ausnutzt. Die Bestimmung der aktuell möglichen Kommunikationsdienstgüte erfolgt über die Informationen, die das Netzmanagementprotokoll Simple Network Management Protocol SNMP standardmäßig zur Verfügung stellt. Durch die Kombination dieser beiden Ansätze wurde das adaptive Mehrwegeroutingprotokoll "QoS-aware Routing Protocol based on ACO" (QoRA) vorgeschlagen. In der vorliegenden Dissertation werden das Konzept von QoRA vorgestellt und die interne Funktionsweise erläutert. Anhand umfangreicher Simulationen auf Basis des Simulationswerkzeug ns-3 werden die Vorteile des Verfahrens nachgewiesen. Den Abschluss bildet die Diskussion einer Implementierung von QoRA in einer realen Testumgebung