Distributed Path Computation without Transient Loops: An Intermediate Variables Approach

Paths with loops, even transient ones, pose significant stability problems in networks. As a result, much effort has been devoted over the past thirty years to designing distributed algorithms capable of avoiding loops. We present a new algorithm, Distributed path computation with Intermediate Variables (DIV), that guarantees that no loops, transient or steady-state, can ever form. DIV’s novelty is in that it is not restricted to shortest paths, can easily handle arbitrary sequences of changes and updates, and provably outperforms earlier approaches in several key metrics. In addition, when used with distance-vector style path computation algorithms, DIV also prevents counting-to-infinity; hence further improving convergence. The paper introduces DIV and its key properties. Simulation quantifying its performance gains are also presented

Performance comparison of AODV, DSDV and EE-DSDV routing protocol algorithm for wireless sensor network

This paper describes a preliminary study on wireless sensor network (WSN) routing protocol algorithm with focus on energy saving strategy.Efficient energy saving and consumption will ensure the lifespan of the battery are prolonged and the delay of transmitting data will be within the acceptable range of 300 meter by 300 meter network size.The routing protocol Ad-hoc On Demand Distance Vector (AODV), Destination Sequence Distance Vector (DSDV) and Energy Efficient Destination Sequence Distance Vector (EE-DSDV) were used in the study to compare the performance of the network in terms of maximum delay, throughput receive as well as the remaining energy in the network

Cancellation of Glauber gluon exchange in the double Drell-Yan process

An essential part of any factorisation proof is the demonstration that the exchange of Glauber gluons cancels for the considered observable. We show this cancellation at all orders for double Drell-Yan production (the double parton scattering process in which a pair of electroweak gauge bosons is produced) both for the integrated cross section and for the cross section differential in the transverse boson momenta. In the process of constructing this proof, we also revisit and clarify some issues regarding the Glauber cancellation argument and its relation to the rest of the factorisation proof for the single Drell-Yan process.Comment: 65 pages, 23 figure

The LLN On-demand Ad hoc Distance-vector Routing Protocol - Next Generation (LOADng)

This document describes the LLN Ad hoc On-Demand (LOAD) distance vector routing protocol - Next Generation, a reactive routing protocol intended for use in Low power Lossy Networks (LLN). The protocol is derived from AODV and extended for use in LLNs.Ce document décrit le protocole de routage "distance vector" LOAD - Next Generation (LLN Ad hoc On-Demand). Il s'agit d'un protocole réactif qui s'adresse aux réseaux á faible puissance et fort taux de perte (Low power and Lossy Networks, LLNs). Il est dérivé d'AODV et a été modifié de maniére à répondre aux besoin de tels réseaux

A Survey on Anonymous On-Demand Routing Protocols for MANETs

At present Mobile ad hoc networks (MANET) is used in many real time applications and hence such networks are vulnerable to different kinds of security threats. MANET networks suffered more from security attacks due to use of free wireless communication frequency spectrum and dynamic topology. Therefore it becomes very tough to provide security to MANET under different adversarial environments like battlefields. For MANET, anonymous communications are vital under the adversarial environments, in which the identification of nodes as well as routes is replaced by pseudonyms or random numbers for the purpose of protection. There are many protocols presented for anonymous communication security for MANET, which hide node identities and routes from exterior observers in order to provide anonymity protection. This paper presents review of various anonymous on demand routing protocols

Clone Detection for Efficient System in WSN using AODV

Wireless sensor is wide deployed for a spread of application, starting from surroundings observance to telemedicine and objects chase, etc. For value effective sensing element placement, sensors are usually not tamperproof device and are deployed in places while not observance and protection, that creates them at risk of fully different attacks. As an example, a malicious user may compromise some sensors and acquire their private information. Then, it?ll duplicate the detectors and deploy clones in an exceedingly wireless sensor network (WSN) to launch a spread of attack that?s mentioned as clone attack. Because the duplicated sensors have an equivalent information, e.g., code and crypto graphical information, captured from legitimate sensors that may merely participate in network operation and launch attacks. Because of the low value for sensing components duplication and preparation, clone attacks became one in all the foremost essential security issues in WSNs. Thus, it?s essential to effectively detect clone attacks therefore to ensure healthy operation of WSNs