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
Proceedings of the 10th international conference on Architectural support for programming languages and operating systems
Prioritized epidemic routing for opportunistic networks
Proceedings of the 1st international MobiSys workshop on Mobile opportunistic networking
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
Promoting tolerance for delay tolerant network research
ACM SIGCOMM Computer Communication Review
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
Optimal Algorithms for the Online Time Series Search Problem
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Opportunistic Routing for Disruption Tolerant Networks
WAINA '09 Proceedings of the 2009 International Conference on Advanced Information Networking and Applications Workshops
A comparison of epidemic algorithms in wireless sensor networks
Computer Communications
Optimal, quality-aware scheduling of data consumption in mobile 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
Multivariate context collection in mobile sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
We investigate the delivery of information in ad hoc networks. We consider information sources and information consumers, and the network in between. Information has a certain quality indicator that fades over time. Consumers (applications that process incoming data) can receive and process disseminated information from its generation time until the associated quality reaches the lowest possible level. We adopt optimal stopping theory and an optimal online search algorithm in order to study the problem of optimally scheduling information consumption. The assumptions of our study include an efficient epidemic information dissemination scheme, which is a popular scheme for wireless sensor networks nowadays. We adopt the latter scheme for a combined setting where receiving nodes delay the reporting of information to applications in search for better quality while the overall network optimizes transmissions through the epidemic abstraction. Our findings are quite promising for the engineering of delay-tolerant applications (and the relevant middleware) in ad hoc networks.