首页> 外文会议>IEEE International Conference on High Performance Computing and Communications >A Delay Constrained Two-Hop Relay Algorithm for Transparent Computing in MANETs
【24h】

A Delay Constrained Two-Hop Relay Algorithm for Transparent Computing in MANETs

机译:船只透明计算的延迟约束二跳中继算法

获取原文

摘要

Transparent computing devices nowadays may be deployed in mobile ad hoc networks (MANETs), whose information theory is still lacking. As the first step towards learning MANETs for this paradigm, we propose 2HR-fτ, a simple algorithm that extends the traditional two-hop relay algorithms with deliver delay constraints. Extensive simulations are conducted to provide characteristics such as network throughput, deliver ratio and average deliver delay.
机译:现在可以在移动临时网络(舰队)中部署透明计算设备,其信息理论仍然缺乏。作为对此范式学习船只的第一步,我们提出了2小时-Fτ,一个简单的算法,将传统的两跳中继算法扩展,具有传递延迟约束。进行广泛的模拟以提供网络吞吐量,提供比率和平均传递延迟等特征。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号