Integrated Sized-Based Buffer Management Policy for Resource-Constrained Delay Tolerant Network

2018 ◽  
Vol 103 (2) ◽  
pp. 1421-1441 ◽  
Author(s):  
Sulma Rashid ◽  
Qaisar Ayub
Keyword(s):  
Buffer Management ◽  
Delay Tolerant Network ◽  
Management Policy ◽  
Resource Constrained ◽  
Delay Tolerant

scholarly journals Correction: Priority Queue Based Reactive Buffer Management Policy for Delay Tolerant Network under City Based Environments

PLoS ONE ◽  
2019 ◽  
Vol 14 (10) ◽  
pp. e0224826
Author(s):  
Qaisar Ayub ◽  
Md Asri Ngadi ◽  
Sulma Rashid ◽  
Hafiz Adnan Habib
Keyword(s):  
Buffer Management ◽  
Priority Queue ◽  
Delay Tolerant Network ◽  
Management Policy ◽  
Delay Tolerant

scholarly journals Priority Queue Based Reactive Buffer Management Policy for Delay Tolerant Network under City Based Environments

PLoS ONE ◽  
2018 ◽  
Vol 13 (2) ◽  
pp. e0191580 ◽  
Author(s):  
Qaisar Ayub ◽  
Asri Ngadi ◽  
Sulma Rashid ◽  
Hafiz Adnan Habib
Keyword(s):  
Buffer Management ◽  
Priority Queue ◽  
Delay Tolerant Network ◽  
Management Policy ◽  
Delay Tolerant

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.

RACOD: Routing Using Ant Colony Optimization in DTN

2020 ◽  
Vol 10 (2) ◽  
pp. 262-275
Author(s):  
Naveen Singh ◽  
Awadhesh Singh
Keyword(s):  
Ant Colony Optimization ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Buffer Management ◽  
Ant Colony ◽  
Delay Tolerant Network ◽  
Management Method ◽  
Hoc Networks ◽  
Delay Tolerant ◽  
Hostile Environments

Background & Objective: Routing is a popular challenge in ad hoc networks. A routing algorithm developed for one type of ad hoc network may be adapted for other. However, such adaptation is very difficult for Delay Tolerant Network (DTN) due to special DTN characteristics like latency, intermittency, disruptions, etc. and its applications in hostile environments like extreme terrestrial and space. Methods: We have used Ant Colony Optimization (ACO) to develop a routing algorithm suited to DTNs. The ants wander for food and after few epochs they find shortest path to it. The ant’s movement in ACO can be mapped with propagation of messages that are replicated in DTN and look for their destination. Also, we apply an efficient buffer management method to boost the performance of our routing algorithm. Results & Conclusion: To highlight the effectiveness of our algorithm, the simulation results have been compared with some leading algorithms available in the literature and have found that our algorithm produces better result than other algorithms in terms of delivery, overhead and probability ratio.

An adaptive and efficient buffer management scheme for resource-constrained delay tolerant networks

2015 ◽  
Vol 22 (7) ◽  
pp. 2189-2201 ◽  
Author(s):  
Momina Moetesum ◽  
Fazle Hadi ◽  
Muhammad Imran ◽  
Abid Ali Minhas ◽  
Athanasios V. Vasilakos
Keyword(s):  
Buffer Management ◽  
Delay Tolerant Networks ◽  
Resource Constrained ◽  
Management Scheme ◽  
Delay Tolerant

scholarly journals ASSESSMENT OF THE PERFORMANCE OF A BUFFER MANAGEMENT SYSTEM TO IMPROVE HIGH PRIORITY MESSAGE DELIVERY TIME LIMIT

2021 ◽  
Vol 9 (01) ◽  
pp. 1092-1104
Author(s):  
Gballou Yao Theophile ◽  
◽  
Toure Kidjegbo Augustin ◽  
Tiecoura Yves ◽  
◽  
...  
Keyword(s):  
Memory Management ◽  
Buffer Management ◽  
Priority Queue ◽  
Time Limit ◽  
Management Policy ◽  
Management Systems ◽  
Message Delivery ◽  
Delivery Time ◽  
Network Overload ◽  
Delay Tolerant

In vehicular delay-tolerant networks, buffer management systems are developed to improve overall performance. However, these buffer memory management systems cannot simultaneously reduce network overload, reduce high priority message delivery time limit, and improve all priority class message delivery rates. As a result, quality of service is not guaranteed. In this paper, we propose a drop policy based on the constitution of two queues according to message weight, the position of the node in relation to the destination and the comparison of the oldness between the high-priority message and the messages in the low-priority queue. The results of the simulations show that compared to the existing buffer management policy based on time-to-live and priority, our strategy simultaneously reduces network overload, reduces the delivery time limit of high-priority messages and allows for an increase in the delivery rate of messages regardless of their priority.

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.

Sign in / Sign up

Export Citation Format

Share Document