Routing protocol Analysis for Heterogeneous Nodes in a Dynamic and Sparse Environment

Majority of the existing Delay Tolerant Network (DTN) routing protocols, attempt to minimize one of the popular DTN routing indices, i.e. message delay, forwarding count and storage. However, for many DTN applications such as distributing commercial content, targeting the best performance for one index and compromising the others is insufficient. A more practical solution would be to strike a balance between multiple of these indices. Gain Dissemination Protocol (GDP) is one of the protocols which targets this aim by introducing a gain concept which tries reach a maximum gain of delivery by keeping the balance between the value achieved via delivering the packet to the destination and the forwarding cost involved with that. In this paper, we focus on characterizing the GDP protocol in the scope of mobility. We also propose an upper bound for gain in multicast routing problem, i.e. the Union of Unicast Benchmark (UUB) and compare the performance of a few DTN routing protocols with the former. This eventually reveals the performance scope of a potential gain-aware DTN dissemination protocol.

VANETs is a rapid developed wireless mobile MANETs network with special challenge nature. It is a distributed and self-organized communication network based on moving vehicle. This network has characteristics like limited bandwidth, strong mobility, strong dynamic network topology, limited node degrees freedom, equipment capacity constraints and weak physical security. These characteristics usually make typical routing protocol in mobile MANET show a low efficiency in mobile VANETs, even fail. MANET routing algorithm is roughly divided into two categories, namely table driven routing protocol and on-demand routing protocol. It is due to the particularity of driving cars on the road. So how to improve network routing protocol in the performance is now a challenging problem. The purpose of this article studies network routing mechanism based on wireless vehicular networks simulation method. On the basis of analyzing the performance of typical routing protocols in MANET, such as DSDV, AODV and DSR, the improved scheme of AODV on-demand routing algorithm is put forward.

In recent years, several investigations have been made on "challenged network" [also known as, delay tolerant network (DTN)] architectures highlighting their advantages and disadvantages. In spite of its inherent shortcomings of unreliability and delay, smart-phone based opportunistic network is gaining immense popularity in the research community due to its applicability in different adverse and extreme communication scenarios where traditional communication infrastructure is either unavailable or incapacitated for a long time. Considerable research has been conducted till date to design efficient network architecture for emergency data dissemination in intermittently connected/challenged networks. Different architectures (ranging from flat to multi-tier) are proposed for implementing opportunistic DTN keeping in view of specific application requirements. However, very few of these proposed architectures have been examined from the perspective of a post disaster communication. Moreover, most DTN architectures are designed by aiming towards increasing delivery probability and reducing latency and as a whole, maximizing network throughput; with very little emphasis on its energy efficiency. The impact of different mobility patterns on existing DTN routing algorithms with respect to data dissemination and energy consumption has also not been studied so far. Our objective, in this paper, is to investigate the impact of different mobility patterns on existing DTN routing protocols and existing DTN architectures and subsequently, come up with a suitable energy efficient DTN framework combining suitable architecture and routing protocol that may be used to offer different disaster management services during post-disaster relief operation. We have done an extensive simulation on ONE simulator with different categories of well-known existing DTN architectures, mobility models, DTN routing protocols to study the network performance in terms of delivery probability, energy efficiency and overhead ratio. Based on the simulation results, we have tried to figure out a suitable combination of energy efficient architecture, mobility model and routing protocol that fits well in the post disaster communication scenario.

Hybrid delay tolerant network routing protocol for heterogeneous networks

Generic prediction assisted single-copy routing in underwater delay tolerant sensor networks

Node misbehavior due to selfish or malicious intention could significantly degrade the performance of MANET because most existing routing protocols in MANET are aiming at finding most efficiency path. To deal with misbehavior in MANET, an incentive mechanism should be integrated into routing decision-making. In this paper firstly we review existing techniques for secure routing, and then propose to use trust vector model based routing protocols. Each node would evaluate its own trust vector parameters about neighbors through monitoring neighbors’ pattern of traffic in network. At the same time, trust dynamics is included in term of robustness. Then we integrated trust model into Dynamic Source Routing (DSR) and Ad-hoc On Demand Distance Vector (AODV) which are most typical routing protocols in MANET. We evaluate the performance of those trust routing protocols by compar ing the simulation results of with and without the proposed trust mechanism . The simulation results demonstrate that modified routing protocols can effectively detect malicious nodes and mitigate their attacks.

