Performance Research of an Improved Hybrid Routing Protocol

In order to provide various services with different quality requirements, the current Internet is expected to turn into a QoS based Internet under the Differentiated Service (DiffServ) architecture. A variety of works have been done in the field of constraint based routing to provide QoS guaranteed or assured services by developing novel routing protocols and algorithms. However, most of these efforts focus on intra-domain routing rather than inter-domain routing. In this paper, we discuss issues of finding routes with QoS requirements among multiple domains, called inter-domain QoS routing. We first investigate the needs and problems faced when introducing inter-domain QoS routing into the Internet. Then, we present a model for inter-domain QoS routing and describe its building blocks. Finally, we present five mechanisms for operating inter-domain QoS routing in DiffServ networks.KeywordsResource InformationBorder Gateway ProtocolSignaling EntityRout EntityRoute ComputationThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Named Data Networking (NDN) need routing to build NDN systems. Similar IP protocol, NDN has routing protocols intra-domain and inter-domain routing protocol. Named-data Link State Routing (NLSR) is one of the NDN intra-domain routing protocols in NDN. Deployment NLSR on actual hardware and operating systems give more performance feedback which might not be obtained in a simulation. This paper explain how a NLSR work and performance use Ubuntu installed as NDN router.

An unmanned aerial vehicle communication Networks (UAVCN) is a group of UAVs (unmanned aerial vehicles) that is able to communicate and trigger information to each other for a particular mission. This network node is power limited. However, the routing mechanism should be improved which extend the lifetime and performance of UAV nodes. This manuscript intends to introduce a concept of a cross-layer method for efficient power and routing for UAVCN to increase communication performance. The cross-layer methodology integrates the physical, link and network layer. An efficient power optimized link state routing (EP-OLSR) protocol is proposed which is an extension to optimized link state routing (OLSR) protocol. The proposed routing protocol evaluated by developing scenarios of UAVCN in OPNET modeler 14.5. The simulation is carried out by implementing OLSR and EP-OLSR using different network parameters and compared the routing protocols performance. The results showed that the EP-OLSR maximizes network performance efficiency as compared to OLSR. It minimizes the delay and maximizes the throughput and increases the network performance.

Wireless Sensor Networks (WSNs) being special type of wireless communication networks, characterized via various specific features like Limited Memory, Energy, Less Processing power. In Wireless Sensor Networks, every sensor node actively participates in routing work by forwarding the packets from sender to receiver and the packet forwarding is entirely based on network topology. One of the most important issue surrounding WSNs is Energy Efficiency and Efficient Routing mechanism which should be dynamic and efficient enough to handle changing topologies. So, there is utmost need for optimization techniques which can lay the foundation of development of suitable routing protocol to attain energy efficiency and routing in sensor networks. Swarm Intelligence is one the most important technique which is highly considered for developing energy efficient routing protocols. Considering Swarm Intelligence, Ant Colony Optimization (ACO) technique is utilized to propose Energy Efficient protocol for WSN. In this paper, a Novel Energy Efficient Routing Protocol based on ACO for WSN is proposed i.e. IEEMARP (Improvised Energy Efficient Multipath Ant Based Routing Protocol). Hardcore testing of protocol proposed i.e. IEEMARP is done in different simulation scenarios using NS-2 simulator on varied parameters like Packet Delivery Ratio, Throughput, Routing Overhead, Energy Consumption and End-To-End Delay and performance is compared with other routing protocols like Basic ACO, DSDV, DSR, ACEAMR, Ant Chain, EMCBR and IACR. The results states that IEEMARP is almost 7 to 10 times better in different parameters. It has also been observed that IEEMARP routing protocol is also efficient in transmitting TCP packets.

Inter-domain routing protocol routes network reachability information between autonomous systems (ASs) in the network. Network reachability information contains the details about the neighbors of the ASs and it contains messages used to maintain the connection between ASs. On one hand, given the size and the rapid growth of the Internet, any inter-domain routing protocol should satisfy basic desirable algorithmic properties, such as scalability, robustness and rapid convergence by Griffin, T., and Wilford, G. 1999. On the other hand, for economic reasons inter-domain routing should support policy routing, where Internet service providers (ISPs) have the flexibility to implement a wide variety of private routing policies that ISPs choose not to reveal. Moreover, the routing protocol should provide sufficient information to enable ISPs to make informed policy decisions. Border gateway protocol (BGP) by Goodell, G. et al. (2003) is the inter-domain routing protocol that is currently being used. BGP has a number of problems which includes scalability and large convergence time by Labovitz, C et al. (2000). This paper explains in detail the alternative to BGP which is the hybrid optimized link-state path-vector routing protocol (HLP) [1] and gives a comparison based on the simulation of these protocols. The comparison shows us that HLP overcomes some of the important problems faced in BGP.

