scholarly journals BiRep: A Reputation Scheme to Mitigate the Effects of Black-Hole Nodes in Delay-Tolerant Internet of Vehicles

Sensors ◽  
2021 ◽  
Vol 21 (3) ◽  
pp. 835
Author(s):  
Catarina Nabais ◽  
Paulo Rogério Pereira ◽  
Naercio Magaia
Keyword(s):  
Black Hole ◽  
Routing Protocol ◽  
Network Performance ◽  
Error Rates ◽  
Delivery Ratio ◽  
Excellent Performance ◽  
Internet Of Vehicles ◽  
Intermittent Connectivity ◽  
Variable Delays ◽  
Delay Tolerant

Delay-tolerant networking (DTN) enables communication in disruptive scenarios where issues such as sparse and intermittent connectivity, long and variable delays, high latency, high error rates, or no end-to-end connectivity exist. Internet of Vehicles (IoV) is a network of the future in which integration between devices, vehicles, and users will be unlimited and universal, overcoming the heterogeneity of systems, services, applications, and devices. Delay-tolerant internet of vehicles (DT-IoV) is emerging and becoming a popular research topic due to the critical applications that can be realized, such as software or map update dissemination. For an IoV to work efficiently, a degree of cooperation between nodes is necessary to deliver messages to their destinations. However, nodes might misbehave and silently drop messages, also known as a black-hole attack, degrading network performance. Various solutions have been proposed to deal with black-hole nodes, but most are centralized or require each node to meet every other node. This paper proposes a decentralized reputation scheme called BiRep that identifies and punishes black-hole nodes in DT-IoV. BiRep is tested on the Prophet routing protocol. Simulation results show excellent performance in all scenarios, comparable or better to other reputation schemes, significantly increasing the delivery ratio of messages.

scholarly journals CHBR: Contact History Based Routing in Time Varying Approach

2014 ◽  
Vol 13 (2) ◽  
pp. 4237-4247 ◽  
Author(s):  
Pravesh S Patel ◽  
Hemal Shah ◽  
Yogeshwar Kosta
Keyword(s):  
Routing Protocol ◽  
Delay Tolerant Network ◽  
Delivery Ratio ◽  
Time Varying ◽  
Intermittent Connectivity ◽  
Real Trace ◽  
Synthetic Datasets ◽  
Delay Tolerant ◽  
Communication Path ◽  
Selection Of

In Delay tolerant network having intermittent connectivity so there is no guarantee of finding a complete communication path that connecting the source and destination. There no any end to end connectivity for delay-tolerant network selection of routing protocol is important to deliver the message in an efficient way and increases chance to deliver a message to the destination. Some existing routing protocols improve the delivery ratio but it also increases the overhead. Our paper proposed Contact History Based Routing (CHBR) that use Neighborhood Index and Time varying properties such as temporal distance, Temporal Diameter and centrality for benchmarking the existing routing protocol. First, temporal metrics are evaluated for synthetic and real trace data. Then CHBR protocol is compared with the Epidemic and PROPHET for delivery ratio, overhead and the number of messages dropped. This has been carried using Opportunistic Network Environment simulator under real and synthetic datasets.

scholarly journals Impact of Black Hole Attack over Random Aodv Routing Protocol

2020 ◽  
Vol 9 (6) ◽  
pp. 1110-1115
Keyword(s):  
Black Hole ◽  
Routing Protocol ◽  
Network Performance ◽  
Research Work ◽  
Delivery Ratio ◽  
Black Hole Attack ◽  
Proposed Model ◽  
Random Node ◽  
The Impact ◽  
Selection Of

There are many researches in which the impact of black hole attacks at AODV networks is highlighted. In the research work, the impact of iBlack iHole iattack iover iAODV routing is calculated and random node selection technique is used. In addition, the simulation of black hole attacks’ impact on network performance is proposed in case of proposed model and traditional model. The selection of nodes is made randomly. The simulation of proposed selection based model is able to enhance the ratio of packet delivery. It is efficient to decrease the ratio of packet loss than traditional models. Comparative evaluation of the performance of existing and proposed model is made ion ithe ibase iof iPacket iDelivery iratio, iPacket iloss iratio, iPacket iDelivery iratio, iPacket iLoss iratio in case of 200 Node and 225 Node. This research paper also determined iAverage iEnd ito iEnd iDelivery iand iRouting iover head during comparative analysis. The proposed work can minimize the downfall in delivery ratio as the amount of malicious node increases.

