scholarly journals SS-Drop: A Novel Message Drop Policy to Enhance Buffer Management in Delay Tolerant Networks

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Obaid ur Rehman ◽  
Irshad Ahmed Abbasi ◽  
Hythem Hashem ◽  
Khalid Saeed ◽  
Muhammad Faran Majeed ◽  
...  
Keyword(s):  
Data Transfer ◽  
Buffer Management ◽  
Error Rates ◽  
Delivery Ratio ◽  
Delivery Probability ◽  
Buffer Time ◽  
Wide Range ◽  
Transfer Error ◽  
Delay Tolerant ◽  
Selection Of

A challenged network is one where traditional hypotheses such as reduced data transfer error rates, end-to-end connectivity, or short transmissions have not gained much significance. A wide range of application scenarios are associated with such networks. Delay tolerant networking (DTN) is an approach that pursues to report the problems which reduce communication in disrupted networks. DTN works on store-carry and forward mechanism in such a way that a message may be stored by a node for a comparatively large amount of time and carry it until a proper forwarding opportunity appears. To store a message for long delays, a proper buffer management scheme is required to select a message for dropping upon buffer overflow. Every time dropping messages lead towards the wastage of valuable resources which the message has already consumed. The proposed solution is a size-based policy which determines an inception size for the selection of message for deletion as buffer becomes overflow. The basic theme behind this scheme is that by determining the exact buffer space requirement, one can easily select a message of an appropriate size to be discarded. By doing so, it can overcome unnecessary message drop and ignores biasness just before selection of specific sized message. The proposed scheme Spontaneous Size Drop (SS-Drop) implies a simple but intelligent mechanism to determine the inception size to drop a message upon overflow of the buffer. After simulation in ONE (Opportunistic Network Environment) simulator, the SS-Drop outperforms the opponent drop policies in terms of high delivery ratio by giving 66.3% delivery probability value and minimizes the overhead ratio up to 41.25%. SS-Drop also showed a prominent reduction in dropping of messages and buffer time average.

scholarly journals Advanced Optimal Buffer Scheduling Policy in Opportunistic Networks

2012 ◽  
Vol 4 ◽  
pp. 13-18
Author(s):  
Qi Lie Liu ◽  
Guang De Li ◽  
Yun Li ◽  
Ying Jun Pan ◽  
Feng Zhi Yu
Keyword(s):  
Buffer Management ◽  
Opportunistic Networks ◽  
Delay Tolerant Network ◽  
Delivery Ratio ◽  
Scheduling Policy ◽  
Optimal Theory ◽  
Overall Performance ◽  
Delay Tolerant ◽  
Ratio Transmission ◽  
Better Than

Opportunistic Networks (ONs) are the newly emerging type of Delay Tolerant Network (DTN) systems that opportunistically exploit unpredicted contacts among nodes to share information. As with all DTN environments ONs experience frequent and large delays, and an end-to-end path may only exist for a brief and unpredictable time. In this paper, we employ optimal theory to propose a novel buffer management strategy named Optimal Buffer Scheduling Policy (OBSP) to optimize the sequence of message forwarding and message discarding. In OBSP, global optimization considering delivery ratio, transmission delay, and overhead is adopted to improve the overall performance of routing algorithms. The simulation results show that the OBSP is much better than the existing ones.

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 TASM: Trust Aware Scheme for Secure and Reliable Data Transmission in MANETS

2020 ◽  
Vol 9 (1) ◽  
pp. 420-424
Keyword(s):  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Data Transfer ◽  
Reliable Data ◽  
Sensor Nodes ◽  
Delivery Ratio ◽  
Malicious Nodes ◽  
Trust Value ◽  
Wide Range ◽  
Mobile Ad Hoc