A MANET is a self-motivated mobile wireless network that can be created exclusive of any former support. The challenge of MANET is to design robust routing algorithms which will satisfy all or few routing properties. Routing protocol in MANET can be categorized in various approaches depending upon network structure, communication model, routing strategy. Routing protocols can be further classified as proactive and reactive. Routing algorithms developed till today focused on the methods of routing. This article presents a survey of single /multipath routing algorithms, its advantages, and limitations. Researchers are attracted to rectify, design & develop concrete, routing algorithms which will fulfill the adequacy requirement of MANET users. This paper proposes the need robust routing protocol with security and energy efficient.

Objectives: It analyzed the simulation based study for impact of resource consumption attack on Signal-Stability Based Adapting (SSA) routing protocol in MANET. The performance of routing protocol is calculated by using these different parameters like throughput, Packet Delivery Ratio (PDR), end to end delay (E2E), routing overhead and energy consumption. Methods/ Statistical Analysis: The whole simulation is carried out through NS-2. NS-2 (Network Simulator version 2) is used for this simulation which is developed by UC Berkely. NS-2 is basically a combination of two languages OTcl and C++. Components of NS-2 are NAM (Network Animator), Proposing, Post prosing. NS-2 is a discrete event simulator in this C++ is easy to code but slower to run whereas OTcl is fast to run and difficult to code. Findings: We see the impact of this attack with three different performance metrics such as End to End, routing overhead, energy consumption throughput and packet delivery ratio (PDR).

SummaryIn Delay Tolerant Networks (DTNs), mobile nodes exploit encounter chances to transmit data via the established opportunistic link between encounter nodes. The transmission capacity between two encounter nodes is constrained by the duration of opportunistic links. How to transmit data efficiently is one of the fundamental and most important issues in DTNs. Recently, Random Linear Network Coding (RLNC) is proposed as a promising approach to improve data transmission efficiency in DTNs. To facilitate the development of deployment of RLNC based routing protocols, it is imperative to quantify the performance gain brought by RLNC in a rigorous and systematic way. In this paper, we develop an analytical model to evaluate the data transmission performance of RLNC based epidemic routing in DTNs. In the model, we consider that multiple unicast communication sessions compete for limited \capacity. Numerical results validate the effectiveness of our analytical model and demonstrate the significant performance improvement for data transmission in DTNs brought by RLNC. Our work of this paper provides a general tool for performance evaluation and useful guidelines for designing RLNC based routing protocols in DTNs. Copyright © 2015 John Wiley & Sons, Ltd.

Networks in which nodes are sparsely distributed and, therefore, are disconnected for long periods of time, are termed Delay Tolerant networks (DTN). The intermittent connection, together, with the limited resources of mobile nodes, mainly power and memory, created a challenging environment for data networking in DTN. Routing protocols developed for DTN tend to discover and select the minimum end-to-end delay paths to destinations assuming that these paths provide the highest delivery rate. To achieve this goal, they spread many copies of the same packet, ignoring the limitedness of storage space and power sources. In this paper, we study this problem by building a mathematical model for optimal routing in DTN. We compare the results of implementing three objectives for this model: minimizing the end-to-end delay, minimizing the end-to-end number of hops, and maximizing the delivered messages. We study and analyze the impact of varying the buffer space, the traffic load and the packets time-to-live (TTL) on the three objectives. Results show that minimizing the number of hops provides higher delivery ratio than minimizing the delay, which contradicts the previous assumption. In addition, minimizing the number of hops significantly reduces the number of transmissions which results in saving energy.

A Delay Tolerant Network (DTN) is a network capable of handling long delays and data loss efficiently in various challenged scenarios and environments. Owing to the mentioned challenges, it becomes crucial to study how the routing protocols are designed to adapt in such networks. Currently, the research in this domain is focused on the improving the data delivery ratio and minimizing delays in the routing protocols. This paper reviews state-of-the-art routing protocols for Delay Tolerant Networks (DTNs) as well as performs their comparative analysis. DTN routing protocols are grouped into four categories viz encounter based, time based, infrastructure based and hybrid & others. This categorization depends on the information they use for relay selection routing. We have also discussed some of the inherent drawbacks such as energy consumption, delivery rates and buffer constraints of the existing routing algorithms. We have also conducted an empirical analysis and observed the performance of the most popular existing algorithms of encounter and time based category. This paper offers a widespread study of the routing protocols with their pros and cons.

