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 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.

scholarly journals Performance Evaluation of Social Routing Protocols Based on the Effect of Delivery Ratio and Average Hop Count in Delay-tolerant Networks (DTN)

2019 ◽  
Vol 4 (12) ◽  
pp. 155-158
Author(s):  
Sujan Chandra Roy ◽  
Farhana Enam ◽  
Md. Ashraful Islam
Keyword(s):  
Routing Protocol ◽  
Routing Protocols ◽  
Ad Hoc ◽  
Delay Tolerant Networks ◽  
Opportunistic Networks ◽  
Destination Node ◽  
Delivery Ratio ◽  
Hop Count ◽  
Message Transmission ◽  
Delay Tolerant

Delay-Tolerant Networks (DTNs) are part of Opportunistic networks. In the case of opportunistic networks, the joined node of a network can have zero or partial knowledge about other nodes in a network. For this reason, the evident information towards the nodes in the existing network is most difficult to collect for forwarding the message. The application of Opportunistic networks is where have a high tolerance for long delays, high error rate, etc. DTNs are also sparse dynamic Ad-hoc networks were source to destination path does not present all-time for successfully message transmission. As DTN has no end-to-end path for message transmission source to destination node so, the routing design is so sophisticated. The social-based routing protocol is developed to improve the routing mechanism by focusing on social behavior and the interaction with the nodes of a network. Consequently, the performance analysis of existing several DTN routing protocols represents a significant role in designing or developing a new routing protocol for a specific scenario. This article investigates the execution of ordinary routing protocols of DTNs such as Epidemic, Binary Spray and Wait (BSNW), including two social-based routing protocols such as Scorp and dLife using Opportunistic Network Environment (ONE) simulator. The performance of these routing protocols is measured based on delivery ratio and average hop count with inevitable simulation settings. From the simulation result, it is condensed that for higher delivery ratio, BSNW is best, and for average hop count, dLife is the best routing protocol.  

scholarly journals DRANS: Daily Routine Analysis for Node Searching in delay tolerant networks

2017 ◽  
Vol 13 (7) ◽  
pp. 155014771771810 ◽  
Author(s):  
Xingyu He ◽  
Guisong Yang ◽  
Hao Zhang
Keyword(s):  
Success Rate ◽  
Delay Tolerant Networks ◽  
Transmission Delay ◽  
Routine Analysis ◽  
Destination Node ◽  
Daily Routine ◽  
Node Mobility ◽  
Mobility Patterns ◽  
Probability Table ◽  
Delay Tolerant

In delay tolerant networks, the success rate and the transmission speed are restricted by limited social interaction and complex node mobility pattern analysis. To increase the success rate and reduce the transmission delay in delay tolerant networks, we propose Daily Routine Analysis for Node Searching in delay tolerant networks. In Daily Routine Analysis for Node Searching, each node is required to generate a Staying Probability Table and a Transiting Probability Table by analyzing its own daily routine, then to distribute its Staying Probability Table and Transiting Probability Table to the whole network with the help of other nodes having different mobility patterns. On the basis of the Staying Probability Table and Transiting Probability Table, Daily Routine Analysis for Node Searching further provides a node tracking strategy and an opportunistic routing strategy for delivering data from the source node to the destination node. Trace-driven experiments are performed to compare Daily Routine Analysis for Node Searching with previous node searching methods. The experimental results demonstrate that Daily Routine Analysis for Node Searching is able to promote the success rate and reduce the transmission delay effectively.

A Data Cooperative Caching Policy Using Human Mobile Patterns for Delay Tolerant Networks

2010 ◽  
Vol 171-172 ◽  
pp. 561-564
Author(s):  
Hui Ye ◽  
Zhi Gang Chen ◽  
Xiao Jian Shen
Keyword(s):  
Network Performance ◽  
Data Dissemination ◽  
Delay Tolerant Networks ◽  
Cooperative Caching ◽  
Network Cost ◽  
Movement Characteristics ◽  
Delay Tolerant ◽  
The Impact ◽  
Caching Policy ◽  
Address Matching

