Article

Max-contribution: on optimal resource allocation in delay tolerant networks

Authors:

Jaeseong Jeong,

Song ChongAuthors Info & Claims

INFOCOM'10: Proceedings of the 29th conference on Information communications

Pages 1136 - 1144

Published: 14 March 2010 Publication History

Abstract

This is by far the first paper considering joint optimization of link scheduling, routing and replication for disruption-tolerant networks (DTNs). The optimization problems for resource allocation in DTNs are typically solved using dynamic programming which requires knowledge of future events such as meeting schedules and durations. This paper defines a new notion of optimality for DTNs, called snapshot optimality where nodes are not clairvoyant, i.e., cannot look ahead into future events, and thus decisions are made using only contemporarily available knowledge. Unfortunately, the optimal solution for snapshot optimality still requires solving an NPhard problem of maximum weight independent set and a global knowledge of who currently owns a copy and what their delivery probabilities are. This paper presents a new efficient approximation algorithm, called Distributed Max-Contribution (DMC) that performs greedy scheduling, routing and replication based only on locally and contemporarily available information. Through a simulation study based on real GPS traces tracking over 4000 taxies for about 30 days in a large city, DMC outperforms existing heuristically engineered resource allocation algorithms for DTNs.

References

[1]

S. Merugu, M. Ammar, and E. Zegura, "Routing in space and time in networks with predictable mobility," in Technical report: GIT-CC-04-07. College of Computing, Georgia Institute of Technology, 2004.

[2]

A. Vahdat and D. Becker, "Epidemic routing for partially-connected ad hoc networks," in Technical Report, CS-200006, Duke University, 2000.

[3]

R. Ramanathan, R. Hansen, P. Basu, R. R. Hain, and R. Krishnan, "Prioritized epidemic routing for opportunistic networks," in Proceedings of ACM MobiSys workshop on Mobile Opportunistic Networks (MobiOpp), 2007.

Digital Library

[4]

S. Basagni, I. Chlamtac, V. Syrotiuk, and B. Woodward, "A distance routing effect algorithm for mobility (dream)," in Proceedings of ACM MobiCom, 1998.

Digital Library

[5]

A. Lindgren, A. Doria, and O. Schelen, "Probabilistic routing in intermittently connected networks," ACM SIGMOBILE Mobile Computing and Communications Review, vol. 7, no. 3, pp. 19-20, 2003.

Digital Library

[6]

J. Lebrun, C.-N. Chuah, D. Ghosal, and M. Zhang, "Knowledge-based opportunistic forwarding in vehicular wireless ad hoc networks," in Proceedings of IEEE Vehicular Technology Conference, 2004.

[7]

H. Dubois-Ferriere, M. Grossglauser, and M. Vetterli, "Age matters: Efficient route discovery in mobile ad hoc networks using encounter ages," in Proceedings of ACM MobiHoc, 2003.

Digital Library

[8]

T. Spyropoulos, K. Psounis, and C. Raghavendra, "Spray and wait: An efficient routing scheme for intermittently connected mobile networks," in Proceedings of ACM SIGCOMM, 2005.

Digital Library

[9]

S. J. U. Traffic Information Grid Team, Grid Computing Center, "Shanghai taxi trace data," http://wirelesslab.sjtu.edu.cn/.

[10]

B. City, "Bucheon traffic information center," http://www.bcits.go.kr/.

[11]

J. Leguay, T. Friedman, and V. Conan, "Dtn routing in a mobility pattern space," in Proceedings of ACM Chants Workshop, 2005.

[12]

E. Altman, G. Neglia, F. D. Pellegrini, and D. Miorandi, "Decentralized stochastic control of delay tolerant networks," in Proceedings of IEEE INFOCOM, 2009.

[13]

C. Liu and J. Wu, "An optimal probabilistic forwarding protocolin delay tolerant networks," in Proceedings of ACM MobiHoc, 2009.

Digital Library

[14]

A. Balasubramanian, B. N. Levine, and A. Venkataramani, "DTN routing as a resource allocation problem," in Proceedings of ACM SIGCOMM, 2007.

Digital Library

[15]

K. Lee, Y. Yi, I. Rhee, J. Jeong, H. Won, and S. Chong, "Maxcontribution: On optimal resource allocation in delay tolerant networks," in Technical report, KAIST, 2009, available at http://lanada.kaist.ac.kr/ pubs/dmc.pdf.

[16]

Y. Yi, A. Proutiere, and M. Chiang, "Complexity in wireless scheduling: Impact and tradeoffs," in Proceedings of ACM Mobihoc, 2008.

Digital Library

[17]

V. Erramilli, M. Crovella, A. Chaintreau, and C. Diot, "Delegation forwarding," in Proceedings of ACM MobiHoc, 2008.

Digital Library

[18]

M. Kim and D. Kotz, "Periodic properties of user mobility and accesspoint popularity," Journal of Personal and Ubiquitous Computing, vol. 11, no. 6, pp. 465-479, August 2007.

