Latest News on Routing Protocol Research: Nov – 2019

On-demand multicast routing protocol

This paper presents a completely unique multicast routing protocol for mobile unintended wireless networks. The protocol, termed ODMRP (on-demand multicast routing protocol), may be a mesh-based, instead of a traditional tree-based multicast theme and uses a forwarding cluster thought (only a set of nodes forwards the multicast packets via scoped flooding). It applies on-demand procedures to dynamically build routes and maintain multicast cluster membership. ODMRP is well matched for unintended wireless networks with mobile hosts wherever information measure is proscribed, topology changes oft, and power is forced. we have a tendency to assess ODMRP’s quantifiability and performance via simulation. [1]

Optimized Link State Routing Protocol (OLSR)

This document describes the Optimized Link State Routing (OLSR) protocol for mobile impromptu networks. The protocol is associate degree improvement of the classical link state algorithmic rule tailored to the necessities of a mobile wireless computer network. The key construct utilized in the protocol is that of multipoint relays (MPRs). MPRs are elect nodes that forward broadcast messages throughout the flooding method. this system considerably reduces the message overhead as compared to a classical flooding mechanism, wherever each node retransmits every message once it receives the primary copy of the message. In OLSR, link state data is generated solely by nodes electoral as MPRs. Thus, a second improvement is achieved by minimizing the amount of management messages flooded within the network. As a 3rd improvement, associate degree MPR node could selected to report solely links between itself and its MPR selectors. Hence, as contrary to the classic link state algorithmic rule, partial link state data is distributed within the network. [2]

An efficient routing protocol for wireless networks

We gift the Wireless Routing Protocol (WRP). In WRP, routing nodes communicate the space and secondto-last hop for every destination. WRP reduces the quantity of cases during which a short lived routing loop will occur, that accounts for its quick convergence properties. an in depth proof of correctness is given and its performance is compared by simulation with the performance of the distributed Bellman-Ford formula (DBF), twin (a loop-free distance-vector algorithm) and a perfect Link-state formula (ILS), that represent the state of the art of web routing. The simulation results indicate that WRP is that the best of the alternatives analyzed. [3]

Label-based routing for a family of small-world Farey graphs

We introduce associate informative labelling technique for vertices during a family of Farey graphs and deduce a routing rule on all the shortest methods between any 2 vertices in Farey graphs. The label of a vertex consists of the precise locating position in graphs and also the actual time linking to graphs. All the shortest methods routing between any combine of vertices, that range is strictly the merchandise of 2 Fibonacci numbers, are determined solely by their labels and also the time complexness of the rule is O(n). it’s the primary rule to work out all the shortest methods between any combine of vertices during a quite settled graphs. [4]

A Comparative Analysis of Jellyfish Attacks and Black Hole Attack with Selfish Behavior Attack under AODV Routing Protocol

The applications of mobile adhoc network (MANET) ar increasing day-by-day thanks to the flexibleness they supply to seamless communication. but MANETS ar at risk of variety of attacks due to properties like non-existing infrastructure, dynamic topology, multihop network etc. ton of previous works have targeted on the impact of assorted attack on routing protocol. Some attacks like jellyfish attack even follow all the foundations and rules of routing protocol then conjointly they’ll cause injury to the communication. On the opposite hand, some attacks like blackhole attack have malicious intentions and causes destruction by dropping the sent packets. There conjointly exist one different class of attack known as ungenerous node attack that don’t causes any destruction by modifying the sphere of the packet rather they are doing not join forces in forwarding the packet. during a typical painter situation which can be in use for jiffy or perhaps hours, the offensive node can have time to intervene in to the routing method, and ready to create some destruction. [5]

Reference

[1] Lee, S.J., Gerla, M. and Chiang, C.C., 1999, September. On-demand multicast routing protocol. In WCNC. 1999 IEEE Wireless Communications and Networking Conference (Cat. No. 99TH8466) (Web Link)

[2] Clausen, T., Jacquet, P., Adjih, C., Laouiti, A., Minet, P., Muhlethaler, P., Qayyum, A. and Viennot, L., 2003. Optimized link state routing protocol (OLSR). (Web Link)

[3] Murthy, S. and Garcia-Luna-Aceves, J.J., 1996. An efficient routing protocol for wireless networks. Mobile Networks and applications, 1(2), (Web Link)

[4] Label-based routing for a family of small-world Farey graphs
Yinhu Zhai & Yinhe Wang
Scientific Reports volume 6, Article number: 25621 (2016) (Web Link)

[5] Singla, B., Verma, A. K. and Raheja, L. R. (2017) “A Comparative Analysis of Jellyfish Attacks and Black Hole Attack with Selfish Behavior Attack under AODV Routing Protocol”, Journal of Advances in Mathematics and Computer Science, 21(2), (Web Link)