Adaptive Optimal Buffer Management Policies for Realistic DTN

Li, Yong; Qian, Mengjiong; Jin, Depeng; Su, Li; Zeng, Lieguang

doi:10.1109/glocom.2009.5426161

Cited by 45 publications

(26 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Contrary to previous work [16,19,20,22,23], which requires global knowledge, QM-EBRP takes advantage of local information. An example of local information used by QM-EBRP is the maximum number of forwarded replicas.…”

Section: Introductionmentioning

confidence: 82%

“…In our work, we avoid these problems by using local information. In another work [23], Yong et al present a drop policy that uses the control channel in [22] to help nodes obtain global network information such as transmission opportunities of bundles, node meeting times and duration. However, forwarding issue is not addressed.…”

Section: Global Knowledge Schemesmentioning

confidence: 99%

“…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 2 more Smart Citations

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: Introductionmentioning

confidence: 82%

Section: Global Knowledge Schemesmentioning

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

show abstract

“…Mahendran et al [Mahendran and Murthy, 2013] show that buffer dimensioning is essential to design an efficient multi-copy delay tolerant routing solution, and propose an analytical model to systematically quantify the overall UPN buffer size. The adaptive optimal buffer management scheme [Li et al, 2009] shows that when there are buffer space limitations, selecting the appropriate messages to drop is critical under multi-copy routing solutions. Thus, basic message dropping policies maximize the average delivery rate or minimize the average delivery delay.…”

Section: Discussionmentioning

confidence: 99%

Enabling wireless cooperation in user provided networks

Rolla

Curado

2015

2015 IFIP/IEEE International Symposium on Integrated Network Management (IM)

View full text Add to dashboard Cite

“…Some of them discuss how to save the buffer resources which is important for some DTN applications like the sensors network. The concept of message ferrying is proposed in [8] where they proposed allocating the buffer resources between users at different connections sessions. In our aircraft application, we assume unlimited buffer space and we consider the aircraft communication bandwidth as the only resource.…”

Section: Related Workmentioning

confidence: 99%