Digital Library

[19]

K. Lee, S. Hong, S. Kim, I. Rhee, and S. Chong, "Slaw : A new human mobility model," in Proceedings of IEEE INFOCOM, 2009.

[20]

J. Burgess, B. Gallagher, D. Jensen, and B. Levine, "Maxprop: Routing for vehicle-based disruption-tolerant networking," in Proceedings of IEEE INFOCOM, 2006.

[21]

A. Krifa, C. Barakat, and T. Spyropoulos, "An optimal joint scheduling and drop policy for delay tolerant networks," in Proceedings of the WoWMoM Workshop on Autonomic and Opportunistic Communications, 2008.

Digital Library

Cited By

Hao SDuan L(2019)Economics of Age of Information Management under Network ExternalitiesProceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing10.1145/3323679.3326511(131-140)Online publication date: 2-Jul-2019
https://dl.acm.org/doi/10.1145/3323679.3326511
Wu YDeng SHuang H(2015)Energy constraint beaconing control in delay tolerant networks with multiple destinationsWireless Communications & Mobile Computing10.1002/wcm.248715:18(2167-2178)Online publication date: 25-Dec-2015
https://dl.acm.org/doi/10.1002/wcm.2487
Liu MYang YQin Z(2011)A survey of routing protocols and simulations in delay-tolerant networksProceedings of the 6th international conference on Wireless algorithms, systems, and applications10.5555/2033150.2033172(243-253)Online publication date: 11-Aug-2011
https://dl.acm.org/doi/10.5555/2033150.2033172
Show More Cited By

Max-contribution: on optimal resource allocation in delay tolerant networks
1. Theory of computation
  1. Theory and algorithms for application domains
    1. Machine learning theory
      1. Reinforcement learning

Recommendations

Max Contribution: An Online Approximation of Optimal Resource Allocation in Delay Tolerant Networks
In this paper, a joint optimization of link scheduling, routing and replication for delay-tolerant networks (DTNs) has been studied. The optimization problems for resource allocation in DTNs are typically solved using dynamic programming which requires ...
A modified VNS metaheuristic for max-bisection problems

Variable neighborhood search (VNS) metaheuristic as presented in Festa et al. [Randomized heuristics for the MAX-CUT problem, Optim. Methods Software 17 (2002) 1033-1058] can obtain high quality solution for max-cut problems. Therefore, it is worthwhile ...
Max-min fair allocation for resources with hybrid divisibilities
Highlights
- An approaximation algorithm for the case with bounded number of divisible resources.
Abstract
Resource allocation is a classic problem in economics and computer science. The application scenarios of resource allocation include inheritance settlements, computation resource sharing and so on. This paper focuses on the max-min ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

INFOCOM'10: Proceedings of the 29th conference on Information communications

March 2010

2990 pages

ISBN:9781424458363

Publisher

IEEE Press

Publication History

Published: 14 March 2010

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 15 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Hao SDuan L(2019)Economics of Age of Information Management under Network ExternalitiesProceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing10.1145/3323679.3326511(131-140)Online publication date: 2-Jul-2019
https://dl.acm.org/doi/10.1145/3323679.3326511
Wu YDeng SHuang H(2015)Energy constraint beaconing control in delay tolerant networks with multiple destinationsWireless Communications & Mobile Computing10.1002/wcm.248715:18(2167-2178)Online publication date: 25-Dec-2015
https://dl.acm.org/doi/10.1002/wcm.2487
Liu MYang YQin Z(2011)A survey of routing protocols and simulations in delay-tolerant networksProceedings of the 6th international conference on Wireless algorithms, systems, and applications10.5555/2033150.2033172(243-253)Online publication date: 11-Aug-2011
https://dl.acm.org/doi/10.5555/2033150.2033172
Li YSu GHui PJin DSu LZeng LLegendre FHelmy A(2011)Multiple mobile data offloading through delay tolerant networksProceedings of the 6th ACM workshop on Challenged networks10.1145/2030652.2030665(43-48)Online publication date: 23-Sep-2011
https://dl.acm.org/doi/10.1145/2030652.2030665
Ryu JBhargava VPaine NShakkottai SVaidya NBanerjee SKatabi D(2010)Back-pressure routing and rate control for ICNsProceedings of the sixteenth annual international conference on Mobile computing and networking10.1145/1859995.1860037(365-376)Online publication date: 20-Sep-2010
https://dl.acm.org/doi/10.1145/1859995.1860037
Jeong JLee KYi YRhee IChong SLee DFdida SPartridge CChoi YFriedman TMoon SRaychaudhuri D(2010)Opportunistic shortest path forwarding in delay tolerant networksProceedings of the 5th International Conference on Future Internet Technologies10.1145/1853079.1853085(14-17)Online publication date: 16-Jun-2010
https://dl.acm.org/doi/10.1145/1853079.1853085

View Options

View options

Media

Figures

Other

Tables

View Table of Contents