Contact duration aware data replication in Delay Tolerant Networks

Zhuo, Xuejun; Li, Qinghua; Gao, Wei; Dai, Yanwei

doi:10.1109/icnp.2011.6089057

Cited by 65 publications

(54 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…However, this study is only valid for bus based networks for obvious reasons, and it does not provide a realistic and accurate model to characterize the distribution of contact duration for a generic urban VANET. Due to lack of credible models for the urban vehicular environment, the current proposed forwarding protocols can only be investigated based on the models obtained from human mobility [9], [10], which may lead to misleading results in the vehicular environment due to the significant differences between human and vehicular mobilities. Therefore, it is critical to have a profound understanding of the contact duration distribution for opportunistic vehicular environments.…”

Section: Introductionmentioning

confidence: 99%

Exponential and Power Law Distribution of Contact Duration in Urban Vehicular Ad Hoc Networks

Jin

Hanzo

et al. 2013

IEEE Signal Process. Lett.

View full text Add to dashboard Cite

Abstract-Contact duration between moving vehicles is one of the key metrics in vehicular ad hoc networks (VANETs), that critically influences the design of routing schemes and network throughput. Due to prohibitive costs to collect enough realistic contact records, little experimental work has been conducted to study the contact duration in urban VANETs. In this work, we carry out an extensive experiment involving tens of thousands of operational taxis in Beijing city. Based on studying this newly collected Beijing trace and the existing Shanghai trace, we find an invariant characteristic that there exists a characteristic time point, up to which the contact duration obeys an exponential distribution that includes at least 80% of the whole distribution, while beyond which it decays as a power law one. This property is in sharp contrast to the recent empirical data studies based on human mobility, where the contact duration exhibits a power law distribution. Our observations thus provide fundamental guidelines for the design of new urban VANETs' routing protocols and their performance evaluation.Index Terms-Contact duration, mobility modelling, urban vehicular ad hoc network.

show abstract

Section: Introductionmentioning

confidence: 99%

Exponential and Power Law Distribution of Contact Duration in Urban Vehicular Ad Hoc Networks

Jin

Hanzo

et al. 2013

IEEE Signal Process. Lett.

View full text Add to dashboard Cite

show abstract

“…However, instead of data access, most methods focus on data routing. Zhuo et al [16] proposed a contact duration aware data replication scheme in delay-tolerant network, which optimized the data availability based on the detail information of node contact. The number of contacts and the time of each contact lasting are needed to decide the location of each replica.…”

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

“…Zhuo et al [21] propose a packet-level replication protocol, which uses erasure coding to encode large messages into smaller packets, to address the problem of limited contact duration. However, this technique requires replication of packets at each node, which is expensive in a DTN.…”

Section: Related Workmentioning

confidence: 99%

“…Numerous routing protocols [7][8][9][10][11][12][13][14][15][16][17][18][19][20][21][22][23][24] have been proposed for DTNs. Routing algorithms can exploit mobility, but they can not essentially change the mobility characteristics inherent of a networks participating nodes.…”

Section: Related Workmentioning

confidence: 99%

A Message Transfer Framework for Enhanced Reliability in Delay-Tolerant Networks

Yasmeen¹,

Nguyen²,

Huda³

et al. 2015

NPA

View full text Add to dashboard Cite

Delay-tolerant networks (DTNs) can tolerate disruption on end-to-end paths by taking advantage of temporal links emerging between nodes as nodes move in the network. Intermediate nodes store messages before forwarding opportunities become available. A series of encounters (i.e., coming within mutual transmission range) among different nodes will eventually deliver the message to the desired destination. The message delivery performance in a DTN (such as delivery ratio and end-to-end delay) highly depends on the time elapsed between encounters 52 www.macrothink.org/npa Network Protocols and Algorithms ISSN 1943-3581 2015 and the time two nodes remain in each others communication range once a contact is established. As messages are forwarded opportunistically among nodes, it is important to have sufficient contact opportunities in the network for faster, more reliable delivery of messages. We propose a simple yet efficient method for improving the performance of a DTN by increasing the contact duration of encountered nodes (i.e., mobile devices). Our proposed sticky transfer framework and protocol enable nodes in DTNs to collect neighbors' information, evaluate their movement patterns and amounts of data to transfer in order to make decisions of whether to "stick" with a neighbor to complete the necessary data transfers. The sticky transfer framework can be combined with any DTN routing protocol to improve its performance. We evaluate our framework through simulations and measure several network performance metrics. Simulation results show that the proposed framework can improve the message delivery ratio, end-to-end delay, overhead ratio, buffer occupancy, number of disrupted message transmissions and so on. It can be well adopted for challenged scenarios where larger messages sizes need to be delivered with application deadline constraints. Furthermore, performance of the DTN improved (upto 43%) at higher node densities and (up to 49%) under increased mobility conditions.

show abstract

Contact duration aware data replication in Delay Tolerant Networks

Cited by 65 publications

References 28 publications

Exponential and Power Law Distribution of Contact Duration in Urban Vehicular Ad Hoc Networks

Exponential and Power Law Distribution of Contact Duration in Urban Vehicular Ad Hoc Networks

RHPMAN: Replication in Highly Partitioned Mobile Ad Hoc Networks

A Message Transfer Framework for Enhanced Reliability in Delay-Tolerant Networks

Contact Info

Product

Resources

About