Wireless sensor nodes are tiny and have limited battery and memory. These sensor nodes are distributed and self organizing networks. Mobile Ad Hoc network (MANETs) has wide range of applications areas. Growing usage of MANETs in various applications makes a paramount issue in providing QoS. MANETs are vulnerable to different kinds of malicious attacks due to its dynamic nature, which affects nodes connectivity, increase in energy consumption and functionality. Centralized and cryptographic security approaches requires more computational functions which increases overhead. Traditional approaches have more overhead. Most existing trust-based security schemes for mobile ad-hoc networks (MANETs) consider packet loss an indicator of possible attacks by malicious nodes. Thus to achieve secure and reliable data transfer a trust aware scheme is required to evaluate trust level among honest and malicious nodes. In this paper we propose Trust Aware Scheme for Moving nodes (TASM) which discovers efficient node by computing each node’s trust value. In this scheme moving nodes exchange their trust information and analyses the received trust value and makes judgement. This scheme modifies the existing AODV routing protocol and determines malicious nodes based on trust value and log information. Received Signal Strength Indicator (RSSI) determines efficient and trusted neighbour node selection while routing. Proposed scheme is compared with the existing trust based scheme and network parameters like throughput, packet delivery ratio and end to end delay is evaluated. Trusted routing can efficiently deliver data for different routing applications used in military, Fanets and mobile IoT.

DTN Routing Mechanism Based on Area Dipartition

2013 ◽  
Vol 756-759 ◽  
pp. 851-854
Author(s):  
Yun Yang ◽  
Long Sheng Han ◽  
Ran Yan ◽  
Xiu Ping Kong ◽  
Wen Chun Xu
Keyword(s):  
Network Architecture ◽  
Data Transfer ◽  
Routing Algorithm ◽  
Network Routing ◽  
Message Delivery ◽  
Transfer Path ◽  
Delivery Probability ◽  
Dtn Routing ◽  
Routing Mechanism ◽  
Delay Tolerant

Delay Tolerant Networks (DTN) has been widely used in challenge networks as an emerging network architecture. Among all studies , routing mechanism is the key problem in DTN. Because of high latency and low data rate, the traditional network routing algorithm can not apply to DTN. This paper proposed a DTN routing mechanism based on area dipartition. The mechanism divided the space into several regions, and calculated the probability of occurrence of each node in each region to determine data transfer path according to the probability. Finally, the simulation results show that the mechanism can significantly enhance the message delivery probability and reduce the packet loss rate.

scholarly journals A Fuzzy-Logic-Based Double Q -Learning Routing in Delay-Tolerant Networks

2021 ◽  
Vol 2021 ◽  
pp. 1-17
Author(s):  
Jiagao Wu ◽  
Fan Yuan ◽  
Yahang Guo ◽  
Hongyu Zhou ◽  
Linfeng Liu
Keyword(s):  
Fuzzy Logic ◽  
Mobile Networks ◽  
Learning Algorithm ◽  
Buffer Management ◽  
Delay Tolerant Networks ◽  
Movement Speed ◽  
Delivery Ratio ◽  
Node Activity ◽  
Intermittent Connectivity ◽  
Delay Tolerant

Delay-tolerant networks (DTNs) are wireless mobile networks, which suffer from frequent disruption, high latency, and lack of a complete path from source to destination. The intermittent connectivity in DTNs makes it difficult to efficiently deliver messages. Research results have shown that the routing protocol based on reinforcement learning can achieve a reasonable balance between routing performance and cost. However, due to the complexity, dynamics, and uncertainty of the characteristics of nodes in DTNs, providing a reliable multihop routing in DTNs is still a particular challenge. In this paper, we propose a Fuzzy-logic-based Double Q -Learning Routing (FDQLR) protocol that can learn the optimal route by combining fuzzy logic with the Double Q -Learning algorithm. In this protocol, a fuzzy dynamic reward mechanism is proposed, and it uses fuzzy logic to comprehensively evaluate the characteristics of nodes including node activity, contact interval, and movement speed. Furthermore, a hot zone drop mechanism and a drop mechanism are proposed, which can improve the efficiency of message forwarding and buffer management of the node. The simulation results show that the fuzzy logic can improve the performance of the FDQLR protocol in terms of delivery ratio, delivery delay, and overhead. In particular, compared with other related routing protocols of DTNs, the FDQLR protocol can achieve the highest delivery ratio and the lowest overhead.

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 Factual Demonstration of Blockchain Routing in Delay Tolerant Network

2021 ◽  
Author(s):  
Renu Dalal ◽  
Manju Khari
Keyword(s):  
Network Performance ◽  
Delay Tolerant Network ◽  
Delivery Ratio ◽  
Opportunistic Network ◽  
The People ◽  
Buffer Time ◽  
Dynamic Topology ◽  
Average Latency ◽  
Direct Delivery ◽  
Delay Tolerant

