scholarly journals Performance Analysis and Evaluation of Hybrid Network using different Integrated Routing Protocols

2013 ◽  
Vol 11 (10) ◽  
pp. 3090-3100 ◽  
Author(s):  
Mr. Rajneesh Narula ◽  
Mr. Kaushal Gandhi
Keyword(s):  
Routing Protocol ◽  
Routing Protocols ◽  
High Performance ◽  
High Capacity ◽  
Network Routing ◽  
Distributed Applications ◽  
Routing Algorithms ◽  
Full Duplex ◽  
Hybrid Network ◽  
Multiple Networks

The increasing demand of computer communication networks are growing rapidly day by day. With the growing need to distribute applications across multiple networks and the availability of high capacity, high-performance intermediate switching nodes, and networks, an efficient routing mechanism has become the core requirement. This research primarily focuses on the design and performance of Hybrid Network incorporating different intra-domain routing algorithms. The performance evaluation of different routing algorithms for the transmission of video- and voice-data streams over Hybrid network is demonstrated in this work.. This allows multiple Ethernet point-to-point links to be bundled into one logical full-duplex channel for Fast Ethernet (10BaseT, 100BaseT, or 1000BaseX). These applications require some QoS support such as guaranteed bandwidth, less delay, less jittering effect and low error rate. The QoS relies on a number of factors along with a suite of robust routing protocols that help to accomplish the task of moving datagram from source to destination with high bandwidth and low delay rate. An effective intra-domain network routing protocol may make distributed applications more efficient across multiple networks with the availability of high capacity and high-performance. A variety of intra-domain routing protocols such as Routing Information Protocol (RIP) and Open Shortest First Protocol (OSPF), Interior Gateway Protocol (IGRP) and Enhanced Interior Gateway Protocol (EIGRP) are available and widely used in designing such high capacity and high performance networks with optimum QoS. We evaluate the performance of these intra-domain routing protocols with IS-IS to recommend the optimum routing protocol to use to provide optimum QoS by means of OPNET Simulator TM. In this thesis work, the following objectives are considered and demonstrated.

scholarly journals A Routing Algorithms for Resource Constrained Wireless Self-organized Networks

2017 ◽  
Vol 13 (11) ◽  
pp. 136
Author(s):  
Dan Han ◽  
Lingmei Fu
Keyword(s):  
Routing Protocol ◽  
Routing Protocols ◽  
Data Transmission ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Simulation Analysis ◽  
Network Routing ◽  
Routing Algorithms ◽  
Network Coverage ◽  
Self Organized

<p><span style="font-size: medium;"><span style="font-family: 宋体;">To explore the algorithms for wireless self-organized networks, through the NS-2 network simulation platform, the simulation analysis is made on the performances of multi hop data transmission  of the existing four typical Ad hoc network routing protocols. And the energy saving strategy of Ad hoc network routing protocol SFR (Selection Forwarding Routing) based on network average node connection degree is discussed and analyzed, which is suitable for intensive Ad hoc network. The simulation data showed that, SFR protocol can, under the premise of ensuring the network coverage rate the same as that of flooding  algorithm, reduce more than 56.1% redundant information in the network, and reduce the energy consumption of network by more than 30.2%. Finally, it is concluded that the selection forwarding routing has quite good performance.</span></span></p>

scholarly journals FCERP: A Novel WSNs Fuzzy Clustering and Energy Efficient Routing Protocol

2022 ◽  
Vol 6 (1) ◽  
pp. 31-42
Author(s):  
Zainab Alansari ◽  
Mohammed Siddique ◽  
Mohammed Waleed Ashour
Keyword(s):  
Fuzzy Clustering ◽  
Routing Protocol ◽  
Routing Protocols ◽  
Energy Efficient ◽  
Residual Energy ◽  
Routing Algorithms ◽  
Sensor Nodes ◽  
Energy Efficient Routing ◽  
Critical Issues ◽  
Energy Consuming

