Impact of Mobility Models on DLA (Drop Largest) Optimized DTN Epidemic Routing Protocol

Rashid, Sulma; Ayub, Qaisar; Zahid, Mohd Soperi Mohd; Abdullah, Abdul Hanan

doi:10.5120/2278-2950

Cited by 12 publications

(10 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Rashid et al propose dropping the message in the node if its size is larger than or equal to the incoming message in [19]. In the same year, Rashid et al [10] also introduce a variety of existing buffer management policies and performance evaluation indicators, and propose a Drop Largest (DLA) sorting strategy that drops large-size messages when the node buffer becomes congested. Wang et al propose a knapsack-based message scheduling and drop strategy for DTN in [20], and calculate utility values of those messages by quantifying the impact of replicating or dropping them.…”

Section: Single Standardmentioning

confidence: 99%

“…They do not consider the impact of collaboration between neighbors on the performance of the buffer management strategy. In addition, many works only consider the message attributes, while ignoring the characteristics of the nodes in MON [9][10][11]. Taking into account the above facts, we propose a reasonable queuing strategy for the buffer management strategy from the perspective of the message and node, which includes the size of the message, the hop count, time-to-live (TTL), and the node utility; meanwhile, our strategy includes an efficient message migration scheme that effectively deletes and transfers messages.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Combinational Buffer Management Scheme in Mobile Opportunistic Network

Yuan

2017

Future Internet

View full text Add to dashboard Cite

Nodes in Mobile Opportunistic Network (MON) have to cache packets to deal with the intermittent connection. The buffer management strategy obviously impacts the performance of MON, and it attracts more attention recently. Due to the limited storage capacity of nodes, traditional buffer management strategies just drop messages based on the property of message, and they neglect the collaboration between neighbors, resulting in an ineffective performance improvement. Therefore, effective buffer management strategies are necessary to ensure that each node has enough buffer space to store the message when the node buffer is close to congestion. In this paper, we propose a buffer management strategy by integrating the characteristics of messages and nodes, and migrate the redundant messages to the neighbor to optimize the total utility, instead of deleting them. The simulation experiment results show that it can obviously improve the delivery ratio, the overhead ratio and the average delays, and reduce the amount of hops compared with the traditional ones.

show abstract

Section: Single Standardmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A Combinational Buffer Management Scheme in Mobile Opportunistic Network

Yuan

2017

Future Internet

View full text Add to dashboard Cite

show abstract

“…Ayub et al (2010) proposed a new message forwarding technique by studying the impact of packet forwarding order with ER to optimize its performance in terms of delivery probability. In the same field and to enhance the performance of ER, Rashid et al (2011) study the impact of buffer management Drop Largest (DLA). The study described how to drop large-size message when the node buffer is congested with five mobility models.…”

Section: Epidemic Routing Protocolmentioning

confidence: 99%

Survey and Comparison of Operating Concept for Routing Protocols in DTN

Ahmed¹,

Omar²,

Hassan³

2016

Journal of Computer Science

View full text Add to dashboard Cite

Delay Tolerant Network (DTN) are promising techniques to enable data transmission in challenging scenarios where sophisticated infrastructure is not available and the end-to-end path does not exist at the moment of data transmission. These networks are characterized by a long delay, intermittent connectivity and high error rates. Furthermore, the dynamic topology of the network may change randomly. Therefore, routing is one of the most crucial issues that affect the performance of DTN in terms of data delivery, latency and using resources if node mobility is considered. The routing design in DTN raises many challenges to the networks. Therefore, the problem of how to route a packet from one node to another in DTN is of the essence. This paper puts forward a rigorous survey of various routing protocols as well as performs a comparison of diverse routing strategies regarding significant issues in DTN.

show abstract

“…To date, past works have considered classical buffer management policies such as DO, Drop Random (DR), LIFO and FIFO for use in DTNs [38][39][40][41]. In DO, a node drops the bundle with the shortest TTL.…”

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

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

Impact of Mobility Models on DLA (Drop Largest) Optimized DTN Epidemic Routing Protocol

Cited by 12 publications

References 16 publications

A Combinational Buffer Management Scheme in Mobile Opportunistic Network

A Combinational Buffer Management Scheme in Mobile Opportunistic Network

Survey and Comparison of Operating Concept for Routing Protocols in DTN

A novel queue management policy for delay-tolerant networks

Contact Info

Product

Resources

About