检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王静[1] 刘景美[2] 刘向阳[3] 王新梅[2]
机构地区:[1]长安大学信息工程学院,陕西西安710064 [2]西安电子科技大学综合业务网国家重点实验室,陕西西安710071 [3]西安通信学院军事综合信息网教研室,陕西西安710106
出 处:《系统工程与电子技术》2010年第4期865-868,共4页Systems Engineering and Electronics
基 金:国家高技术研究发展计划(863计划)(2007AA01Z215);国家自然科学基金(60502046;60573034)资助课题
摘 要:针对XOR选择重传ARQ协议,提出了一种基于网络编码的多播路由算法,有效地恢复链路传输错误。该算法分为两种情况:一是信源发送正常的数据包,在信源节点与各接收节点之间建立多播路径族,并考虑不同路径族之间链路的共享;二是信源发送XOR数据包,搜索信源节点到各接收节点的最短路径,并考虑最短路径之间的链路共享。仿真结果表明,该算法有效地提高了网络吞吐量,在资源消耗方面较传统的多播路由算法有更好的表现,非常接近基于网络编码的最小费用多播算法。数学分析表明,该算法的复杂度远小于最小费用多播算法。A new multicast routing algorithm with network coding to deal with transmission errors in the data links is proposed,which is based on XOR selective repeat ARQ.More specifically,this scheme contains two cases: when the source transmits the normal data packets,the routing groups from source to each sink are searched,and link-sharing between different path groups is considered in the process of searching;when the source transmits the XOR data packets,the shortest paths from source to each sink are searched,and link-sharing between different shortest paths is also considered.Simulation results show that this algorithm increases the network throughput effectively.Meanwhile,compared with traditional multicast routing algorithms,the performances of the routing algorithm are improved at a great extent in resource consumption,and closer to the minimum-cost multicast algorithm based on network coding.Mathematic analysis indicates that the complexity of the proposed algorithm is much lower than that of the minimum-cost multicast algorithm.
关 键 词:网络编码 选择重传ARQ 多播传输 吞吐量 带宽消耗
分 类 号:TN911.2[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.117

