scholarly journals A Message Transfer Framework for Enhanced Reliability in Delay-Tolerant Networks

2015 ◽  
Vol 7 (3) ◽  
pp. 52
Author(s):  
Farzana Yasmeen ◽  
Uyen Trang Nguyen ◽  
Nurul Huda ◽  
Shigeki Yamada ◽  
Cristian Borcea
Keyword(s):  
Network Performance ◽  
Performance Metrics ◽  
Delay Tolerant Networks ◽  
Delivery Ratio ◽  
Message Delivery ◽  
Delivery Performance ◽  
End To End Delay ◽  
End To End ◽  
Deadline Constraints ◽  
Delay Tolerant

Delay-tolerant networks (DTNs) can tolerate disruption on end-to-end paths by taking advantage of temporal links emerging between nodes as nodes move in the network. Intermediate nodes store messages before forwarding opportunities become available. A series of encounters (i.e., coming within mutual transmission range) among different nodes will eventually deliver the message to the desired destination. The message delivery performance in a DTN (such as delivery ratio and end-to-end delay) highly depends on the time elapsed between encounters and the time two nodes remain in each others communication range once a contact is established. As messages are forwarded opportunistically among nodes, it is important to have sufficient contact opportunities in the network for faster, more reliable delivery of messages. We propose a simple yet efficient method for improving the performance of a DTN by increasing the contact duration of encountered nodes (i.e., mobile devices). Our proposed sticky transfer framework and protocol enable nodes in DTNs to collect neighbors’ information, evaluate their movement patterns and amounts of data to transfer in order to make decisions of whether to “stick” with a neighbor to complete the necessary data transfers. The sticky transfer framework can be combined with any DTN routing protocol to improve its performance. We evaluate ourframework through simulations and measure several network performance metrics. Simulation results show that the proposed framework can improve the message delivery ratio, end-to-end delay, overhead ratio, buffer occupancy, number of disrupted message transmissions and so on. It can be well adopted for challenged scenarios where larger messages sizes need to be delivered with application deadline constraints. Furthermore, performance of the DTN improved (upto 43%) at higher node densities and (up to 49%) under increased mobility conditions.

Secure Buffer-Based Routing Protocol for WMN

2017 ◽  
Vol 13 (1) ◽  
pp. 28-44
Author(s):  
Geetanjali Rathee ◽  
Hemraj Saini
Keyword(s):  
Routing Protocol ◽  
Performance Metrics ◽  
Packet Delivery Ratio ◽  
Secure Routing ◽  
Delivery Ratio ◽  
Link Failure ◽  
Packet Delivery ◽  
End To End Delay ◽  
End To End ◽  
Network Metrics

Secure routing is considered as one of a key challenge in mesh networks because of its dynamic and broadcasting nature. The broadcasting nature of mesh environment invites number of security vulnerabilities to come and affect the network metrics drastically. Further, any node/link failure of a routed path may reduce the performance of the entire network. A number of secure routing protocols have been proposed by different researchers but enhancement of a single network parameter (i.e. security) may affect another performance metrics significantly i.e. throughput, end to end delay, packet delivery ratio etc. In order to ensure secure routing with improved network metrics, a Secure Buffer based Routing Protocol i.e. SBRP is proposed which ensures better network performance with increased level of security. SBRP protocol uses buffers at alternate positions to fasten re-routing mechanism during node/link failure and ensures the security using AES encryption. Further the protocol is analyzed against mAODV protocol in both static and dynamic environment in terms of security, packet delivery ratio, end to end delay and network throughput.

Geometric sequence based multipath routing protocol for multi-hop ad hoc networks

2016 ◽  
Vol 12 (4) ◽  
pp. 394-407 ◽  
Author(s):  
Yahya M. Tashtoush ◽  
Mohammad A. Alsmirat ◽  
Tasneem Alghadi
Keyword(s):  
Routing Protocol ◽  
Ad Hoc ◽  
Performance Metrics ◽  
Transmission Rate ◽  
Multipath Routing ◽  
Delivery Ratio ◽  
Content Type ◽  
End To End Delay ◽  
Geometric Sequence ◽  
End To End

Purpose The purpose of this paper is to propose, a new multi-path routing protocol that distributes packets over the available paths between a sender and a receiver in a multi-hop ad hoc network. We call this protocol Geometric Sequence Based Multipath Routing Protocol (GMRP). Design/methodology/approach GMRP distributes packets according to the geometric sequence. GMRP is evaluated using GloMoSim simulator. The authors use packet delivery ratio and end-to-end delay as the comparison performance metrics. They also vary many network configuration parameters such as number of nodes, transmission rate, mobility speed and network area. Findings The simulation results show that GMRP reduces the average end-to-end delay by up to 49 per cent and increases the delivery ratio by up to 8 per cent. Originality/value This study is the first to propose to use of geometric sequence in the multipath routing approach.

