DREAM_OLSR PROTOCOL (Distance Routing Effective Algorithm for Mobility - Optimized Link State Routing) [PDF]
This paper lays down a proposal of protocol named DREAM_OLSR. The protocol has been developed so as to effect current OLSR (RFC 3626) [4] protocol. The protocol establishes an optimized solution hence the name has been manipulated from Open Link State Routing to DREAM Optimized Link State Routing.
Gurpreet Singh Saini+2 more
openalex +3 more sources
SECURITY ISSUES IN THE OPTIMIZED LINK STATE ROUTING PROTOCOL VERSION 2 (OLSRV2) [PDF]
Mobile Ad hoc NETworks (MANETs) are leaving the confines of research laboratories, to find place in real-world deployments. Outside specialized domains (military, vehicular, etc.), city-wide communitynetworks are emerging, connecting regular Internet users with each other, and with the Internet, via MANETs.
Ulrich Herberg, Thomas Clausen
openalex +2 more sources
An Efficient Routing Protocol for Quantum Key Distribution Networks [PDF]
Quantum key distribution (QKD) can provide point-to-point information-theoretic secure key services for two connected users. In fact, the development of QKD networks needs more focus from the scientific community in order to broaden the service scale of QKD technology to deliver end-to-end secure key services.
arxiv +1 more source
Modeling Routing Overhead Generated by Wireless Proactive Routing Protocols [PDF]
In this paper, we present a detailed framework consisting of modeling of routing overhead generated by three widely used proactive routing protocols; Destination-Sequenced Distance Vector (DSDV), Fish-eye State Routing (FSR) and Optimized Link State Routing (OLSR).
arxiv +1 more source
Towards LP Modeling for Maximizing Throughput and Minimizing Routing Delay in Proactive Protocols in Wireless Multi-hop Networks [PDF]
Wireless Multi-hop Networks (WMhNs) provide users with the facility to communicate while moving with whatever the node speed, the node density and the number of traffic flows they want, without any unwanted delay and/or disruption. This paper contributes Linear Programming models (LP_models) for WMhNs.
arxiv +1 more source
Routing Load of Route Calculation and Route Maintenance in Wireless Proactive Routing Protocols [PDF]
This paper presents mathematical framework and study of proactive routing Protocols. The performance analysis of three major proactive routing protocols: Destination-Sequenced Distance Vector (DSDV), Fish-eye State Routing (FSR) and Optimized Link State Routing (OLSR) are under consideration in this work. Taking these routing protocols into account, we
arxiv +1 more source
Entanglement Routing over Networks with Time Multiplexed Repeaters [PDF]
Quantum networks will be able to service consumers with long-distance entanglement by use of quantum repeaters that generate Bell pairs (or links) with their neighbors, iid with probability $p$ and perform Bell State Measurements (BSMs) on the links that succeed iid with probability $q$.
arxiv
Modeling and Evaluating Performance of Routing Operations in Proactive Routing Protocols [PDF]
To ensure seamless communication in wireless multi-hop networks, certain classes of routing protocols are defined. This vary paper, is based upon proactive routing protocols for Wireless multihop networks. Initially, we discuss Destination Sequence Distance Vector (DSDV), Fish-eye State Routing (FSR) and Optimized Link State Routing (OLSR), precisely ...
arxiv
Evaluating Wireless Proactive Routing Protocols under Scalability and Traffic Constraints [PDF]
In this paper, we evaluate and analyze the impact of different network loads and varying no. of nodes on distance vector and link state routing algorithms. We select three well known proactive protocols; Destination Sequenced Distance Vector (DSDV) operates on distance vector routing, while Fisheye State Routing (FSR) and Optimized Link State Routing ...
arxiv
Evaluating Wireless Proactive Routing Protocols under Mobility and Scalability Constraints [PDF]
Wireless Multi-hop Networks (WMhNs) provide users with the facility to communicate while moving with whatever the node speed, the node density and the number of traffic flows they want, without any unwanted delay and/or disruption. This paper contributes Linear Programming models (LP_models) for WMhNs.
arxiv