scholarly journals AODV-UI Proof of Concept on MIPS-based Wireless Router

2014 ◽  
Vol 10 (1) ◽  
pp. 14
Author(s):  
B. Anantasatya Adhi ◽  
Ruki Harwahyu ◽  
Abdusy Syarif ◽  
Harris Simaremare ◽  
R. Fitri Sari ◽  
...  
Keyword(s):  
Routing Protocol ◽  
Network Performance ◽  
Ad Hoc ◽  
Delivery Ratio ◽  
Proof Of Concept ◽  
Mobile Nodes ◽  
Media Access ◽  
Wireless Router ◽  
Hardware Configuration ◽  
Aodv Routing Protocol

AODV routing protocol facilitates changing and simple-to-setup network environment. It helps setting up a network without sufficient infrastructure, such as in disaster area. Development of AODV protocol has gathered a worldwide research interest. However, not many researches implement AODV routing protocol in real mobile nodes and real MANET. In addition, real implementation deals with other works concerning underlying protocol, firmware and hardware configuration, as well as detailed topology both in logical and physical arrangement. This work aims to implements Ad-hoc On-demand Distant Vector – particularly University of Indonesia AODV (AODV-UI) routing protocol on low-end inexpensive generic wireless routers as a proof of concept. AODV-UI is an improved version of AODV routing protocol that implements gateway interconnection and reverse route capability. This routing protocol has been previously successfully tested in NS-2. In this work, current AODV-UI protocol is ported to OpenWRT + MIPS (Microprocessor without Interlocked Pipeline Stages) little endian architecture then tested on the real networking environment. Underlying media access layer is also altered to provide the protocol greater control over the network. Performance of this implementation is measured in terms of energy consumption, routing overhead, end-to-end delay, protocol reliability and packet delivery ratio.

scholarly journals Feature Extraction of Real-World Traces Using K Means Clustering In OppNet

2021 ◽  
Author(s):  
Rahul Johari ◽  
Tanvi Gautam
Keyword(s):  
Network Topology ◽  
Real World ◽  
Network Performance ◽  
Performance Metrics ◽  
Learning Algorithm ◽  
Dynamic Network ◽  
Delivery Ratio ◽  
Communication Link ◽  
Alternative Measure ◽  
Intermittent Connectivity

Abstract Natural calamities leave people helpless by arising several situations such as network breakdown, zero communication, intermittent connectivity, dynamic network topology. In such situation an application of dynamic and intermittent routing scheme is essential to make further communication possible during likewise scenarios. An application of TCP/IP becomes futile in mentioned circumstances as it best works for static nodes and pre-defined network topology wherein source and destination nodes are first establishing the communication link with each other. An alternative measure of such hitches is to encounter an application of DTN protocol which possess all characteristics to withstand in such scenarios such as; dynamic network topology, intermittent connectivity, frequent path breaks, store – carry – forward fashion. In this paper we did thorough investigation of forest fire dataset (Uttarakhand) after exploring its implementation in ONE with Epidemic, Prophet, Spray and Wait, HBPR, GAER respectively. An extensive and thorough investigation for real world traces implementation has been done with OppNet routing protocols against mobility models namely; Shortest path map – based, Random Direction, Random Walk, Random Waypoint, Cluster Movement respectively for network performance metrics namely packet delivery ratio, packet overhead ratio and average latency ratio respectively with the application of K means clustering machine learning algorithm. With the help of this analysis, we explore the real-world traces characteristics and study the areas on which network performance can be improved.

Novel Wireless Sensor Network Routing Protocol Performance Evaluation using Diverse Packet Size for Agriculture Application

