首页> 外文会议>International conference on electrical and electronics engineering >A Busacker-Gowen Algorithm Based on Routing Scheme for Maximizing Throughput with Minimum Delay in WOBAN
【24h】

A Busacker-Gowen Algorithm Based on Routing Scheme for Maximizing Throughput with Minimum Delay in WOBAN

机译:基于路由方案的布线 - Gowen算法,用于最大限度地利用WOBAN最小延迟的吞吐量

获取原文

摘要

In this chapter, a novel routing algorithm for maximizing the throughput with minimal delay on the basis of Busacker-Gowen algorithm was proposed. Simulation results showed that BGR algorithm can improve the throughput greatly at minimal delay cost compared with MMHR algorithm. The proposed algorithm is an optimal centralized algorithm, which suits the WOBAN with few node numbers. The future work is to design the distributed version of the BGR algorithm, which will be used in larger WOBAN.
机译:在本章中,提出了一种新的路由算法,用于最大限度地利用基于Busacker-Gowen算法的延迟最小的吞吐量。仿真结果表明,与MMHR算法相比,BGR算法可以在最小的延迟成本下提高吞吐量。所提出的算法是一种最佳的集中式算法,其适用于少数节点编号的WOON。未来的工作是设计BGR算法的分布式版本,它将在较大的WOON中使用。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号