Wireless sensor networks (WSNs) are set of sensor nodes to monitor and detect transmitted data to the sink. WSNs face significant challenges in terms of node energy availability, which may impact network sustainability. As a result, developing protocols and algorithms that make the best use of limited resources, particularly energy resources, is critical issues for designing WSNs. Routing algorithms, for example, are unique algorithms as they have a direct and effective relationship with lifetime of network and energy. The available routing protocols employ single-hop data transmission to the sink and clustering per round. In this paper, a Fuzzy Clustering and Energy Efficient Routing Protocol (FCERP) that lower the WSNs energy consuming and increase the lifetime of network is proposed. FCERP introduces a new cluster-based fuzzy routing protocol capable of utilizing clustering and multiple hop routing features concurrently using a threshold limit. A novel aspect of this research is that it avoids clustering per round while considering using fixed threshold and adapts multi-hop routing by predicting the best intermediary node for clustering and the sink. Some Fuzzy factors such as residual energy, neighbors amount, and distance to sink considered when deciding which intermediary node to use.

scholarly journals Comparative Performance Analysis of Ad-Hoc Routing Protocol using NS-2 Simulator

2012 ◽  
pp. 50-54
Author(s):  
Prashant Rewagad ◽  
Nisha A. Lodha
Keyword(s):  
Routing Protocol ◽  
Routing Protocols ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Network Routing ◽  
Performance Comparison ◽  
Ad Hoc Routing ◽  
Comparative Performance ◽  
Mobile Ad Hoc

Mobile Ad hoc Network is a collection of mobile nodes in which the wireless links are frequently broken down due to mobility and dynamic infrastructure. Routing is a significant issue and challenge in ad hoc networks. In Mobile ad hoc network, due to mobility of nodes network topology change frequently and thus, routing become challenging task to transfer the data from source to destination. A variety of routing protocols with varying network conditions are analyzed to find an optimized route from a source to some destination. This paper is based on performance comparison of two popular mobile ad-hoc network routing protocols using simulator i.e. DSR, ADOV. On the network simulation platform, a systematically simulation and research has been carried out on the performance of two routing protocols, and how the network environments impact on the performance of routing protocol.

scholarly journals A Novel Algorithm for AODV to Enhance the Efficiency and Performance of the MANET

2021 ◽  
Vol 12 (4) ◽  
pp. 292-299
Author(s):  
Deepika J, Et. al.
Keyword(s):  
Routing Protocol ◽  
Routing Protocols ◽  
Research Study ◽  
Threshold Level ◽  
Network Routing ◽  
Critical Parameters ◽  
Network Parameter ◽  
Multiple Parameters ◽  
And Performance ◽  
Aodv Routing Protocol

Network security and performance are significant topics discussed in academic and Industrial research. Every application depends on the performance and efficiency of the network. Routing protocols and mechanisms play an essential role. AODV routing protocol is considered standard in many aspects, primarily due to the increasing efficiency requirements in various applications. There are different approaches in the literature trying to improve the performance. Some studies considered multiple parameters such as density and mobility of the data nodes. This research study evaluates the two critical parameters that contribute to the overall efficiency and performance of the network – throughput and route resilience. A new version of enhanced AODV is proposed in this paper that uses an iterative approach to check for each parameter and adjust the values accordingly until the required threshold level of efficiency is reached. The solution is explained in different categories pertaining to each network parameter. The proposed algorithm is simulated on a network tool, and the results show that the enhanced version of the routing protocol is promising and can be further extended to introduce new modes for higher efficiency and lower power consumption.

A Sensor Network Routing Protocol Based on Node Residual Energy

2013 ◽  
Vol 816-817 ◽  
pp. 1081-1084
Author(s):  
Ming Ni ◽  
Kai Guo Qian ◽  
Yong Gang Xie ◽  
Zu Cheng Dai
Keyword(s):  
Sensor Network ◽  
Routing Protocol ◽  
Routing Protocols ◽  
Simulation Experiment ◽  
Network Routing ◽  
Residual Energy ◽  
Wireless Sensor ◽  
Hidden Terminal ◽  
Protocol Performance ◽  
Performance Analysis And Simulation

This paper mainly discusses the problem of wireless sensor network routing protocols. The flooding routing protocol has disadvantages of hidden terminal, information implosion and emerging redundant packet copies which consume more node energy. A sensor network routing protocol based on node residual energy (RPBEN) is proposed and evaluated. The new protocol choices a small number of nodes that have maximum remaining energy as next hop routing nodes. It saves the energy by avoiding redundancy packet copies produced and improve the disadvantages of flooding routing protocol. Performance analysis and simulation experiment show that the new protocol effectively reduces the data redundancy, reduces the energy consumption and prolongs the network lifetime.

