Helper node allocation strategies for content dissemination in intermittently connected mobile networks

We formulate and address mathematically the fundamental problem of resource allocation in the form of helper nodes in disseminating multiple content in a hybrid intermittently connected mobile network under a general stochastic homogeneous contact process. We consider and solve two variations of the problem - one in which the goal is to maximize the expected demands satisfied and another in which the goal is to minimize the time taken to disseminate the contents. Besides the global optimization perspective, we also examine the problem from a game theoretic perspective in which a central agent auctions the storage to competing content providers, and show how self-interested decisions impact the social welfare.