2021 ◽  
Vol 13 (4) ◽  
Author(s):  
Amierul Syazrul Azman ◽  
◽  
Mohamad Yusry Lee ◽  
Siva Kumar Subramaniam ◽  
Farah Shahnaz Feroz ◽  
...  
Keyword(s):  
Routing Protocol ◽  
Network Performance ◽  
Network Routing ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
Large Network ◽  
Packet Size ◽  
Agriculture Industry ◽  
Grid Nodes ◽  
The Impact

As the wireless sensor networks (WSNs) progress with newer and more advanced technologies, so do the demands for them in a growing number of applications. Precision agricultural environment monitoring is one of the most prominent applications that require feasible wireless support systems, particularly in the protection and condition control of the crops. This paper focuses on the grid nodes arrangement of WSN, considering the wide dissemination of the plantation areas in the agriculture industry. Due to the different types of sensors used and their data size, the study on the impact of the varied packet size on the performance of the small and large network has been carried out using AODV and OLSR routing protocols. No significant differences in terms of performance can be seen as the packet size is varied. However, compared to the small network, more performance issues have occured in the large network, such as more packet loss, higher throughput degradation, higher energy consumption, worse unfairness, and more overhead production. The OEG routing protocol has been proposed to enhance the network performance by reducing the strain due to the saturated traffic. When solely compared to AODV, OEG routing protocol is able to enhance the network performance with at most 27% more packet delivery ratio, 31kbps more throughput, and 0.991J lesser energy consumed in the network.

scholarly journals Securing cluster based routing against cooperative black hole attack in mobile ad hoc network

2018 ◽  
Vol 7 (1.9) ◽  
pp. 6 ◽  
Author(s):  
Pandi Selvam Raman ◽  
Shankar K ◽  
Ilayaraja M
Keyword(s):  
Black Hole ◽  
Routing Protocol ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Optimal Path ◽  
Destination Node ◽  
Delivery Ratio ◽  
Black Hole Attack ◽  
Mobile Ad Hoc ◽  
Cluster Based Routing

Mobile ad hoc networks (MANETs) are wireless infrastructure-less network consisting collection of autonomous nodes that communicate with each other in decentralized manner. Security remains major challenge due to its some unique characteristics like open medium, mobility and hence topology changes. Therefore, routing protocol for MANETs is much vulnerable to attacks. Black Hole is a type of attack, where malicious node falsely advertises itself having the shortest or optimal path to the destination node. This attack is more dangerous while a group of nodes are cooperating with each other.The objective of this paper is to design cluster based routing protocol and prevent it from the black hole attack. The simulation results show improvement in packet delivery ratio and control overhead.

A Real-Life Mobility Patterns Based Routing Protocol in Delay Tolerant Mobile Sensor Network

2012 ◽  
Vol 490-495 ◽  
pp. 1411-1415
Author(s):  
Xiao Min Wang ◽  
Lei Wu ◽  
Ling Fei Yu
Keyword(s):  
Sensor Network ◽  
Routing Protocol ◽  
Routing Protocols ◽  
Real Life ◽  
Delivery Ratio ◽  
Mobile Sensor ◽  
Mobility Patterns ◽  
Mobile Sensor Network ◽  
Delay Tolerant ◽  
Transmission Overhead

Most existing routing protocols for delay tolerant mobile sensor network(DTMSN) based on simplistic random mobility models. However, the real-life mobility pattern is complicated. We propose a real-life mobility patterns based routing protocol in DTMSN, The simulation results show that RMPR achieves higher delivery ratio and lower delay and transmission overhead

scholarly journals Performance evaluation of MANET routing protocols based on QoS and energy parameters

2020 ◽  
Vol 10 (4) ◽  
pp. 3635
Author(s):  
Salma S. Mohamed ◽  
Abdel-Fatah I. Abdel-Fatah ◽  
Mohamed A. Mohamed
Keyword(s):  
Performance Evaluation ◽  
Routing Protocol ◽  
Routing Protocols ◽  
Network Performance ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Energy Utilization ◽  
Delivery Ratio ◽  
Distance Vector ◽  
The Impact

