Security Aware Routing Protocol for Hybrid Wireless Network (SARP-HWNs) via Trust Enhanced Mechanism

2019 ◽  
Vol 15 (1) ◽  
pp. 34-57 ◽  
Author(s):  
A. Vinodh Kumar ◽  
S. Kaja Mohideen
Keyword(s):  
Wireless Network ◽  
Routing Protocols ◽  
Life Time ◽  
Hybrid Networks ◽  
Hybrid Network ◽  
Link Failure ◽  
Security Model ◽  
Mobile Nodes ◽  
Link Failures ◽  
Hybrid Wireless Network

A hybrid wireless network handles both ad hoc networks and infrastructure networks, these networks are affected by malicious attacks which affect the routing by packet drops, modifications and selective forwarding. These attacks lead to the link failure in a network. Link failures are the main reason for packet loss and network unreliability in these kinds of networks. Due to link failures, the life time of the network and the performance of routing path is affected. The previous security mechanisms for protecting wireless networks are not sufficient for hybrid networks. In this article, the authors propose a trust-based security model to enhance security factors in hybrid networks. The proposed routing protocols implemented in hybrid network platforms consist of different networks such as a fixed node for WLANs (wireless televisions, personal computers, printers, cellular, etc.) with zero mobility, a sensor node for WSNs with zero mobility, mobile nodes with movements considered MANETs, and nodes with high movements (vehicles) considered as VANETs. This article proposes routing protocols to avoid link failure in the current routing path and provide quick recovery, improve the throughput, reduce end to end delay, maximize the life time of routing path without affecting energy consumption and QoS/QoE while compared with other existing techniques.

Software-Defined Networking Switches for Fast Single-Link Failure Recovery

2018 ◽  
Vol 18 (04) ◽  
pp. 1850014
Author(s):  
DAWEI LI ◽  
JIE WU ◽  
DAJIN WANG ◽  
JIAYIN WANG
Keyword(s):  
Network Topology ◽  
Routing Protocols ◽  
Shortest Paths ◽  
Software Defined Networking ◽  
Failure Recovery ◽  
Link Failure ◽  
Fast Recovery ◽  
Link Failures ◽  
Single Link

In this paper, we consider IP fast recovery from single-link failures in a given network topology. The basic idea is to replace some existing routers with a designated switch. When a link fails, the affected router will send all the affected traffic to the designated switch (through pre-configured IP tunnels), which will deliver the affected traffic to its destination without using the failed link. The goal of the approach is to achieve faster failure recovery than traditional routing protocols that employ reactive computing upon link failures. Software-Defined Networking (SDN) switches can serve as the designated switches because they can flexibly redirect affected traffic to other routes, instead of only to the shortest paths in the network. However, SDN switches are very expensive. Our objective is to minimize the number of SDN switches needed and to guarantee that the network can still recover from any single-link failure. For networks with uniform link costs, we show that using normal non-SDN switches with IP tunneling capability as designated switches can guarantee recovery from any single-link failure. For networks with general link costs, we find that not all single-link failures can be recovered by using non-SDN switches as designated switches; by using SDN switches only when necessary, we can reduce the total number of SDN switches needed compared to an existing work. We conduct extensive simulations to verify our proposed 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.

scholarly journals Discovery Routing Time Speed Comparison of AODV, OLSR and ZRP protocols on MANET

2020 ◽  
Vol 3 (3) ◽  
pp. 100-106
Author(s):  
Ery Safrianti ◽  
Linna Oktaviana Sari ◽  
Tulus Rahayu
Keyword(s):  
Wireless Network ◽  
Network Topology ◽  
Routing Protocol ◽  
Routing Protocols ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Mobile Nodes ◽  
Zone Routing Protocol ◽  
Hoc Networks

Mobile Ad hoc Network (MANET) is a wireless network that contains a collection of nodes without infrastructure and interconnected to communicate. MANET works dynamically when a group of nodes moves spontaneously, so the network topology can change quickly and cannot be predicted. It causes changes in wireless network topology according to existing conditions. The node functions in determining the route to be selected. Ad Hoc networks have limited transmission range, so routing is needed to send data over the network. The problem with mobile nodes is that routing must provide a path when the node changes. The speed of a node obtaining information is affected by the routing protocol used in the network. Each routing protocol has different capabilities in network speed, so the discovery routing time for each routing is also different. The selected routing protocols are Ad Hoc On-Demand Distance Vector (AODV), Optimized Link-state (OLSR), and Zone Routing Protocol (ZRP). The study will conduct a comparative analysis of ad hoc network initialization speeds on AODV, OLSR, and ZRP routing protocols. The parameter tested is the speed of routing discovery. After the data is collected, an analysis is carried out by looking at the routing discovery speed of each routing protocol. The test results show that each of the routing protocols examined, the AODV routing protocol, has a faster routing discovery time than the OLSR and ZRP routing protocols.

scholarly journals EVALUATING PERFORMANCE OF HYBRID NETWORKS BY USING LATENCY AND PDV

2013 ◽  
pp. 72-76
Author(s):  
ANUSHRI DIXIT ◽  
JINAL KOTHARI ◽  
ASHWINIKSHIRSAGAR ASHWINIKSHIRSAGAR ◽  
PROF. RAJESH KOLTE
Keyword(s):  
Routing Protocol ◽  
Routing Protocols ◽  
Performance Metrics ◽  
Packet Delay ◽  
Hybrid Networks ◽  
Hybrid Network ◽  
Simulation Tool ◽  
Different Types ◽  
Packet Tracer ◽  
Delay Variation