Interference is an inherent characteristic of wireless (multihop) communications. Adding interference-awareness to important control functions, e.g., routing, could significantly enhance the overall network performance. Despite some initial efforts, it is not yet clearly understood how to best capture the effects of interference in routing protocol design. Most existing proposals aim at inferring its effect by actively probing the link. However, active probe measurements impose an overhead and may often misrepresent the link quality due to their interaction with other networking functions. Therefore, in this paper we follow a different approach and: 1) propose a simple yet accurate analytical model for the effect of interference on data reception probability, based only on passive measurements and information locally available at the node; 2) use this model to design an efficient interference-aware routing protocol that performs as well as probing-based protocols, yet avoids all pitfalls related to active probe measurements. To validate our proposal, we have performed experiments in a real testbed, setup in our indoor office environment. We show that the analytical predictions of our interference model exhibit good match with both experimental results as well as more complicated analytical models proposed in related literature. Furthermore, we demonstrate that a simple probeless routing protocol based on our model performs at least as good as well-known probe-based routing protocols in a large set of experiments including both intraflow and interflow interference.

Mobile Ad hoc Network (MANET) is the kind of ad hoc networks that dynamically form a temporary network by connecting the mobile nodes without any support of central administration and wires. This work coins the difficulties of delivering the data packets to the MANET circumstance in a reliable fashion and in good timely manner, which reside to be a highly dynamic in nature. In MANET, there are several routing algorithms, which consume topology information to make routing decisions at each node. Practical routing protocols must handle intermittent connectivity and the absence of end-to-end connections. An Efficient Position-Based Opportunistic Routing (EPOR) protocol is proposed and it will be able to take the advantage of stateless property, which uses two terms (1) geographic routing (2) broadcast nature of wireless medium. When the packet transmission starts, neighbor nodes have chance to overhear the transmission of messages, and it will act as a forwarding candidate. Thus, the node which was overheard the transmission information will forward the packets by enhancing the informations. The apt forwarder will identify the falsely relay node within a limited amount of time. The proposed algorithm removes the drawbacks of the existing GPSR and AOMDV. The additional latency occurred by the local route recovery has maximum being reduced and the duplicate relaying due to packet reroute can also be decreased. The proposed scheme of Virtual Destination-based Void Handling (VDVH) combined with EPOR protocol in a communication hole. The EPOR result demonstrates that can able to succeed the greater performance even under high mobility of nodes with considerable overhead and the new VDVH scheme also works well. This paper focuses on various performance evaluation metrics such as latency, throughput for the EPOR routing protocols and experimentally compared the performance of three routing protocols using NS-2 simulator.

A mobile ad hoc network (MANET) is a network that consists of mobile wireless terminals without the aid of the base station. It is expected that MANETs are utilized for various purpose such as traffic jam information announce for vehicles and safety confirmation system in the disaster. Each MANET uses a routing protocol adaptive for the purpose of use. Therefore, utilizing the common routing protocol for multiple MANETs is difficult, and each MANET uses a different routing protocol. In this paper, we propose an Autonomous Clustering based Inter-Domain Routing protocol to communicate between different MANETs. Because of the autonomous clustering, the proposed inter-domain routing scheme can adaptively change the network gateways between MANETs according to the network topology change.

Multi-hop routing protocol in cognitive radio mobile ad hoc networks (CRMANETs) is a critical issue. Furthermore, the routing metric used in multi-hop CRMANETs should reflect the bands availability, the links quality, the PU activities and quality of service (QoS) requirements of SUs. For the best of our knowledge, many of researchers investigated the performance of the different routing protocols in a homogeneous environment only. In this paper, we propose a heterogeneous cognitive radio routing protocol (HCR) operates in heterogeneous environment (i.e. the route from source to destination utilize the licensed and unlicensed spectrum bands). The proposed routing protocol is carefully developed to make a tradeoff between the channel diversity of the routing path along with the CRMANETs throughput. Using simulations, we discuss the performance of the proposed HCR routing protocol and compare it with the AODV routing protocol using a discrete-event simulation which we developed using JAVA platform.

Growing use of vehicles in the city has increased the number of accidents and reduced the safety level to the passengers. Alerting drivers about the condition of road, traffic and related aspect is crucial to safety and for the regulation of vehicle flow. To achieve this in timely manner, an accurate information is needed. So an efficient, robust and scalable VANET (Vehicular Ad-hoc Network) routing protocol will play a key role to achieve this. This protocol have a potential to protect the generation by incorporating the new generation wireless network into vehicle. This paper represent a fitness based VANET routing protocol, which is operable in dynamic network conditions and compatible with both communication modes like V-I (vehicle-Infrastructure) and V-V (vehicle-vehicle) communication. It also focuses on both multi-path and single-path in the multi hop routing based on delay sensitive and delay non-sensitive data in a dense and sparse environment. It also provide a cost-efficient, intelligent routing strategy by sending a safety packet delivery assurance by optimally measuring the fitness in terms of distance, moving direction and link quality metric in V-V and V-I communication. The performance of our proposed protocol is evaluated by Ns2 simulator. The proposed protocol is compared to existing protocols like AODV (Ad-hoc On demand Distance Vector Routing), GPSR (Greedy Perimeter Stateless Routing) and prove the safety and efficiency of our protocol in term of Road Safety Assurance, and Packet Delivery Ratio.