scholarly journals Evaluation of Spray Based Routing Approaches in Delay Tolerant Networks

2014 ◽  
Vol 10 (4) ◽  
pp. 213 ◽  
Author(s):  
Sweta Jain ◽  
Meenu Chawla
Keyword(s):  
Routing Protocols ◽  
Ad Hoc ◽  
Performance Metrics ◽  
Delay Tolerant Networks ◽  
Delivery Ratio ◽  
Composite Methods ◽  
Average Latency ◽  
Delay Tolerant ◽  
Overhead Ratio ◽  
Spray And Wait

Delay Tolerant Networks (DTN) are mobile ad-hoc networks in which connections are often disruptive or discontinuous. Data forwarding using an appropriate routing strategy is a highly confronting issue in such networks. The traditional ad-hoc routing protocols which require end-to-end connectivity fail to function here due to frequent occurrences of network partitions. Spray and Wait (SaW) routing algorithm is a popular controlled replication based DTN protocol which provides a better delivery performance balancing the average delay and overhead ratio. An empirical analysis of various spray based approaches that have been proposed for DTN has been performed in this paper to compare and evaluate the basic Spray and Wait algorithms (Source Spray and Wait and Binary Sprayand Wait) with some of its major improvements (Spray andFocus, Average Delivery Probability Binary Spray and Wait and Composite methods to improve Spray and Wait). The main aim of this comparative study is to verify the effect of utility metrics in spray based routing protocols over simple spray based approaches. The ONE simulator has been used to provide a simulation environment to evaluate these algorithms and generate results. The performance metrics used are delivery ratio (DR), overhead ratio (OR) and average latency (ALat). The simulation results show that in terms of delivery ratio and average latency, Composite methods to improve Spray and Wait which incorporates delivery predictability metric in the wait phase and also acknowledgements to delete already deliveredmessages from a node’s buffer, outperforms all the other variants compared.

A Novel Congestion Control Technique in Delay Tolerant Networks

2018 ◽  
Vol 10 (1) ◽  
pp. 20-35 ◽  
Author(s):  
Saeid Iranmanesh ◽  
Maryam Saadati
Keyword(s):  
Network Performance ◽  
Delay Tolerant Networks ◽  
Control Technique ◽  
Destination Node ◽  
Delivery Ratio ◽  
Simulation Studies ◽  
Network Resources ◽  
Proper Number ◽  
Replication Technique ◽  
Delay Tolerant

Delay Tolerant Networks (DTNs) are characterized by the lack of contemporaneous paths between any source and destination node. As a basic forwarding strategy, nodes may flood their bundles to every encountered node. This results in congestion and unnecessarily consumes precious network resources. Another strategy is to take advantage of quota based protocols in which only a limited number of copies or replicas are disseminated throughout the network in order to reduce resource usage. However, they suffer from low delivery ratios as their dissemination rate is low. In this paper, the authors propose an Adaptive Message Replication Technique (AMRT) that is fit onto quota protocols to intelligently limit the number of replicas for each generated message. In other words, a source node under AMRT considers the congestion exist amongst the neighbours in order to generate a proper number of replicas for the generated messages. The simulation studies show that when AMRT is applied onto the quota protocols namely, SprayAndWait, EBR, and DBRP, the network performance such as delivery ratio and delay is improved.

scholarly journals Agent Aided Routing for Faster and Efficient Spreading of Messages in Delay Tolerant Networks

1970 ◽  
Vol 8 (2) ◽  
pp. 123-132
Author(s):  
Shahid Md. Asif Iqbal ◽  
Alok Kumar Chowdhury ◽  
Amina Akhter
Keyword(s):  
Delay Tolerant Networks ◽  
Communication Overhead ◽  
Delivery Ratio ◽  
Message Delivery ◽  
Agent Based ◽  
Delivery Delay ◽  
Routing Schemes ◽  
Routing Scheme ◽  
Delay Tolerant ◽  
Better Than