Recently, many researchers focus on delay tolerant networks (DTN). In DTN, the mobile characteristic of nodes is used to help transfer data. Therefore, how to use the cooperative relations and cache resource of nodes effectively to avoid network congestion and improve network performance is an important issue. In this paper, we proposed a cooperative caching policy based on human mobile patterns, which referred as HMP-Cache. The node movement characteristics are discussed in detail in HMP-Cache. HMP-Cache uses the standard of target address matching to choose cooperative caching nodes. In addition, the sharing caching information is done by synchronization of caching table in local region. Therefore, the impact of useless data dissemination of multiple hops is reduced. And the shortcoming of limited caching resources is compensated. The simulation results show that our policy can control the network cost effectively. Also, the remote data latency is reduced.

scholarly journals DCAR: DTN Congestion Avoidance Routing Algorithm Based on Tokens in an Urban Environment

2017 ◽  
Vol 2017 ◽  
pp. 1-9
Author(s):  
Hezhe Wang ◽  
Hongwu Lv ◽  
Huiqiang Wang ◽  
Guangsheng Feng
Keyword(s):  
Network Performance ◽  
Routing Algorithm ◽  
Relay Node ◽  
Routing Algorithms ◽  
Buffer Size ◽  
Destination Node ◽  
Delivery Ratio ◽  
Movement Trajectory ◽  
Average Delay ◽  
Urban Scenario

When a delay/disruption tolerant network (DTN) is applied in an urban scenario, the network is mainly composed of mobile devices carried by pedestrians, cars, and other vehicles, and the node’s movement trajectory is closely related to its social relationships and regular life; thus, most existing DTN routing algorithms cannot show efficient network performance in urban scenarios. In this paper, we propose a routing algorithm, called DCRA, which divides the urban map into grids; fixed sink stations are established in specific grids such that the communication range of each fixed sink station can cover a specific number of grids; these grids are defined as a cluster and allocated a number of tokens in each cluster; the tokens in the cluster are controlled by the fixed sink station. A node will transmit messages to a relay node that has a larger remaining buffer size and encounters fixed sink stations or the destination node more frequently after it obtains a message transmit token. Simulation experiments are carried out to verify the performance of the DCAR under an urban scenario, and results show that the DCAR algorithm is superior to existing routing algorithms in terms of delivery ratio, average delay, and network overhead.

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.

scholarly journals Genetic Optimized Location Aided Routing Protocol for VANET Based on Rectangular Estimation of Position

2020 ◽  
Vol 10 (17) ◽  
pp. 5759 ◽  
Author(s):  
Ravie Chandren Muniyandi ◽  
Faizan Qamar ◽  
Ahmed Naeem Jasim
Keyword(s):  
Energy Consumption ◽  
Routing Protocol ◽  
Network Performance ◽  
Performance Metrics ◽  
Average Energy ◽  
Search Space ◽  
Location Information ◽  
Destination Node ◽  
Delivery Ratio ◽  
Routing Overhead

Vehicle Ad-Hoc Network (VANET) is a dynamic decentralized network that consists of various wireless mobile vehicles with no individual user management. Several routing protocols can be used for VANETs, for example, the Location-Aided Routing (LAR) protocol that utilizes location information provided by the Global Positioning System (GPS) sensors. It can help to reduce the search space for the desired route—limiting the search space results in fewer route discovery messages. However, two essential aspects are ignored while applying the LAR protocol in the VANET-based environment. Firstly, the LAR does not exploit the fact that nodes in VANET do not have pure random movement. In other words, nodes in LAR predict the position of destination node by ignoring the fact that the pre-defined constraint on the destination node navigation is met. Secondly, the nodes in the conventional LAR (or simply stated as LAR) protocol use the location information of the destination node before selecting the route location, which is most likely to expire because of the fast movement of the nodes in the VANET environment. This study presents an estimation based on a heuristic approach that was developed to reject weak GPS location data and accept accurate ones. The proposed routing protocol stated as Rectangle-Aided LAR (RALAR) is based on a moving rectangular zone according to the node′s mobility model. Additionally, the proposed RALAR protocol was optimized by using the Genetic Algorithm (GA) by selecting the most suitable time-out variable. The results were compared with LAR and Kalman-Filter Aided-LAR (KALAR), the most commonly utilized protocols in VANET for performance metrics using Packet Delivery Ratio (PDR), average End-to-End Delay (E2E Delay), routing overhead and average energy consumption. The results showed that the proposed RALAR protocol achieved an improvement over the KALAR in terms of PDR of 4.7%, average E2E delay of 60%, routing overhead of 15.5%, and 10.7% of energy consumption. The results proved that the performance of the RALAR protocol had outperformed the KALAR and LAR protocol in terms of regular network performance measures in the VANET environment.

