Buffer Management For Preferential Delivery In Opportunistic Delay Tolerant Networks

Fathima, G.; Wahidabanu, R. S. D.

doi:10.5121/ijwmn.2011.3502

Cited by 19 publications

(19 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…We categorize current buffer management schemes into two groups: (a) local knowledge schemes [15,17,[25][26][27][28][29][30] and (b) global knowledge schemes [16,[19][20][21][22][23][31][32][33][34][35]. In the following sections, we review drop/forward policies in each category.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

A novel queue management policy for delay-tolerant networks

Iranmanesh

2016

J Wireless Com Network

View full text Add to dashboard Cite

Delay-tolerant networks (DTNs) have attracted increasing attention from governments, academia and industries in recent years. They are designed to provide a communication channel that exploits the inherent mobility of trams, buses and cars. However, the resulting highly dynamic network suffers from frequent disconnections, thereby making node-to-node communications extremely challenging. Researchers have thus proposed many routing/forwarding strategies in order to achieve high delivery ratios and/or low latencies and/or low overheads. Their main idea is to have nodes store and carry information bundles until a forwarding opportunity arises. This, however, creates the following problems. Nodes may have short contacts and/or insufficient buffer space. Consequently, nodes need to determine (i) the delivery order of bundles at each forwarding opportunity and (ii) the bundles that should be dropped when their buffer is full. To this end, we propose an efficient scheduling and drop policy for use under quota-based protocols. In particular, we make use of the encounter rate of nodes and context information such as time to live, number of available replicas and maximum number of forwarded bundle replicas to derive a bundle's priority. Simulation results, over a service quality metric comprising of delivery, delay and overhead, show that the proposed policy achieves up to 80 % improvement when nodes have an infinite buffer and up to 35 % when nodes have a finite buffer over six popular queuing policies: Drop Oldest (DO), Last Input First Output (LIFO), First Input First Output (FIFO), Most FOrwarded first (MOFO), LEast PRobable first (LEPR) and drop bundles with the greatest hop-count (HOP-COUNT).

show abstract

Section: Related Workmentioning

confidence: 99%

“…In [29], Fathima and Wahidabanu classify bundles based on their degree of importance into three priority queues: high, medium and low. When a node's buffer is full, those with a low priority are dropped first followed by those with a medium priority.…”

Section: Local Knowledge Schemesmentioning

confidence: 99%

A novel queue management policy for delay-tolerant networks

Iranmanesh

2016

J Wireless Com Network

View full text Add to dashboard Cite

show abstract

“…There are also some works [17][18][19] where the authors explain how to improve the dissemination process of epidemic protocols in order to save battery energy. In the case of buffer management, and the influence in the messages dissemination process, some authors [20][21][22] evaluate the use and optimisations of the buffer trough priority rules to deliver the messages, without performance loss in the information transmission process.…”

Section: Related Workmentioning

confidence: 99%

Improving Message Delivery Performance in Opportunistic Networks Using a Forced-Stop Diffusion Scheme

Herrera-Tapia

Hernández-Orallo

Tomás

et al. 2016

Ad-Hoc, Mobile, and Wireless Networks

View full text Add to dashboard Cite

Abstract. The performance of mobile opportunistic networks strongly depends on contact duration. If the contact lasts less than the required transmission times, some messages will not get delivered, and the whole diffusion scheme will be seriously affected. In this paper we propose a new diffusion method, called Forced-Stop, that is based on controlling node mobility to guarantee a complete message transfer. Using the ONE simulator and realistic mobility traces, we compared our proposal with the classical Epidemic diffusion. We show that Forced-Stop improves the message delivery performance, increasing the delivery ratio up to 30%, and reducing the latency of message delivery up to 40%, with a limited impact on buffer utilisation and message relaying. These results can be a relevant indication to the designers of opportunistic network applications that could integrate in their products strategies to inform the user about the need to temporarily stop in order to favor the overall data delivery.

show abstract

“…In the case of buffer management, some authors [40,42,117] evaluate the use of the buffer through priority rules in an attempt to deliver messages without performance loss in the information transmission process.…”

Section: Related Effortsmentioning

confidence: 99%

“…In particular, one of the main constrains is memory capacity, known as buffer memory in the wireless networks context. For buffer management, several works [40,42,117] evaluate the influence of the memory capacity on the delivery message ratio.…”

Section: Buffer Management Proposalmentioning

confidence: 99%

Improving Message Dissemination in Opportunistic Networks

Tapia¹

View full text Add to dashboard Cite

Buffer Management For Preferential Delivery In Opportunistic Delay Tolerant Networks

Abstract: ABSTRACT

Cited by 19 publications

References 24 publications

A novel queue management policy for delay-tolerant networks

A novel queue management policy for delay-tolerant networks

Improving Message Delivery Performance in Opportunistic Networks Using a Forced-Stop Diffusion Scheme

Improving Message Dissemination in Opportunistic Networks

Contact Info

Product

Resources

About