Routing schemes in Delay Tolerant Networks depend on the intermediate nodes to carry messages till the forwarding of the messages to other nodes or delivery of the messages to their destinations. Thus, efficient and faster spreading of messages is essential to reduce the delay of sending a message from source to destination. In this work, we aim to design a new agent aided routing scheme in Delay Tolerant Networks to avoid large message delivery delay. Here, the source of a message is permitted to create unlimited copies of a message and distribute these copies to agents. Agents acting as the representative of the sources receive messages from the sources based on their node visited list and delivery predictability. After that, the agents forward the copies to the other intermediate nodes or deliver the message directly to the destination. Thus, the agents help in faster and efficient dissemination of a message in the network which helps in reducing message delivery delay. Besides, we compare our scheme with that of other schemes in different network scenarios through simulations. Simulation results show that our agent based routing scheme performs better than that of others in terms of Delivery Ratio, Delay and Communication Overhead.

scholarly journals Simulation based comparison of routing protocols in wireless multihop adhoc networks

2021 ◽  
Vol 11 (4) ◽  
pp. 3186
Author(s):  
Ali H. Wheeb ◽  
Marwa T. Naser
Keyword(s):  
Routing Protocols ◽  
Ad Hoc ◽  
Performance Metrics ◽  
Performance Comparison ◽  
Traffic Load ◽  
Delivery Ratio ◽  
Mobile Nodes ◽  
End To End Delay ◽  
Simulation Based ◽  
End To End

Routing protocols are responsible for providing reliable communication between the source and destination nodes. The performance of these protocols in the ad hoc network family is influenced by several factors such as mobility model, traffic load, transmission range, and the number of mobile nodes which represents a great issue. Several simulation studies have explored routing protocol with performance parameters, but few relate to various protocols concerning routing and Quality of Service (QoS) metrics. This paper presents a simulation-based comparison of proactive, reactive, and multipath routing protocols in mobile ad hoc networks (MANETs). Specifically, the performance of AODV, DSDV, and AOMDV protocols are evaluated and analyzed in the presence of varying the number of mobile nodes, pause time, and traffic connection numbers. Moreover, Routing and QoS performance metrics such as normalized routing load, routing packet, packet delivery ratio, packet drop, end-to-end delay, and throughput are measured to conduct a performance comparison between three routing protocols. Simulation results indicate that AODV outperforms the DSDV and AOMDV protocols in most of the metrics. AOMDV is better than DSDV in terms of end-to-end delay. DSDV provides lower throughput performance results. Network topology parameters have a slight impact on AODV Performance.

Catechize Global Optimization through Leading Edge Firefly Based Zone Routing Protocol

2020 ◽  
Vol 13 (2) ◽  
pp. 147-157 ◽  
Author(s):  
Neha Sharma ◽  
Sherin Zafar ◽  
Usha Batra
Keyword(s):  
Global Optimization ◽  
Routing Protocol ◽  
Firefly Algorithm ◽  
Leading Edge ◽  
Packet Delivery Ratio ◽  
Delivery Ratio ◽  
Packet Delivery ◽  
Zone Routing Protocol ◽  
End To End Delay ◽  
End To End

Background: Zone Routing Protocol is evolving as an efficient hybrid routing protocol with an extremely high potentiality owing to the integration of two radically different schemes, proactive and reactive in such a way that a balance between control overhead and latency is achieved. Its performance is impacted by various network conditions such as zone radius, network size, mobility, etc. Objective: The research work described in this paper focuses on improving the performance of zone routing protocol by reducing the amount of reactive traffic which is primarily responsible for degraded network performance in case of large networks. The usage of route aggregation approach helps in reducing the routing overhead and also help achieve performance optimization. Methods: The performance of proposed protocol is assessed under varying node size and mobility. Further applied is the firefly algorithm which aims to achieve global optimization that is quite difficult to achieve due to non-linearity of functions and multimodality of algorithms. For performance evaluation a set of benchmark functions are being adopted like, packet delivery ratio and end-to-end delay to validate the proposed approach. Results: Simulation results depict better performance of leading edge firefly algorithm when compared to zone routing protocol and route aggregation based zone routing protocol. The proposed leading edge FRA-ZRP approach shows major improvement between ZRP and FRA-ZRP in Packet Delivery Ratio. FRA-ZRP outperforms traditional ZRP and RA-ZRP even in terms of End to End Delay by reducing the delay and gaining a substantial QOS improvement. Conclusion: The achievement of proposed approach can be credited to the formation on zone head and attainment of route from the head hence reduced queuing of data packets due to control packets, by adopting FRA-ZRP approach. The routing optimized zone routing protocol using Route aggregation approach and FRA augments the QoS, which is the most crucial parameter for routing performance enhancement of MANET.

scholarly journals An Effective and Efficient Adaptive Probability Data Dissemination Protocol in VANET

