Introduction to Stochastic Dynamic Programming: Probability and Mathematical
Introduction to Stochastic Dynamic Programming: Probability and Mathematical
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
Dynamic Programming and Optimal Control, Vol. II
Dynamic Programming and Optimal Control, Vol. II
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
A Data Collection Protocol for Local Mobile Sensor Network
CMC '09 Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01
An optimal probabilistic forwarding protocolin delay tolerant networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Advanced inference in situation-aware computing
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Delay-tolerant delivery of quality information in ad hoc networks
Journal of Parallel and Distributed Computing
Information Dissemination between Mobile Nodes for Collaborative Context Awareness
IEEE Transactions on Mobile Computing
PC3: Principal Component-based Context Compression
Journal of Parallel and Distributed Computing
Self-Organized Coordinated Motion in Groups of Physically Connected Robots
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
| Hi-index | 0.00 |
We focus on the treatment of quality-stamped contextual information in mobile sensor networks. Sensing nodes capture and forward context for consumption by mobile context aware applications. Due to the dynamic network topology the quality indicators seen by consumers vary over time. Context quality is a decreasing function of time and context can be consumed with a certain delay from its capturing time. We propose the sequential assessment of the network-circulated context information according to the Generalized Secretary Problem, a known paradigm in the Optimal Stopping Theory. The consumer node delays the processing (consumption) of incoming context until better quality is attained. We extend this basic model to include the cardinality of contextual components (i.e., different types of measurements coming from, possibly, different sources). Hence, the consumer node is interested not only in the higher possible quality of context but also in the widest possible range of context parameters (context ''quantity''). We compare our findings to simple consumption strategies and pinpoint the advantages of the proposed model.