scholarly journals Point-to-Point Operation over LAN in Link State Routing Protocols

Author(s):  
Unung Verawardina

In a dynamic routing setting a routing protocol is required to perform the settings to find the shortest and best path. Routing protocols are of two types: vector distance and link state. Use of EIGRP routing that includes long-range vectors and link state OSPF Link link state coverage, peg well to be implemented in complex network because it can adapt well. In this research is the method used for routing and speed of time available EIGRP routing and OSPF routing through simulator GNS3 and wireshark application, then analyze the difference of peformance with speed of routing table and speed of time. While for Quality of Service (QoS) compare network service quality from EIGRP and OSPF routing which include delay, packet loss, and throughput. Based on the results of the research shows the EIGRP routing table is better in the selection path, EIGRP smaller time tansfer data then its data transfer faster than the OSPF. Overall Quality Of Service (Qos) delay, packetloss and throughput on EIGRP and OSPF are well balanced and good.


Author(s):  
Raad Alturki ◽  
Rashid Mehmood

The HCPR scheme is implemented as an extension to the OPNET simulation software and is analysed in detail for its QoS performance to deliver multimedia applications over ad hoc networks. It is compared with three well-known and widely used routing protocols: Ad Hoc On Demand Distance Vector (AODV), Optimised Link State Routing (OLSR), and Geographic Routing Protocol (GRP). Several networking scenarios have been carefully configured with variations in networks sizes, applications, codecs, and routing protocols to extensively analyse the proposed scheme. The HCPR enabled ad hoc network outperforms the well-known routing schemes, in particular for relatively large networks and high QoS network loads. These results are promising because many QoS schemes do work for small networks and low network loads but are unable to sustain performance for large networks and high QoS loads. Several directions to extend this research for future work are given.


2019 ◽  
Vol 11 (1) ◽  
pp. 18 ◽  
Author(s):  
Jinpeng Wang ◽  
Gérard Chalhoub ◽  
Michel Misson

Recently, mobility support has become an important requirement in various Wireless Sensor Networks (WSNs). Low-power and Lossy Networks (LLNs) are a special type of WSNs that tolerate a certain degree of packet loss. However, due to the strict resource constraints in the computation, energy, and memory of LLNs, most routing protocols only support static network topologies. Data collection and data dissemination are two basic traffic modes in LLNs. Unlike data collection, data dissemination is less investigated in LLNs. There are two sorts of data-dissemination methods: point-to-multipoint and point-to-point. In this paper, we focus on the point-to-point method, which requires the source node to build routes to reach the destination node. We propose an adaptive routing protocol that integrates together point-to-point traffic and data-collection traffic, and supports highly mobile scenarios. This protocol quickly reacts to the movement of nodes to make faster decisions for the next-hop selection in data collection and dynamically build routes for point-to-point traffic. Results obtained through simulation show that our work outperforms two generic ad hoc routing protocols AODV and flooding on different performance metrics. Results also show the efficiency of our work in highly mobile scenarios with multiple traffic patterns.


Author(s):  
Gimer Cervera ◽  
Michel Barbeau ◽  
Joaquin Garcia-Alfaro ◽  
Evangelos Kranakis
Keyword(s):  

2015 ◽  
Vol 2015 ◽  
pp. 1-18 ◽  
Author(s):  
Abdelfettah Belghith ◽  
Mohamed Belhassen ◽  
Amine Dhraief ◽  
Nour Elhouda Dougui ◽  
Hassan Mathkour

The presence of obstructing obstacles severely degrades the efficiency of routing protocols in MANETs. To mitigate the effect of these obstructing obstacles, routing in MANETs is usually based on thea prioriknowledge of the obstacle map. In this paper, we investigate rather the dynamic and autonomic detection of obstacles that might stand within the network. This is accomplished using the enhanced cartography optimized link state routing CE-OLSR with no extra signaling overhead. The evaluation of the performance of our proposed detection scheme is accomplished through extensive simulations using OMNET++. Results clearly show the ability of our proposed scheme to accurately delimit the obstacle area with high coverage and efficient precision ratios. Furthermore, we integrated the proposed scheme into CE-OLSR to make it capable of autonomously detecting and avoiding obstacles. Simulation results show the effectiveness of such an integrated protocol that provides the same route validity as that of CE-OLSR-OA which is based on thea prioriknowledge of the obstructing obstacle map.


Sign in / Sign up

Export Citation Format

Share Document