The demand for Internet services that require frequent updates through small messages, such as microblogging, has tremendously grown in the past few years. Although the use of such applications by domestic users is usually free, their access from mobile devices is subject to fees and consumes energy from limited batteries. If a user activates his mobile device and is in range of a service provider, a content update is received at the expense of monetary and energy costs. Thus, users face a tradeoff between such costs and their messages aging. The goal of this paper is to show how to cope with such a tradeoff, by devising \emph{aging control policies}. An aging control policy consists of deciding, based on the current utility of the last message received, whether to activate the mobile device, and if so, which technology to use (WiFi or 3G). We present a model that yields the optimal aging control policy. Our model is based on a Markov Decision Process in which states correspond to message ages. Using our model, we show the existence of an optimal strategy in the class of threshold strategies, wherein users activate their mobile devices if the age of their messages surpasses a given threshold and remain inactive otherwise. We then consider strategic content providers (publishers) that offer \emph{bonus packages} to users, so as to incent them to download updates of advertisement campaigns. We provide simple algorithms for publishers to determine optimal bonus levels, leveraging the fact that users adopt their optimal aging control strategies. The accuracy of our model is validated against traces from the UMass DieselNet bus network.
[1]
Aleksej F. Filippov,et al.
Differential Equations with Discontinuous Righthand Sides
,
1988,
Mathematics and Its Applications.
[2]
Vishal Misra,et al.
On cooperative settlement between content, transit, and eyeball internet service providers
,
2011,
TNET.
[3]
Roch Guérin,et al.
Quantifying content consistency improvements through opportunistic contacts
,
2009,
CHANTS '09.
[4]
R. Cavazos-Cadena.
Necessary conditions for the optimality equation in average-reward Markov decision processes
,
1989
.
[5]
Eitan Altman,et al.
Battery-state dependent power control as a dynamic game
,
2008,
WiOpt 2008.
[6]
Eitan Altman,et al.
Decentralized Stochastic Control of Delay Tolerant Networks
,
2009,
IEEE INFOCOM 2009.
[7]
Augustin Chaintreau,et al.
The age of impatience: optimal replication schemes for opportunistic networks
,
2009,
CoNEXT '09.
[8]
Laurent Massoulié,et al.
Emulating low-priority transport at the application layer: a background transfer service
,
2004,
SIGMETRICS '04/Performance '04.
[9]
Donald F. Towsley,et al.
Relays, base stations, and meshes: enhancing mobile networks with infrastructure
,
2008,
MobiCom '08.
[10]
Martin L. Puterman,et al.
Markov Decision Processes: Discrete Stochastic Dynamic Programming
,
1994
.
[11]
H. Kushner,et al.
Stochastic Approximation and Recursive Algorithms and Applications
,
2003
.