Hybrid networks are widely used in networking sector. They combine the finest features of both Wired and Wireless networks to give optimum results. Using different types of routing protocols, the capabilities of a hybrid network will be demonstrated using certain performance metrics. In this paper, we will be simulating real-time scenarios of three networks of different sizes. Each of these networks will be implemented with single routing protocol i.e. Enhanced Interior Gateway Routing Protocol (EIGRP). The networks will be simulated using Cisco Packet Tracer simulation tool. Furthermore, we have evaluated the performance of the networks by considering performance metrics like network latency and packet delay variation.

scholarly journals ANALYSIS OF ROUTING PROTOCOLS IN FLYING WIRELESS NETWORKS

2019 ◽  
Vol 01 (03) ◽  
pp. 148-160
Author(s):  
Krishnaraj Natarajan
Keyword(s):  
Wireless Networks ◽  
Energy Consumption ◽  
Wireless Network ◽  
Routing Protocol ◽  
Routing Protocols ◽  
Life Time ◽  
Self Healing ◽  
Centralized Control ◽  
Network Life Time

The wireless network that are formed on the fly, without relying on the previous infrastructure, including the autonomous devices that lie nearby are called the flying wireless networks. Despite of the networks, self-configuring and self-healing nature, it incurs many challenges due to its mobile nature, limited battery span and the lack of the centralized control, so these wireless network requires a perfect routing protocol addressing the challenges and improving the performance of the network, so the paper presents the survey on the various routing protocols that enhances the performance of the flying wireless network. The survey is further continued with the analysis of the routing protocols to evince the capability of the same on the grounds of network life time, energy consumption and the quality of service.

Simulation Analysis of Routing Protocols in Hybrid wireless network

2018 ◽  
Vol 50 (001) ◽  
pp. 165-170
Author(s):  
K. H. MOHAMMADANI ◽  
S. ABBASI ◽  
N. A. MEMON ◽  
Z. A. BHUTTO ◽  
I. R. MEMON
Keyword(s):  
Wireless Network ◽  
Routing Protocols ◽  
Simulation Analysis ◽  
Hybrid Wireless Network

scholarly journals Efficient MAC Protocol for Hybrid Wireless Network with Heterogeneous Sensor Nodes

2016 ◽  
Vol 2016 ◽  
pp. 1-16 ◽  
Author(s):  
Md. Nasre Alam ◽  
Young-Chon Kim
Keyword(s):  
Wireless Network ◽  
Mac Protocol ◽  
Directional Antenna ◽  
Mac Protocols ◽  
Sensor Nodes ◽  
Hybrid Network ◽  
Medium Access ◽  
Omnidirectional Antenna ◽  
Hybrid Wireless Network ◽  
Directional Medium Access Control

Although several Directional Medium Access Control (DMAC) protocols have been designed for use with homogeneous networks, it can take a substantial amount of time to change sensor nodes that are equipped with an omnidirectional antenna for sensor nodes with a directional antenna. Thus, we require a novel MAC protocol for use with an intermediate wireless network that consists of heterogeneous sensor nodes equipped with either an omnidirectional antenna or a directional antenna. The MAC protocols that have been designed for use in homogeneous networks are not suitable for use in a hybrid network due to deaf, hidden, and exposed nodes. Therefore, we propose a MAC protocol that exploits the characteristics of a directional antenna and can also work efficiently with omnidirectional nodes in a hybrid network. In order to address the deaf, hidden, and exposed node problems, we define RTS/CTS for the neighbor (RTSN/CTSN) and Neighbor Information (NIP) packets. The performance of the proposed MAC protocol is evaluated through a numerical analysis using a Markov model. In addition, the analytical results of the MAC protocol are verified through an OPNET simulation.

On Number of Planes of Rearrangeably Nonblocking Optical Banyan Networks with Link Failures

2008 ◽  
Vol 1 (1) ◽  
pp. 43-54
Author(s):  
Basra Sultana ◽  
Mamun-ur-Rashid Khandker
Keyword(s):  
Optical Switching ◽  
Blocking Probability ◽  
Link Failure ◽  
Link Failures ◽  
Small Depth ◽  
Internal Link ◽  
Banyan Network ◽  
Minimum Number ◽  
Switch Design ◽  
Banyan Networks

Vertically stacked optical banyan (VSOB) networks are attractive for serving as optical switching systems due to the desirable properties (such as the small depth and self-routing capability) of banyan network structures. Although banyan-type networks result in severe blocking and crosstalk, both these problems can be minimized by using sufficient number of banyan planes in the VSOB network structure. The number of banyan planes is minimum for rearrangeably nonblocking and maximum for strictly nonblocking structure. Both results are available for VSOB networks when there exist no internal link-failures. Since the issue of link-failure is unavoidable, we intend to find the minimum number of planes required to make a VSOB network nonblocking when some links are broken or failed in the structure. This paper presents the approximate number of planes required to make a VSOB networks rearrangeably nonblocking allowing link-failures. We also show an interesting behavior of the  blocking  probability of a faulty VSOB networks that the blocking probability may not  always  increase monotonously with  the  increase  of  link-failures; blocking probability  decreases  for  certain range of  link-failures, and then increases again. We believe that such fluctuating behavior of blocking probability with the increase of link failure probability deserves special attention in switch design.  Keywords: Banyan networks; Blocking probability; Switching networks; Vertical stacking; Link-failures. © 2009 JSR Publications. ISSN: 2070-0237(Print); 2070-0245 (Online). All rights reserved. DOI: 10.3329/jsr.v1i1.1070

Sign in / Sign up

Export Citation Format

Share Document