首页> 外文会议>MILITARY COMMUNICATIONS CONFERENCE, 2011 - MILCOM 2011 >Quality-of-information aware transmission policies with time-varying links
【24h】

Quality-of-information aware transmission policies with time-varying links

机译:具有时变链接的信息质量感知传输策略

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

摘要

We consider Quality-of-Information (QoI) aware transmission policies in the presence of time-varying links in a mobile ad hoc network. QoI, tailored for military tactical networks, is defined by a set of attributes relevant to the application. Time-varying nature of links in practical networks leads to uncertainty in evaluating QoI utility to be delivered to end users. This delivered-QoI utility is a function of both attributes provided by the source input, as a result of observing certain events, and the channel induced attributes that impact the QoI obtained at the destination. The goal of this paper is to attain the maximum QoI output utility, termed as Operational Information Content Capacity (OICC) of a network. First, for a single link, we demonstrate that the optimal decision structure for transmission is threshold-based. Next, we consider multihop relay networks. For the basic model of a two-hop relay network, we propose transmission scheduling and link activation schemes based on approximate dynamic programming methods. Furthermore, we exploit time-variations of links by opportunistic scheduling by employing buffers at the relay node. We demonstrate that significant gains in QoI output utility are gained by opportunistic scheduling algorithms.
机译:在移动自组织网络中存在时变链接时,我们考虑信息质量(QoI)感知的传输策略。为军事战术网络量身定制的QoI由与应用程序相关的一组属性定义。实际网络中链路的时变性质导致在评估要交付给最终用户的QoI效用时存在不确定性。此交付的QoI实用程序是源输入(由于观察某些事件)提供的属性以及影响目标处获得的QoI的信道诱发属性的函数。本文的目的是获得最大的QoI输出效用,称为网络的操作信息内容容量(OICC)。首先,对于单个链接,我们证明了传输的最佳决策结构是基于阈值的。接下来,我们考虑多跳中继网络。对于两跳中继网络的基本模型,我们提出了基于近似动态规划方法的传输调度和链路激活方案。此外,我们通过在中继节点上使用缓冲区通过机会调度来利用链路的时变。我们证明了机会调度算法在QoI输出效用中获得了重大收益。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号