Sink Mobility Based and Energy Balancing Routing Protocol

2013 ◽  
Vol 380-384 ◽  
pp. 2177-2182
Author(s):  
Yu Fang Ma ◽  
Yan Li Wang
Keyword(s):  
Routing Protocol ◽  
Routing Protocols ◽  
Network Connectivity ◽  
Premature Death ◽  
Network Routing ◽  
Sensor Nodes ◽  
Monitoring Data ◽  
Sink Node ◽  
Energy Balancing ◽  
Virtual Cells

In the wireless sensor network routing protocol design, the sensor node monitoring data in multi-hop relay approach to sink node for transmission. For sink aggregation node fixed network, the nearby sink nodes of sensor nodes need to transfer other nodes of the monitoring data, consequently, it consumes large amounts of energy, and it's easy to premature death, making the network connectivity decline, even making the network intersected, shorten the lifetime of the network. In order to solve this problem, from the view of sink node, this thesis brings forward a protocol of SERP, which is a energy balancing routing protocol based on sink Mobility and prolongs the lifetime of network. It adopts the strategy of sink movement which makes the hot nodes inside the network take turns, balances the load among them. In SERP, firstly, the WSN deployment area is divided into finite Virtual cells ;Secondly ,we make the center of each virtual cell as the mobile position of sink node; at last, we confirm the residence time when sink node stays in each position through linear programming. Finally, the paper makes simulation al analysis aiming at above-mentioned routing protocols . The result shows that the inside node energy consumption is comparatively balanced and efficient, and the network lifetime is prolonged effectively.

A High-Performance Wireless Mesh Network Routing Protocol

2014 ◽  
Vol 513-517 ◽  
pp. 1705-1708
Author(s):  
Zuo Xue Liu ◽  
Jian Mei Dai ◽  
Yi Jun Sheng ◽  
Zi Fan Wang
Keyword(s):  
Routing Protocol ◽  
High Performance ◽  
Wireless Mesh Network ◽  
Ad Hoc ◽  
Network Routing ◽  
Mesh Network ◽  
Rapid Convergence ◽  
Wireless Mesh ◽  
Mobile Ad Hoc ◽  
Mesh Node

BATAMAN (Better Approach to Mobile Ad-hoc Networking) is a new wireless Mesh network protocol. The algorithm of BATMAN protocol was analyzed, the BATMAN protocol was designed based the embedded Linux and realized on the self-developed wireless Mesh node mounting multiple Wi-Fi modules. The pragmatic performance was test in the multi-hop Mesh prototype network. The result shows that: the characteristics of throughput and latency of BATMAN protocol which is lightweight, rapid convergence and efficient can meet the real-time and broadband transmission requirement of wireless Mesh network.

scholarly journals KAJIAN PERBANDINGAN PERFORMANSI ROUTING PROTOCOL RIPNG, OSPFV3 DAN EIGRPV6 PADA JARINGAN IPV6

Kilat ◽  
2018 ◽  
Vol 7 (1) ◽  
pp. 56-65
Author(s):  
Redaksi Tim Jurnal
Keyword(s):  
Real Time ◽  
Routing Protocol ◽  
Routing Protocols ◽  
Performance Testing ◽  
Video Stream ◽  
Network Routing ◽  
Transport Protocol ◽  
Network Simulator ◽  
Ipv6 Network ◽  
Better Than

The main purpose of IP next generation version 6 or called IPv6 is to meet the needs of IP addresses for the long term. With the presence of IPv6 it is also necessary routing protocol that supports IPv6 network. Routing protocols work to connect between networks, and choose paths or routes to reach other networks. There are three types of routing protocols that already support IPv6 services. Among other types of distance vector (RIPng), link-state (OSPFv3) and hybrid (EIGRPv6). This final project is designed to know the performance of the three types of routing protocols on IPv6 network. Testing is done by analyzing routing update process, ICMPv6 packet analysis and testing by sending Real-time Transport Protocol (RTP) packet in the form of audio video stream sent via server and accessed through client. In the simulation and analysis results using GNS3 (Graphic Network Simulator 3) and wireshark found that the OSPFv3 performance testing is better than EIGRPv6 and RIPng when performing routing updates or when link down occurs. Then the data analysis of test results with the delivery of Real-time Transport Protocol package so that it can be concluded that OSPFv3 algorithm better than EIGRPv6 and RIPng in terms of delay, packet loss, throughput and jitter.

