【24h】

Bearing-Opportunistic Network Coding

机译:方位机会网络编码

获取原文
       

摘要

This paper presents a novel, practical, routing-independent networkcoding?algorithm: BON-Bearing opportunistic network coding. Simplicity is its main?benefit as it introduces little overhead to the network since nodes do not need to keep?track of received traffic for their neighbouring nodes. Algorithm makes coding decisions?based solely on the information about the packet previous and next hop node?position. Algorithm functions between the MAC and link layers, with small modifications?made only to the MAC layer. Using different topologies and different traffic?loads and distributions in the simulation model we evaluated algorithm ?performance?and compared it to a well-known COPE algorithm.
机译:本文提出了一种新颖,实用,与路由无关的网络编码算法:BON-承载机会网络编码。简单性是它的主要优点,因为它不会给网络带来太多开销,因为节点不需要跟踪其相邻节点的接收流量。算法仅基于有关数据包上一跳节点和下一跳节点位置的信息来做出编码决策。算法在MAC和链路层之间起作用,仅对MAC层进行了少量修改。在仿真模型中使用不同的拓扑和不同的流量,负载和分布,我们评估了算法的“性能”,并将其与著名的COPE算法进行了比较。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号