Delay-tolerant delivery of quality information in ad hoc networks

Optimal, quality-aware scheduling of data consumption in mobile ad hoc networks

“…The proposed policies maximize the average delivered QI value x * k (y) based on linear discount and cost functions. This work is an extension of the data delivery mechanism in [2], which deals with static ad-hoc networks. The mechanism in [2] is based on the probabilistic nature of the 'secretary problem' adopted from the OST and the optimal online time series search problem.…”

“…This work is an extension of the data delivery mechanism in [2], which deals with static ad-hoc networks. The mechanism in [2] is based on the probabilistic nature of the 'secretary problem' adopted from the OST and the optimal online time series search problem. In this work, we investigate the optimal scheduling of information delivery for mobile ad-hoc networks.…”

“…In this work, we investigate the optimal scheduling of information delivery for mobile ad-hoc networks. The 'asset selling' OST problem in this work focuses on the actual (cardinal) QI value (and not on the relative best QI value seen so far as in [2]) of the delivered piece of information. This increases the consumer confidence to either stop receiving data with specific QI values and deliver information to the mobile application or continue the process.…”

“…This increases the consumer confidence to either stop receiving data with specific QI values and deliver information to the mobile application or continue the process. For reasons of completion, we reproduce certain definitions and assumptions found in [2]. Moreover, we adopt the same underlying probabilistic information dissemination model (epidemical spreading) as proposed in [2].…”

“…For reasons of completion, we reproduce certain definitions and assumptions found in [2]. Moreover, we adopt the same underlying probabilistic information dissemination model (epidemical spreading) as proposed in [2].…”