scholarly journals Flaws in Endair-A Secure Routing Protocol for MANETS

2013 ◽  
pp. 287-292
Author(s):  
B. Swetha ◽  
S. Ajay Kumar ◽  
TVS Prasad Gupta
Keyword(s):  
Ad Hoc Networks ◽  
Routing Protocol ◽  
Routing Protocols ◽  
Ad Hoc ◽  
Network Routing ◽  
Secure Routing ◽  
Node Mobility ◽  
Ad Hoc Routing ◽  
Security Proof ◽  
Hoc Networks

Routing is the one of the essential criteria at network level in mobile ad hoc networks. Ad hoc network routing protocols are difficult to design, and secure because unable to handle rapid node mobility and network topology changes. It has been realized by many researchers, and several “secure” routing protocols have been proposed for ad hoc networks. However, the security of those protocols has mainly been analyzed by informal means only. In this paper, we argue that flaws in ad hoc routing protocols can be very subtle, and we advocate a more systematic way of analysis. This approach is based on the simulation paradigm, which has already been used extensively for the analysis of key establishment protocols, but to the best of our knowledge, it has not. A new ondemand source routing protocol, called endairA, and demonstrate the usage of our framework by proving security. It is analyzed and shown that the security proof for the route discovery algorithm, endairA is flawed due to hidden channel attack. To overcome this flaw of EndairA algorithm, we uses acknowledgement based reply to find a secured route which provides more security and overcomes the hidden channel attack in the existing approaches.

Effect of data packet size on the performance of RIP and OSPF routing protocols in hybrid networks

2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Neha Jain ◽  
Ashish Payal ◽  
Aarti Jain
Keyword(s):  
Shortest Path ◽  
Routing Protocol ◽  
Routing Protocols ◽  
Large Scale ◽  
Optimal Path ◽  
Data Packet ◽  
Hybrid Networks ◽  
Hybrid Network ◽  
Packet Size ◽  
Content Type

Purpose The purpose of this study is to calculate the effect of different packet sizes 256, 512, 1,024 and 2,048 bytes on a large-scale hybrid network and analysis and identifies which routing protocol is best for application throughput, application delay and network link parameters for different packet sizes. As the routing protocol is used to select the optimal path to transfer data packets from source to destination. It is always important to consider the performance of the routing protocol before the final network configuration. From the literature, it has been observed that RIP (Routing Information Protocol) and OSPF (Open Shortest Path First) are the most popular routing protocols, and it has always been a challenge to select between these routing protocols, especially for hybrid networks. The efficiency of routing protocol mainly depends on resulting throughput and delay. Also, it has been observed that data packet size also plays an essential role in determining the efficiency of routing protocol. Design/methodology/approach To analyse the effect of different packet sizes using two routing protocols, routing information protocol (RIP) and open shortest path first (OSPF) on the hybrid network, require detailed planning. Designing the network for simulate and then finally analysing the results requires proper study. Each stage needs to be understood well for work accomplishment. Thus, the network’s simulation and evaluation require implementing the proposed work step by step, saving time and cost. Here, the proposed work methodology is defined in six steps or stages. Findings The simulation results show that both routing protocols – RIP and OSPF are equally good in terms of network throughput for all different packet sizes. However, OSPF performs better in terms of network delay than RIP routing protocol in different packet size scenarios. Research limitations/implications In this paper, a fixed network of 125 objects and only RIP and OSPF routing protocol have been used for analysis. Therefore, in the future, a comparison of different network sizes can be considered by increasing or decreasing the number of objects in the proposed network. Furthermore, the other routing protocols can be used for performance evaluation on the same proposed network. Originality/value The analysis can be conducted by simulation of the network, enabling us to develop a network environment without restricting the selection of parameters as it minimizes cost, network deployment overhead, human resources, etc. The results are analysed, calculated and compared for each packet size on different routing protocol networks individually and the conclusion is made.

Sign in / Sign up

Export Citation Format

Share Document