Introduction to Stochastic Dynamic Programming: Probability and Mathematical
Introduction to Stochastic Dynamic Programming: Probability and Mathematical
Improved Algorithms and Analysis for Secretary Problems and Generalizations
SIAM Journal on Discrete Mathematics
Epidemic thresholds in real networks
ACM Transactions on Information and System Security (TISSEC)
Distributed opportunistic scheduling for ad-hoc communications: an optimal stopping approach
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
TCP with delayed ack for wireless networks
Ad Hoc Networks
Stationary Distributions for the Random Waypoint Mobility Model
IEEE Transactions on Mobile Computing
A framework for QoI-inspired analysis for sensor network deployment planning
WICON '07 Proceedings of the 3rd international conference on Wireless internet
Secretary problems: weights and discounts
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
On the application of epidemical spreading in collaborative context-aware computing
ACM SIGMOBILE Mobile Computing and Communications Review
An optimal probabilistic forwarding protocolin delay tolerant networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Delay-tolerant delivery of quality information in ad hoc networks
Journal of Parallel and Distributed Computing
On the use of optimal stopping theory for improving cache consistency
WISE'12 Proceedings of the 13th international conference on Web Information Systems Engineering
| Hi-index | 0.00 |
In this paper we study the delivery of quality contextual information in mobile ad-hoc networks. We consider that information has a certain quality level that fades over time. Mobile context-aware applications receive and process disseminated information given that the corresponding quality is above the lowest level. The necessity for optimally scheduling information delivery arises from the dynamic nature of the network, e.g., probabilistic spreading, caching, deferred delivery, and mobility of nodes. We propose two policies for optimal scheduling information delivery consumption based on the Optimal Stopping Theory. The mobile nodes delay the reporting of information to mobile context-aware applications in search for better quality. The proposed policies efficiently deal with the delivery of quality information in mobile ad-hoc networks.