Unmanned aerial vehicle is one of the main announced use cases of 5G/IMT2020, which is expected to have various applications in many fields. These devices have limited capabilities in terms of energy and processing. Due to the complex structure of unmanned aerial vehicle networks and the high mobility constraints, design of efficient routing protocol, for supporting such network, is a challenge. Thus, efficient routing of data among unmanned aerial vehicles between source and destination is an important issue in designing unmanned aerial vehicle networks. Proactive routing protocols are one of the main categories of routing protocols developed for mobile ad hoc networks and vehicular ad hoc networks. Optimized link state routing protocol is one of the most common proactive routing protocols that has been modified to support unmanned aerial vehicle networks, considering high mobility feature of the network. In this work, we propose a latency and energy-efficient proactive routing protocol for dense unmanned aerial vehicle networks, with high-density devices, based on optimized link state routing protocol algorithm, referred to as multi-objective optimized link state routing protocol. The proposed routing protocol is topology aware and can be used for low-latency and high-mobility applications. The proposed multi-objective optimized link state routing protocol routing algorithm considers all modified versions of optimized link state routing protocol and introduces a novel method for selecting multipoint relay nodes that considers the traffic load on the communication channel and the load on each unmanned aerial vehicle node. Moreover, the proposed algorithm considers the communication link stability and the energy constraints. The system is simulated over a reliable environment for various scenarios, and it is compared to the original optimized link state routing protocol and its modified versions. Simulation results indicate that the proposed protocol achieves higher efficiency in terms of latency, energy, and reliability.

The advancements of diverse radio technologies and emerging applications have spawned increasing heterogeneity in mobile ad hoc networks (MANETs). But the collaborative nature of communications and operations often requires that these heterogeneous MANETs to be interoperable. Nonetheless, the existing interconnection protocols designed for the Internet (namely inter-domain routing protocol such as BGP) are not adequate for handling the unique challenges in MANETs. In this paper, we present a novel Inter-MANET Routing protocol called InterMR that can handle the heterogeneity and dynamics of MANETs. Our first contribution is an Inter-MANET address scheme based on a variety of node attributes (e.g., symbolic name, property, etc.); this allows dynamic merging/split of network topologies without a separate Name Server. Our second contribution is to provide a seamless routing mechanism across heterogeneous MANETs without modifying the internal routing mechanisms in each MANET. The proposed scheme can transparently adapt to topological changes due to node mobility in MANETs by dynamically assigning the gateway functionalities. We show, by packet-level simulation, that the performance of InterMR can be improved by up to 112% by adaptive gateway assignment functionalities. We also show that InterMR is scalable with only modest overhead by analysis.

New protocols for Internet inter-domain routing struggle to get widely adopted. Because the Internet consists of more than 50,000 autonomous systems (ASes), deployment of a new routing protocol has to be incremental. In this work, we study such incremental deployment. We first formulate the routing problem in regard to a metric of routing cost. Then, the paper proposes and rigorously defines a statistical notion of protocol ignorance that quantifies the inability of a routing protocol to accurately determine routing prices with respect to the metric of interest. The proposed protocol-ignorance model of a routing protocol is fairly generic and can be applied to routing in both inter-domain and intra-domain settings, as well as to transportation and other types of networks. Our model of protocol deployment makes our study specific to Internet inter-domain routing. Through a combination of mathematical analysis and simulation, we demonstrate that the benefits from adopting a new inter-domain protocol accumulate smoothly during its incremental deployment. In particular, the simulation shows that decreasing the routing price by 25% requires between 43% and 53% of all nodes to adopt the new protocol. Our findings elucidate the deployment struggle of new inter-domain routing protocols and indicate that wide deployment of such a protocol necessitates involving a large number of relevant ASes into a coordinated effort to adopt the new protocol.

Partial backwards routing protocol for VANETs

Nowadays attacks against the routing infrastructure are gaining an impressive importance, Therefore, approaches to network security and reliability must take into account effects of routing protocols attacks and consequently must consider techniques to protect the network infrastructure. However, in spite of an increasing attention by scientists and practitioners to this issue, there is still a lack of experimental quantitative studies on the effects of routing attacks. To cope with these deficiencies, in this work we present a framework to conduct experimental analysis of routing attacks, and to prove its usefulness we study three attacks against routing protocols: route flapping on RIP, Denial of Service on OSPF by means of the Max Age attack and, finally, route forcing on RIP. We present a qualitative analysis and a performance analysis that aims to quantify the effects of routing protocol attacks with respect to routers resources and network traffic over controlled test beds.