Reactive weight based buffer management policy for DTN routing protocols

Delay-tolerant networks (DTNs) are distinguished by low connectivity and/or unreliable links, dynamic topology change and network partitioning. Therefore, each node transmits the multiple copies of the message to increase its delivery likelihood. This phenomenon produces congestion that results in t...

Full description

Saved in:
Bibliographic Details
Main Authors: Rashid, Sulma, Ayub, Qaisar, Abdullah, Abdul Hanan
Format: Article
Published: Springer Netherlands 2014
Subjects:
Online Access:http://eprints.utm.my/id/eprint/55192/
http://dx.doi.org/10.1007/s11277-014-2066-7
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Universiti Teknologi Malaysia
id my.utm.55192
record_format eprints
spelling my.utm.551922016-09-04T00:56:50Z http://eprints.utm.my/id/eprint/55192/ Reactive weight based buffer management policy for DTN routing protocols Rashid, Sulma Ayub, Qaisar Abdullah, Abdul Hanan QA75 Electronic computers. Computer science Delay-tolerant networks (DTNs) are distinguished by low connectivity and/or unreliable links, dynamic topology change and network partitioning. Therefore, each node transmits the multiple copies of the message to increase its delivery likelihood. This phenomenon produces congestion that results in the dropping of earlier stored messages. The objective of buffer management policy is to determine which message should be eliminated when the buffer overflow happens. The existing buffer management policies can be divided into two categories: (i) local knowledge-based and (ii) global knowledge based. In a DTN environment, getting global knowledge is impossible and local knowledge-based policies are more practical. This study focuses on the local knowledge-based policies in order to reduce the drop ratio and maximize the delivery. In this paper, we presented a buffer scheduling policy called as weight based drop policy. In this proposed scheme, we dynamically adjust message weight criteria assuming message’s properties, which are message size, remaining time-to-live, message stay time in queue, hop count, and replication count. In order to utilize the buffer efficiently we use weight criteria for finding the most appropriate message for drop and rank the forward messages to its neighboring nodes. The simulation performed in ONE simulator. The simulation results of weight based drop policy by using map based mobility movement outperformed the existing DLA, FIFO, MOFO, SHIL and LIFO in terms of reducing a number of transmission, dropped messages, overhead and enhanced delivery and buffer time average. Springer Netherlands 2014 Article PeerReviewed Rashid, Sulma and Ayub, Qaisar and Abdullah, Abdul Hanan (2014) Reactive weight based buffer management policy for DTN routing protocols. Wireless Personal Communications, 80 (3). pp. 993-1010. ISSN 0929-6212 http://dx.doi.org/10.1007/s11277-014-2066-7 DOI:10.1007/s11277-014-2066-7
institution Universiti Teknologi Malaysia
building UTM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Teknologi Malaysia
content_source UTM Institutional Repository
url_provider http://eprints.utm.my/
topic QA75 Electronic computers. Computer science
spellingShingle QA75 Electronic computers. Computer science
Rashid, Sulma
Ayub, Qaisar
Abdullah, Abdul Hanan
Reactive weight based buffer management policy for DTN routing protocols
description Delay-tolerant networks (DTNs) are distinguished by low connectivity and/or unreliable links, dynamic topology change and network partitioning. Therefore, each node transmits the multiple copies of the message to increase its delivery likelihood. This phenomenon produces congestion that results in the dropping of earlier stored messages. The objective of buffer management policy is to determine which message should be eliminated when the buffer overflow happens. The existing buffer management policies can be divided into two categories: (i) local knowledge-based and (ii) global knowledge based. In a DTN environment, getting global knowledge is impossible and local knowledge-based policies are more practical. This study focuses on the local knowledge-based policies in order to reduce the drop ratio and maximize the delivery. In this paper, we presented a buffer scheduling policy called as weight based drop policy. In this proposed scheme, we dynamically adjust message weight criteria assuming message’s properties, which are message size, remaining time-to-live, message stay time in queue, hop count, and replication count. In order to utilize the buffer efficiently we use weight criteria for finding the most appropriate message for drop and rank the forward messages to its neighboring nodes. The simulation performed in ONE simulator. The simulation results of weight based drop policy by using map based mobility movement outperformed the existing DLA, FIFO, MOFO, SHIL and LIFO in terms of reducing a number of transmission, dropped messages, overhead and enhanced delivery and buffer time average.
format Article
author Rashid, Sulma
Ayub, Qaisar
Abdullah, Abdul Hanan
author_facet Rashid, Sulma
Ayub, Qaisar
Abdullah, Abdul Hanan
author_sort Rashid, Sulma
title Reactive weight based buffer management policy for DTN routing protocols
title_short Reactive weight based buffer management policy for DTN routing protocols
title_full Reactive weight based buffer management policy for DTN routing protocols
title_fullStr Reactive weight based buffer management policy for DTN routing protocols
title_full_unstemmed Reactive weight based buffer management policy for DTN routing protocols
title_sort reactive weight based buffer management policy for dtn routing protocols
publisher Springer Netherlands
publishDate 2014
url http://eprints.utm.my/id/eprint/55192/
http://dx.doi.org/10.1007/s11277-014-2066-7
_version_ 1643653722384891904