Data ◽  
2018 ◽  
Vol 4 (1) ◽  
pp. 1 ◽  
Author(s):  
John Sospeter ◽  
Di Wu ◽  
Saajid Hussain ◽  
Tesfanesh Tesfa
Keyword(s):  
Data Dissemination ◽  
Probabilistic Approach ◽  
Mobile Network ◽  
Delivery Ratio ◽  
Network Resources ◽  
Network Resource ◽  
V2v Communication ◽  
End To End Delay ◽  
End To End ◽  
Road Segments

Mobile network topology changes dynamically over time because of the high velocity of vehicles. Therefore, the concept of the data dissemination scheme in a VANET environment has become an issue of debate for many research scientists. The main purpose of VANET is to ensure passenger safety application by considering the critical emergency message. The design of the message dissemination protocol should take into consideration effective data dissemination to provide a high packet data ratio and low end-to-end delay by using network resources at a minimal level. In this paper, an effective and efficient adaptive probability data dissemination protocol (EEAPD) is proposed. EEAPD comprises a delay scheme and probabilistic approach. The redundancy ratio (r) metric is used to explain the correlation between road segments and vehicles’ density in rebroadcast probability decisions. The uniqueness of the EEAPD protocol comes from taking into account the number of road segments to decide which nodes are suitable for rebroadcasting the emergency message. The last road segment is considered in the transmission range because of the probability of it having small vehicle density. From simulation results, the proposed protocol provides a better high-packet delivery ratio and low-packet drop ratio by providing better use of the network resource within low end-to-end delay. This protocol is designed for only V2V communication by considering a beaconless strategy. the simulations in this study were conducted using Ns-3.26 and traffic simulator called “SUMO”.

scholarly journals Analisis Kinerja GPSR dan AODV pada VANET dengan Skema Pengimbangan Beban Trafik

2018 ◽  
Vol 6 (2) ◽  
pp. 207
Author(s):  
RENDI DIAN PRASETIA ◽  
DOAN PERDANA ◽  
RIDHA MULDINA NEGARA
Keyword(s):  
Load Balancing ◽  
Routing Protocol ◽  
Mean Value ◽  
Packet Delivery Ratio ◽  
Traffic Load ◽  
Delivery Ratio ◽  
Vehicle Traffic ◽  
Packet Delivery ◽  
End To End Delay ◽  
End To End

ABSTRAKSalah satu permasalahan di kota-kota besar adalah kemacetan lalu lintas yang disebabkan karena tidak mencukupinya ruas jalan, volume kendaraan yang begitu besar, persebaran kendaraan yang tidak merata dan lain-lain. Salah satu solusinya adalah para pengendara dapat menggunakan aplikasi peta digital pada smartphone-nya. Oleh karena itu perlu dilakukan pengimbangan beban trafik kendaraan. Pada penelitian ini akan dibahas mengenai kinerja VANET yang menggunakan protokol routing GPSR dan AODV dengan skema pengimbangan beban trafik kendaraan dengan pengaruh kepadatan node. Perancangan sistem simulasi terbagi menjadi dua subsistem yaitu subsistem mobilitas dan jaringan. Kemudian dilakukan pengimbangan beban trafik kendaraan, dan kinerja VANET akan diamati. Performansi dievaluasi dengan average end to end delay, throughput, dan packet delivery ratio. Nilai rata-rata throughput, PDR, delay untuk GPSR adalah 142.21 Kbps, 87.47 %, dan 82.83 ms. Sedangkan AODV adalah 119.81 Kbps, 86.67 %, dan 103.21 ms. Dari hasil penelitian nilai QoS performansi dari routing protocol GPSR lebih baik dari pada AODV pada VANET.Kata kunci: Vanet, Pengimbangan Beban, GPSR, AODV.ABSTRACTOne of the problems in big cities is congestion. The congestion is caused byinsufficient road segment, large volume of vehicles, unbalanced spread ofvehicles and others. One solution is that riders can use digital map applications on their smartphones. Therefore it is necessary to balancing the traffic load of vehicles. In this research will be discussed about VANET performance using GPSR and AODV routing protocol with vehicle traffic load balancing scheme with node density influence. The design of the simulation system is divided into two subsystems namely mobility and network subsystem. Then balancing the vehicle traffic load, and VANET performance will be observed. Performance is evaluated with the average end to end delay, throughput, and packet delivery ratio. The mean value of throughput, PDR, delay for GPSR respectively 142.21 Kbps, 87.47%, and 82.83 ms. While AODV is 119.81 Kbps, 86.67%, and 103.21 ms. From the simulation results can be concluded that the performance of GPSR is better than AODV on VANET. Keywords: Vanet, Load Balancing, GPSR, AODV.

Sign in / Sign up

Export Citation Format

Share Document