Abstract Frequent disconnection, high end-to-end latency, dynamic topology, sparse node density, lack of pre-existing infrastructure, and opportunistic message transmission on wireless link, makes routing difficult in Opportunistic network (Oppnet). In present scenario, Oppnet allows the people to interact with contrasting ways like with diverse mobility, groups, and etc. During transmission of messages in such network security and trust performs major role. Delay Tolerant Network (DTN) are much prone of having inherent risk of attack. Malicious node, selfish node, and attacks are major impact on deteriorating network performance. To prevent the network from such deteriorating factors, this paper introduces the new platform to provide reliable and authentic transmission of message in opportunistic network. Blockchain-based Routing in Opportunistic Network (BRON) uses the concept of Blockchain through which each node work as an authentic node and transmit the secure messages in Oppnet. Opportunistic Network Environment (ONE) tool is used to implement BRON. This protocol generates 36% reduced packet drops ratio, 57% enhanced delivery ratio, 55% lesser overhead ratio, 35.2% reduced average latency, and 65% lesser average buffer time as compared to direct delivery ratio with respect to number of nodes.

scholarly journals Performance Improvement of DTN Routing Protocols with Enhanced Buffer Management Policy

2019 ◽  
Vol 8 (4) ◽  
pp. 9852-9857
Keyword(s):  
Routing Protocols ◽  
Buffer Management ◽  
Delay Tolerant Network ◽  
Management Policy ◽  
Management Approach ◽  
Efficient Approach ◽  
Message Size ◽  
Delivery Probability ◽  
Buffer Time ◽  
Dtn Routing

Delay tolerant network (DTN) is one of the emerging technologies which is applied generally when there is no end-to-end path exists from source to destination all the time. The two major issues in DTN are routing and buffer management. Existing buffer management policies are based on one or more parameters such as message Time-to-Live, message age, message replication count, message size etc.,. There is no efficient approach is available for estimation of message replication count. In this work an efficient approach is proposed to estimate total number of copies of the message. The proposed buffer management approach prioritizes the messages and based on which the messages are forwarded/dropped from the buffer when there is a contact opportunity occurs/when the buffer is full. These priorities are based on message Time-to-Live, message age, message replication count and message size. This proposed buffer management policy is evaluated with two popular DTN routing protocols Spray-and-Wait and Prophet. The simulation results show that delivery probability of messages has increased with reduced buffer time average and minimized latency.

COMBINATORIAL POLYNOMIALLY COMPUTABLE CHARACTERISTICS OF SUBSTITUTIONS AND THEIR PROPERTIES

2020 ◽  
Vol 7 (2) ◽  
pp. 34-41
Author(s):  
VLADIMIR NIKONOV ◽  
◽  
ANTON ZOBOV ◽  
Keyword(s):  
Mathematical Expectation ◽  
Point Of View ◽  
Small Range ◽  
Computational Point ◽  
Wide Range ◽  
Bijective Function ◽  
The Difference ◽  
Element Base ◽  
Selection Of

The construction and selection of a suitable bijective function, that is, substitution, is now becoming an important applied task, particularly for building block encryption systems. Many articles have suggested using different approaches to determining the quality of substitution, but most of them are highly computationally complex. The solution of this problem will significantly expand the range of methods for constructing and analyzing scheme in information protection systems. The purpose of research is to find easily measurable characteristics of substitutions, allowing to evaluate their quality, and also measures of the proximity of a particular substitutions to a random one, or its distance from it. For this purpose, several characteristics were proposed in this work: difference and polynomial, and their mathematical expectation was found, as well as variance for the difference characteristic. This allows us to make a conclusion about its quality by comparing the result of calculating the characteristic for a particular substitution with the calculated mathematical expectation. From a computational point of view, the thesises of the article are of exceptional interest due to the simplicity of the algorithm for quantifying the quality of bijective function substitutions. By its nature, the operation of calculating the difference characteristic carries out a simple summation of integer terms in a fixed and small range. Such an operation, both in the modern and in the prospective element base, is embedded in the logic of a wide range of functional elements, especially when implementing computational actions in the optical range, or on other carriers related to the field of nanotechnology.

Sign in / Sign up

Export Citation Format

Share Document