Max Contribution: An Online Approximation of Optimal Resource Allocation in Delay Tolerant Networks

Cited 1 time in webofscience Cited 0 time in scopus
  • Hit : 344
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorLee, Kyunghanko
dc.contributor.authorJeong, Jaeseongko
dc.contributor.authorYi, Yungko
dc.contributor.authorWon, Hyungsukko
dc.contributor.authorRhee, Injongko
dc.contributor.authorChong, Songko
dc.date.accessioned2015-04-08T04:51:34Z-
dc.date.available2015-04-08T04:51:34Z-
dc.date.created2014-06-24-
dc.date.created2014-06-24-
dc.date.issued2015-03-
dc.identifier.citationIEEE TRANSACTIONS ON MOBILE COMPUTING, v.14, no.3, pp.592 - 605-
dc.identifier.issn1536-1233-
dc.identifier.urihttp://hdl.handle.net/10203/195597-
dc.description.abstractIn 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 knowledge of future events such as meeting schedules and durations. This paper defines a new notion of approximation to the optimality for DTNs, called snapshot approximation where nodes are not clairvoyant, i.e., not looking ahead into future events, and thus decisions are made using only contemporarily available knowledges. Unfortunately, the snapshot approximation still requires solving an NP-hard problem of maximum weighted independent set (MWIS) and a global knowledge of who currently owns a copy and what their delivery probabilities are. This paper proposes an algorithm, Max-Contribution (MC) that approximates MWIS problem with a greedy method and its distributed online approximation algorithm, Distributed Max-Contribution (DMC) that performs scheduling, routing and replication based only on locally and contemporarily available information. Through extensive simulations based on real GPS traces tracking over 4,000 taxies and 500 taxies for about 30 days and 25 days in two different large cities, DMC is verified to perform closely to MC and outperform existing heuristically engineered resource allocation algorithms for DTNs.-
dc.languageEnglish-
dc.publisherIEEE COMPUTER SOC-
dc.subjectPERFORMANCE EVALUATION-
dc.subjectMOBILE NETWORKS-
dc.subjectUSER MOBILITY-
dc.subjectTIME-
dc.subjectDTN-
dc.titleMax Contribution: An Online Approximation of Optimal Resource Allocation in Delay Tolerant Networks-
dc.typeArticle-
dc.identifier.wosid000349626100011-
dc.identifier.scopusid2-s2.0-84922901288-
dc.type.rimsART-
dc.citation.volume14-
dc.citation.issue3-
dc.citation.beginningpage592-
dc.citation.endingpage605-
dc.citation.publicationnameIEEE TRANSACTIONS ON MOBILE COMPUTING-
dc.identifier.doi10.1109/TMC.2014.2329001-
dc.contributor.localauthorYi, Yung-
dc.contributor.localauthorChong, Song-
dc.contributor.nonIdAuthorLee, Kyunghan-
dc.contributor.nonIdAuthorJeong, Jaeseong-
dc.contributor.nonIdAuthorWon, Hyungsuk-
dc.contributor.nonIdAuthorRhee, Injong-
dc.type.journalArticleArticle-
dc.subject.keywordAuthorResource allocation-
dc.subject.keywordAuthorrouting-
dc.subject.keywordAuthorscheduling-
dc.subject.keywordAuthoroptimality-
dc.subject.keywordAuthordelay tolerant network-
dc.subject.keywordAuthormobile ad hoc network-
dc.subject.keywordPlusPERFORMANCE EVALUATION-
dc.subject.keywordPlusMOBILE NETWORKS-
dc.subject.keywordPlusUSER MOBILITY-
dc.subject.keywordPlusTIME-
dc.subject.keywordPlusDTN-
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 1 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0