PROJECT TITLE :

Optimization Problems in Throwbox-Assisted Delay Tolerant Networks: Which Throwboxes to Activate? How Many Active Ones I Need?

ABSTRACT:

One in all the solutions to improve mobile Delay Tolerant Network (DTN) performance is to position further stationary nodes, known as throwboxes, to make a larger number of contact opportunities. During this paper, we study a key optimization drawback in an exceedingly time-evolving throwbox-assisted DTN: throwbox selection, to answer the queries like “how several active throwboxes do I want?” and “which throwboxes ought to be activated?” We formally outline 2 throwbox optimization problems: min-throwbox problem and k-throwbox downside for time-evolving DTNs modeled by weighted area-time graphs. We have a tendency to show that min-throwbox problem is NP-exhausting and propose a group of greedy algorithms that will efficiently give quality solutions for both challenging problems.