Enhanced buffer management policy that utilises message properties for delay-tolerant networks

Shin, Kwangcheol; Kim, Soontae

doi:10.1049/iet-com.2010.0422

Cited by 33 publications

(25 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

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%

“…Moreover, if the minimum utility value of bundles in a sender's queue is greater than the maximum utility value of bundles in a receiver's node, the sender will only forward bundles if the receiver has free space. In a similar work to [33], Shin and Kim [34] propose a forward/drop policy that uses, (i) for a given bundle, an estimate of the total number of replicas, in a DTN, and (ii) for a given node, the number of replicas of a bundle it has replicated. Based on the said parameters and the elapsed time since a bundle was generated, a per bundle delivery utility is calculated.…”

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

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%

Section: Global 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

“…Although studies on buffer management in DTNs have recently been published (Lindgren and Phanse, 2006;Li et al, 2009;Krifa et al, 2008;Shin and Kim, 2011), the authors did not consider priority differentiation of messages. In the literature, studies by Soares et al (2009Soares et al ( , 2010 on traffic management strategies supporting CoS in DTNs can be found.…”

Section: Related Workmentioning

confidence: 99%

“…ETR was introduced in our previous work (Shin and Kim, 2011) in order to estimate the total number of replicas of a message in the network. To calculate the ETR of each message in a node without global information, we introduced another message property, my_forword (MF), which is the number of replicas of a message that the node has replicated by itself.…”

Section: Message Properties For the Proposed Policiesmentioning

confidence: 99%

“…The history-based drop policies Krifa et al, 2008), which are designed based on global knowledge of the DTN, outperform traditional buffer management policies in terms of delivery rate and delivery time. Also, we recently studied an enhanced buffer management policy (Shin and Kim, 2011) for DTNs, which uses the estimated total number of replicas of a message and provided improved performance. However, the aforementioned studies on buffer management Krifa et al, 2008;Shin and Kim, 2011) were conducted under the assumption that the priority of every message transmitted is the same.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Traffic management strategy for delay-tolerant networks

Shin

Kim

2012

Journal of Network and Computer Applications

View full text Add to dashboard Cite

Enhanced fuzzy logic‐based spray and wait routing protocol for delay tolerant networks

Jain

Chawla

Soares

et al. 2014

Int J Communication

View full text Add to dashboard Cite

Delay tolerant networks are a class of ad hoc networks that enable data delivery even in the absence of end-to-end connectivity between nodes, which is the basic assumption for routing in ad hoc networks. Nodes in these networks work on store-carry and forward paradigm. In addition, such networks make use of message replication as a strategy to increase the possibility of messages reaching their destination. As contact opportunities are usually of short duration, it is important to prioritize scheduling of messages. Message replication may also lead to buffer congestion. Hence, buffer management is an important issue that greatly affects the performance of routing protocols in delay tolerant networks. In this paper, Spray and Wait routing protocol, which is a popular controlled replication-based protocol for delay tolerant networks, has been enhanced using a new fuzzy-based buffer management strategy Enhanced Fuzzy Spray and Wait Routing, with the aim to achieve increased delivery ratio and reduced overhead ratio. It aggregates three important message properties namely number of replicas of a message, its size, and remaining time-to-live, using fuzzy logic to determine the message priority, which denotes its importance with respect to other messages stored in a node's buffer. It then intelligently selects messages to schedule when a contact opportunity occurs. Because determination of number of replicas of a message in the network is a difficult task, a new method for estimation of the same has been proposed. Simulation results show improved performance of enhanced fuzzy spray and wait routing in terms of delivery ratio and resource consumption. many real life applications such as mobile sensor networks for wildlife tracking, interplanetary communications, underwater networks, pocket switched networks, and vehicular ad hoc networks (VANETs). [5]. These networks use a bundle layer, which is an overlay protocol lying between application layer and transport layer [5]. Bundles are arbitrary size messages consisting of multiple application packets, which are forwarded in store-carry and forward manner.Conventional ad hoc routing protocols fail to work in such environments as they lack continuous end-to-end connectivity between nodes because of frequent link disruptions. Therefore, such networks make use of store-carry-forward strategy to transfer messages between the nodes, that is, the nodes buffer the messages and transfer it when a contact opportunity arises, and this process is repeated until the message eventually reaches its destination. Similarly, a carry and forward scheme is used in VANETs [6]. This is also somewhat similar to the problem of data dissemination in wireless networks, which has been recently studied in [7], where the main objective is to spread a particular content in a network while guaranteeing a low completion time and also minimizing resource consumption. However, the delays between node meetings in DTNs may be very long varying from hours, days to years, and hence nodes must be capable of s...

show abstract

Enhanced buffer management policy that utilises message properties for delay-tolerant networks

Cited by 33 publications

References 14 publications

A novel queue management policy for delay-tolerant networks

A novel queue management policy for delay-tolerant networks

Traffic management strategy for delay-tolerant networks

Enhanced fuzzy logic‐based spray and wait routing protocol for delay tolerant networks

Contact Info

Product

Resources

About