首页> 外文期刊>Selected Topics in Signal Processing, IEEE Journal of >Maximizing Quality of Information From Multiple Sensor Devices: The Exploration vs Exploitation Tradeoff
【24h】

Maximizing Quality of Information From Multiple Sensor Devices: The Exploration vs Exploitation Tradeoff

机译:最大化来自多个传感器设备的信息质量:探索与开发的权衡

获取原文
获取原文并翻译 | 示例
           

摘要

This paper investigates Quality of Information (QoI) aware adaptive sampling in a system where two sensor devices report information to an end user. The system carries out a sequence of tasks, where each task relates to a random event that must be observed. The accumulated information obtained from the sensor devices is reported once per task to a higher layer application at the end user. The utility of each report depends on the timeliness of the report and also on the quality of the observations. Quality can be improved by accumulating more observations for the same task, at the expense of delay. We assume new tasks arrive randomly, and the qualities of each new observation are also random. The goal is to maximize time average quality of information subject to cost constraints. We solve the problem by leveraging dynamic programming and Lyapunov optimization. Our algorithms involve solving a 2-dimensional optimal stopping problem, and result in a 2-dimensional threshold rule. When task arrivals are i.i.d., the optimal solution to the stopping problem can be closely approximated with a small number of simplified value iterations. When task arrivals are periodic, we derive a structured form approximately optimal stopping policy. We also introduce hybrid policies applied over the proposed adaptive sampling algorithms to further improve the performance. Numerical results demonstrate that our policies perform near optimal. Overall, this work provides new insights into network operation based on QoI attributes.
机译:本文研究了在两个传感器设备向最终用户报告信息的系统中,信息质量(QoI)感知自适应采样。系统执行一系列任务,其中每个任务与必须遵守的随机事件有关。每个任务一次将从传感器设备获得的累积信息报告给最终用户的高层应用程序。每个报告的效用取决于报告的及时性以及观察的质量。通过为同一任务积累更多观测值可以提高质量,但要以延迟为代价。我们假设新任务是随机到达的,并且每个新观察的质量也是随机的。目标是在受成本约束的情况下最大化信息的时间平均质量。我们通过利用动态编程和Lyapunov优化来解决问题。我们的算法涉及解决二维最佳停止问题,并产生二维阈值规则。当任务到达时(i.i.d.),可以通过少量的简化值迭代来近似逼近停止问题的最佳解决方案。当任务到达是周期性的时,我们得出近似最佳停止策略的结构化形式。我们还介绍了在建议的自适应采样算法上应用的混合策略,以进一步提高性能。数值结果表明,我们的策略几乎是最优的。总的来说,这项工作为基于QoI属性的网络操作提供了新的见解。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号