Minimum makespan workload dissemination in DTNs: making full utilization of computational surplus around

Authors:
Sheng Zhang;Jie Wu;Sanglu Lu
Affiliations:
State Key Lab. for Novel Software Technology, Nanjing University, China, Nanjing, China;Department of Computer and Information Sciences, Temple University, USA, Philadelphia, PA, USA;State Key Lab. for Novel Software Technology, Nanjing University, China, Nanjing, China
Venue:
Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing
Year:
2013

Citing 5
Cited 0

Introduction to algorithms

Introduction to algorithms
A delay-tolerant network architecture for challenged internets

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Impact of Human Mobility on Opportunistic Forwarding Algorithms

IEEE Transactions on Mobile Computing
DTN routing as a resource allocation problem

Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Win-Coupon: An incentive framework for 3G traffic offloading

ICNP '11 Proceedings of the 2011 19th IEEE International Conference on Network Protocols

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper poses the following problem: given a task that originates at some node in a Delay Tolerant Network (DTN), how are we to disseminate the workload during pairwise contacts to minimize the makespan? We first investigate the scenario in which each node has access to an oracle that knows global and future knowledge of node mobility, and we propose a centralized polynomial-time optimal algorithm. We then develop a distributed dissemination protocol, D2, which maintains r-hop neighborhood information at individual nodes. D2 makes dissemination decisions based on the estimations of the potential computational capacities and the future workloads of DTN nodes. Using trace-driven simulations, we show that, D2 with only 1-hop information is already near-optimal in a wide variety of environments, and the performance gap becomes smaller as the amount of information maintained at individual nodes increases.