检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]中南大学信息科学与工程学院,湖南长沙410083
出 处:《小型微型计算机系统》2009年第6期1089-1093,共5页Journal of Chinese Computer Systems
基 金:国家自然科学基金资助项目(60873265)资助;中南大学重点创新基金(ZB018)资助
摘 要:重传是无线网络广播传输中实现错误处理的重要技术.普通重传方法通常逐一发送丢失包来进行错误处理,这种处理在丢包分散的低丢包率无线网络上重传次数相当大.本文将网络编码减少无线传输信息量的特性应用在低丢包率无线网络广播重传中,提出一种基于网络编码的广播重传方法(BRANC).该方法按照丢失分布概率特点生成新的重传序列;采用基于多节点的网络编码方法进行丢失包组合实现重传.为达到更佳重传目的,进一步分析了编码组合包重传再丢失时的处理.数学分析表明,该方法能保证接收节点的编码可解性,同时重传次数可达到局部最优性;模拟测试结果表明:与普通重传方法相比,BRANC有效地减少了信息包的平均传输次数,提高了传输效率.Retransmission is an important technique to ensure the error correction of wireless broadcasting transmission. Tradiional retransmission approach always sending lost packets in sequence to ensure the error correction of networks. This approach needs a great deal of transmissions in the lower packets loss rate wireless networks because of the decentralization distribution of lost packets. This paper presents a novel retransmission approach (BRANC)in lower packets loss rate wireless networks based on network coding. Firstly, retransmission packets list can be generated based on the distribution probability of lost packets. Then, lost packets is coding combined by using multi-node network coding theory ; In order to achieve optimal results, dynamically adjust combination strategy is selected and a dynamically approach is presented to reduces the number of retransmissions. Mathematic analysis reveals that our approach can ensure the solvability in the received nodes, and have optimization performance in local retransmission. Simulation results indicate that comparing with existing approach; the approach in this paper can effectively reduces the average number of transmissions and advances the transmission efficiency.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.30