scholarly journals RABP: Delay/disruption tolerant network routing and buffer management algorithm based on weight

2018 ◽  
Vol 14 (3) ◽  
pp. 155014771875787 ◽  
Author(s):  
Hezhe Wang ◽  
Guangsheng Feng ◽  
Huiqiang Wang ◽  
Hongwu Lv ◽  
Renjie Zhou
Keyword(s):  
Buffer Management ◽  
Network Routing ◽  
Routing Algorithms ◽  
Destination Node ◽  
Delivery Ratio ◽  
Message Delivery ◽  
Network Resources ◽  
Hop Count ◽  
Management Algorithm ◽  
Disruption Tolerant Network

Delay/disruption tolerant network is a novel network architecture, which is mainly used to provide interoperability for many challenging networks such as wireless sensor network, ad hoc networks, and satellite networks. Delay/disruption tolerant network has extremely limited network resources, and there is typically no complete path between the source and destination. To increase the message delivery reliability, several multiple copy routing algorithms have been used. However, only a few can be applied efficiently when there is a resource constraint. In this article, a delay/disruption tolerant network routing and buffer management algorithm based on weight (RABP) is proposed. This algorithm estimates the message delay and hop count to the destination node in order to construct a weight function of the delay and hop count. A node with the least weight value will be selected as the relay node, and the algorithm implements buffer management based on the weight of the message carried by the node, for efficiently utilizing the limited network resources. Simulation results show that the RABP algorithm outperforms the Epidemic, Prophet, and Spray and wait routing algorithms in terms of the message delivery ratio, average delay, network overhead, and average hop count.

scholarly journals Tcp Performance and Throughput Fairness Optimization in a Multi-Hop Pipeline Network

2019 ◽  
Vol 8 (3S2) ◽  
pp. 499-505 ◽  
Keyword(s):  
Network Performance ◽  
Data Transfer ◽  
Transmission Control Protocol ◽  
Critical Factor ◽  
Destination Node ◽  
Maximum Throughput ◽  
Network Resources ◽  
Linear Network ◽  
Pipeline Network ◽  
Packet Collision

Node starvation wireless sensor network (WSN) is a critical factor that affects the overall performance in a typical multi-hop linear network especially in an extensive scale network. The unfairness of sharing network resources with all source nodes in a multi-hop linear network amplifies the node starvation that often results in passive nodes in a network. This factor becomes critical with the increasing network density, aggressive data transfer, single destination node and inadequate data scheduling. This paper highlights the Delayed acknowledgement timeout for flat one-tier throughput critical application model (DAT-FTCAM) a mathematical fairness model that ensure maximum throughput fairness for pipeline network scenario. The DAT-FTCAM enables the users to calculate the maximum delayed acknowledgement timeout for transmission control protocol (TCP) proportional to the travel time or difference between a source and a destination node. The implementation of DAT-FTCAM technique with modified TCP parameters on NS2 has revealed a network fairness index of above 0.99 with optimum network performance in a scalable pipeline network. The DAT-FTCAM decreases data packet collision and eliminates passive nodes in a pipeline network with optimum throughput fairness.

scholarly journals Distributed Misbehavior Detection Scheme for Delay Tolerant Networks

2019 ◽  
Vol 8 (9S3) ◽  
pp. 1288-1292
Keyword(s):  
Network Performance ◽  
Detection System ◽  
Delay Tolerant Networks ◽  
Secure Routing ◽  
Security Model ◽  
Detection Scheme ◽  
Misbehavior Detection ◽  
Distributed Approach ◽  
Intermittent Connectivity ◽  
Delay Tolerant

Opportunistic forwarding mechanism in Delay Tolerant Networks (DTN), are prone to get disconnected from the nodes in the network. These types of networks deal with intermittent connectivity, large delays.Existing routing protocols of DTNs fights with these issues, but fail to integrate the security available for delay tolerant networks,it is necessary to design a secure routing protocol to overcome these issues. There are centralized Trust Authority (TA) based security systems but the disconnection or failure of TA, affects the security model and network performance. It becomes crucial to have the distributed approach for security system and have multiple TAs working on security model. This reduces the possibility of poor network performance. The paper presents a distributed misbehavior detection system, and implements multiple TAs for implementing the security model for DTN.

Sign in / Sign up

Export Citation Format

Share Document