Data Delivery in Delay Tolerant Networks: A Survey

Kapadia, Shyam; Krishnamachari, Bhaskar; Zhang, Lin

doi:10.5772/12944

Cited by 14 publications

(9 citation statements)

References 53 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…One of the basic routing techniques used in a DTN for delivering packets is Epidemic Routing [2]. It was introduced by researchers Vahdat and Becker in the year 2000.…”

Section: Related Workmentioning

confidence: 99%

“…It was introduced by researchers Vahdat and Becker in the year 2000. In Epidemic Routing when two nodes encounter each other they exchange all the messages they have and after transfer is done, both nodes will have same messages [2] [9]. Likewise in Epidemic Routing every node tries to exchange all of its information with the node it encounters.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Region Based Routing in Delay Tolerant Networks

Bhotmange

Penurkar²

2015

2015 International Conference on Computing Communication Control and Automation

View full text Add to dashboard Cite

Delay Tolerant Networks (DTN) is the networks that have no end to end transmission or communication paths. In delay tolerant networks nodes are intermittently connected which results in very high error rates, high latency with asymmetric data rates. Also the transmission delays are very long, hence such networks are also known as Disruption Tolerant Networks. In DTN nodes are continuously moving (mobile) and owing to the absence of dedicated path from source to the destination, the probability to deliver a packet (message) to its destination is quite low. Also resources like bandwidth of the network and storage capacity of the nodes are finite. With such restricted constraints increasing delivery ratio is a difficult task. To achieve high delivery ratio in DTN, researchers have proposed Flooding Based Algorithms. This approach consumes high network bandwidth thereby reducing its performance. So store-carry-and-forward approach was invented which resulted in the invention of many new algorithms which outperformed previous flooding based algorithms. In this paper we have proposed two algorithms based on Region Based Routing which gives good delivery ratio, average latency and overhead ratio compared to First Contact, Epidemic and Spray-and-Wait router.

show abstract

“…One of the basic routing techniques used in a DTN for delivering packets is Epidemic Routing [2]. It was introduced by researchers Vahdat and Becker in the year 2000.…”

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Region Based Routing in Delay Tolerant Networks

Bhotmange

Penurkar²

2015

2015 International Conference on Computing Communication Control and Automation

View full text Add to dashboard Cite

show abstract

“…However, the buffer size of devices may be limited, which may lead to bundle loss and low delivery ratios, especially during high traffic loads [5,6,10]. In contrast, quota-based protocols employ a limited number of replicas, which improve network resource usage [11]. This means, under quota protocols, if senders forward all replicas of a bundle to encountered vehicles, they are no longer allowed to replicate the said bundle.…”

Section: Introductionmentioning

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

“…In delay-tolerant network, replication is widely used to improve the performance of data delivery [15]. However, instead of data access, most methods focus on data routing.…”

Section: Related Workmentioning

confidence: 99%

RHPMAN: Replication in Highly Partitioned Mobile Ad Hoc Networks

Shi

Chen

2014

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

Accessing data in mobile ad hoc networks is a challenging problem, which is caused by frequent network partitions due to node mobility and due to the impairments of wireless communications. The partitioning pattern is studied by examining the statistics of network partitions for a number of mobility models. Then the relation between the network partitioning pattern and the effectiveness of the data replication scheme is established. Based on these results, a novel replication scheme, RHPMAN (replication in highly partitioned mobile ad hoc network), taking into account the fact that the network is often partitioned in smaller portions, enjoying only intermittent connectivity thanks to mobile nodes traveling across partition, is proposed. In RHPMAN, data items are replicated to the nodes with rather stable neighboring topology and with enough resources. A semiprobabilistic data disseminating protocol is employed to distribute the replicas and propagate the updates, which can identify the potential mobile nodes traveling across partitions to maximize data delivery. To maintain replica consistency, a weak consistency model is utilized to ensure that all updates eventually propagate to all replicas in a finite delay. Simulation results demonstrate that RHPMAN can achieve high data availability with low overhead.

show abstract

Data Delivery in Delay Tolerant Networks: A Survey

Cited by 14 publications

References 53 publications

Region Based Routing in Delay Tolerant Networks

Region Based Routing in Delay Tolerant Networks

A novel queue management policy for delay-tolerant networks

RHPMAN: Replication in Highly Partitioned Mobile Ad Hoc Networks

Contact Info

Product

Resources

About