...
首页> 外文期刊>Concurrency, practice and experience >Mobile delay-tolerant networks with energy-harvesting and wireless energy transfer cooperation
【24h】

Mobile delay-tolerant networks with energy-harvesting and wireless energy transfer cooperation

机译:具有能量收集和无线能量转移协作的移动延迟容忍网络

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

摘要

We consider a mobile delay-tolerant networks (MDTNs) with energy-harvesting capabilities. Inorder to determine energy management policies that will improve network capacity and packetdelivery ratio and maximize the system throughput, we consider a source node that seeks tosend packets to a destination node. The optimal policy for the source varies according to itssystem state, which allows it to guarantee a maximum delivery probability rate. Our problem ismodeled by decision theory; as a start, we are interested in the MDP to model and solve suchsequential decision problems. Our goal is to optimize for each node, a utility depending on arandom environment and decisions made by the node. As the MDP formalism reaches its limitswhen it is necessary to take into account the interactions between different several nodes, wewill start using the graph-based MDP where the state and action spaces are factorizable byvariables. The transition functions and rewards are then decomposed into local functions and thedependency relations between the nodes are represented by a graph. To calculate the optimalpolicy, we propose Mean Field Approximation (MFA) and Approximate linear-programming(ALP) algorithms for solving GMDP problem.
机译:我们考虑具有能量收集功能的移动延迟容忍网络(MDTN)。为了确定能改善网络容量和数据包传递比率并最大程度提高系统吞吐量的能源管理策略,我们考虑一个源节点,该节点试图将数据包发送到目标节点。源的最佳策略根据其系统状态而有所不同,这使其可以保证最大的交付概率。我们的问题是由决策理论建模的;首先,我们对MDP建模和解决此类顺序决策问题感兴趣。我们的目标是针对每个节点优化实用程序,具体取决于随机环境和节点做出的决定。当需要考虑不同几个节点之间的相互作用时,随着MDP形式主义达到极限,我们将开始使用基于图的MDP,其中状态和操作空间可以通过变量进行分解。然后将过渡函数和奖励分解为局部函数,并用图形表示节点之间的依赖关系。为了计算最优策略,我们提出了平均场近似(MFA)和近似线性规划(ALP)算法来解决GMDP问题。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号