Max Contribution An Online Approximation of Optimal Resource Allocation in Delay Tolerant Networks - 2015
In this paper, a joint optimization of link scheduling, routing and replication for delay-tolerant networks (DTNs) has been studied. The optimization issues for resource allocation in DTNs are typically solved using dynamic programming which needs information of future events like meeting schedules and durations. This paper defines a new notion of approximation to the optimality for DTNs, referred to as snapshot approximation where nodes are not clairvoyant, i.e., not looking ahead into future events, and so selections are made using only contemporarily obtainable knowledges. Sadly, the snapshot approximation still needs solving an NP-hard drawback of most weighted independent set (MWIS) and a international information of who currently owns a copy and what their delivery probabilities are. This paper proposes an algorithm, Max-Contribution (MC) that approximates MWIS drawback with a greedy technique and its distributed on-line approximation algorithm, Distributed Max-Contribution (DMC) that performs scheduling, routing and replication based mostly solely on locally and contemporarily out there data. Through extensive simulations based on real GPS traces tracking over 4,00zero taxies and five hundred taxies for regarding 30 days and twenty five days in two totally different large cities, DMC is verified to perform closely to MC and outperform existing heuristically built resource allocation algorithms for DTNs.
Did you like this research project?
To get this research project Guidelines, Training and Code... Click Here