A Knapsack-based buffer management strategy for delay-tolerant networks ?
We propose a theoretical message scheduling and drop strategy in DTNs. We improve the theoretical strategy into a practical scheduling and drop strategy. We propose an efficient local parameter collection method to estimate global parameters. The proposed strategy utilizes the knapsack model to deal with messages in different sizes. We conduct extensive simulations on both synthetic and real mobility traces.
scheduling drop dtns congestion knapsack problem