Routing selection and supporting Quality of Service (QoS) are fundamental problems in Mobile Ad Hoc Network (MANET). Many different protocols have been proposed in the literature and some performance simulations are made to address this challenging task. This paper discusses the performance evaluation and comparison of two typical routing protocols; Ad Hoc On-Demand Distance Vector (AODV) and Destination-Sequenced Distance-Vector (DSDV) based on measuring the power consumption in network with varing of the QoS parameters. In this paper, we have studied and analyzed the impact of variations in QoS parameter combined with the choice of routing protocol, on network performance. The network performance is measured in terms of average throughput, packet delivery ratio (PDR), average jitter and energy consumption. The simulations are carried out in NS-3. The simulation results show that DSDV and AODV routing protocols are less energy efficient. The main aim of this paper is to highlight the directions for the future design of routing protocol which would be better than the existing ones in terms of energy utilization and delivery ratio.

scholarly journals Performance Evaluation of Routing Metrics in the LOADng Routing Protocol

2017 ◽  
Vol 13 (2) ◽  
pp. 87 ◽  
Author(s):  
Jose V. V. Sobral ◽  
Joel J. P. C. Rodrigues ◽  
Neeraj Kumar ◽  
Chunsheng Zhu ◽  
Raja W. Ahmad
Keyword(s):  
Routing Protocol ◽  
Network Performance ◽  
Ad Hoc ◽  
Average Energy ◽  
Delivery Ratio ◽  
Traffic Patterns ◽  
Routing Metric ◽  
Lossy Networks ◽  
Routing Metrics ◽  
Average Latency

LOADng (Lightweight On-demand Ad hoc Distance-vector Routing Protocol - Next Generation) is an emerging routing protocol that emerged as an alternative to RPL (IPv6 Routing Protocol for Low power and Lossy Networks). Although some work has been dedicated to study LOADng, these works do not analyze the performance of this protocol with different routing metrics. A routing metric is responsible for defining values for paths during the route creation process. Moreover, based on these metrics information a routing protocol will select the path to forward a message. Thus, this work aims to realize a performance assessment study considering different routing metrics applied to LOADng. The scenarios under study consider different traffic patterns and network sizes. The routing metrics are evaluated considering the packet delivery ratio, average energy spent per bit delivered, average latency, and number of hops. The results reveals that routing metrics used by this protocol may influence (directly) the network performance.

scholarly journals Towards Intelligent Caching and Retrieval Mechanisms for Upcoming Proposals on Vehicular Delay-Tolerant Networks

2011 ◽  
Vol 7 (1) ◽  
pp. 1 ◽  
Author(s):  
Bruno M. C. Silva ◽  
Vasco N. G. J. Soares ◽  
Joel J. P. C. Rodrigues
Keyword(s):  
Network Performance ◽  
Ad Hoc ◽  
Storage Capacity ◽  
State Of The Art ◽  
Delay Tolerant Networks ◽  
Opportunistic Networks ◽  
Network Nodes ◽  
Intermittent Connectivity ◽  
Delay Tolerant ◽  
Carry And Forward

Vehicular delay-tolerant networks (VDTNs) are opportunistic networks that enable connectivity in challenged scenarios with unstable links where end-to-end communications may not exist. VDTN architecture handles non-real timeapplications using vehicles to relay messages between network nodes. To address the problem of intermittent connectivity, network nodes store messages on their buffers, carrying them through the network while waiting for transfer opportunities. The storage capacity of the nodes affects directly the network performance. Therefore, it is important to incorporate suitable network protocols using self-contained messages to improve communication that supports store-carry-and-forward operation procedures. Clearly, such procedures motivate content cachingand retrieval. This paper surveys the state-of-the art on intelligent caching and retrieval mechanisms focusing on ad-hoc and delay tolerant networks (DTN). These approaches can offer important insights for upcoming proposals on intelligent caching and retrieval mechanisms for VDTNs.

Sign in / Sign up

Export Citation Format

Share Document