Max Contribution : An On-line Approximation of Optimal Resource Allocation in Delay Tolerant Networks
Cited 0 times inCited 0 times in
- Max Contribution : An On-line Approximation of Optimal Resource Allocation in Delay Tolerant Networks
- Lee, Kyunghan; Jeong, Jaeseong; Yi, Yung; Won, Hyungsuk; Rhee, Injong; Chong, Song
- Issue Date
- IEEE COMPUTER SOC
- IEEE TRANSACTIONS ON MOBILE COMPUTING, v.14, no.3, pp.592 - 605
- 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 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 NPhard 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 on-line 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 4000 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.
- Appears in Collections:
- EE_Journal Papers
- Files in This Item:
- There are no files associated with this item.
can give you direct access to the published full text of this article. (UNISTARs only)
Show full item record
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.