Designing routing protocols for Mobile Ad Hoc Networks MANETs is a complex task because of its dynamic topology. A kind of routing protocols that suits the particularity of MANETs is so-called bio-inspired. Among these, focused on Ant Colony Optimisation ACO, which studies the behaviour of ants in their search for food, are especially relevant. One of these algorithms is AntOR, which relying on swarm intelligence, efficiently solves routing in MANETs. In this paper we show a parallelised version of AntOR, the so-called P-AntOR, that using programming multiprocessor architectures based on shared memory protocol, allows to run tasks in parallel using threads, being applicable this parallelisation in the route discovery phase, route local repair process and link failure notification. The simulation results indicate that P-AntOR performs better than its predecessor, with emphasis on the metric of average End-To-End delay, jitter and packet delivery ratio.

The underwater acoustic channel features long and variable propagation delay, high bit error rate and limited bandwidth. Moreover, underwater mobile networks consisting of Autonomous Underwater Vehicles (AUVs) for surveillance and monitoring applications often suffer from intermittent connectivity as nodes move around the area of operations. Therefore, this scenario is appropriately modeled as a Delay-Tolerant Network (DTN). In this paper, we investigate two classes of DTN routing protocols: Spray-and-Wait (SNW) and the Resource Allocation Protocol for Intentional DTN (RAPID), together with a standard flooding protocol for underwater mobile networks, and their performance is analyzed in terms of packet delivery ratio, average end-to-end delivery delay and throughput, in different load conditions across various node mobility scenarios. Our results show that RAPID performs better than other DTN routing protocols in terms of packet delivery ratio at higher load conditions irrespective of node mobility, whereas the Binary version of SNW has the best performance in terms of average delivery delay.

Lots of routing protocols have been proposed in the literatures to overcome several challenges in ad hoc networks. The fundamental point we consider in this paper is that most of such protocols are generally based on the assumption that mobile nodes are functionally equivalent to each other in computing power and memory space. Moreover, all of the mobile nodes are required to use a common routing protocol to communicate with each other. However, such assumptions do not reflect the real world, even further the future oriented ubiquitous world. The ubiquitous paradigm requires networking technologies to support the heterogeneity including various capabilities to compute, amounts of storage, radio interfaces, patterns of mobility and others. In real scenario, for instance, some nodes may not want to relay packets for others owing to their power constraints. Also there might be nodes employing different routing protocols in a single communication zone. To cover some of these cases, this paper proposes a simple but efficient approach called HRPC (Heterogeneous Routing Protocol Coordinator) that works well in our previously proposed MANET architecture. HRPC is not a stand-alone routing protocol but a coordinating module for support bridging functionality between heterogeneous routing protocols in MANET. This paper also gives HRPC implementation and its demonstration results, where DYMO and OLSR routing protocols are used as an exemplified scenario to evaluate the operability of HRPC.

In a Delay Tolerant Network (DTN), the nodes have intermittent connectivity and complete path(s) between the source and destination may not exist. The communication takes place opportunistically when any two nodes enter the effective range. One of the major challenges in DTNs is message forwarding when a sender must select a best neighbor that has the highest probability of forwarding the message to the actual destination. However, finding an appropriate route remains an NP-hard problem. This paper presents a concept of Checkpoint (CP) based message forwarding in DTNs. The CPs are autonomous high-end wireless devices with large buffer storage and are responsible for temporarily storing the messages to be forwarded. The CPs are deployed at various places within the city parameter that are covered by bus routes and where human meeting frequencies are higher. For the simulative analysis a synthetic human mobility model in ONE simulator is constructed for the city of Fargo, ND, USA. The model is tested over various DTN routing protocols and the results indicate that using CP overlay over the existing DTN architecture significantly decreases message delivery time as well as buffer usage.