基于时间约束的优化编码传输算法 optimized encode and transmission algorithm for time critical wireless networks.pdfVIP

电子技术研发 Electronics R D 10.3969/j.issn.1000-0755.2013.08.013 基于时间约束的优化编码传输算法 詹 成 （电子信息控制重点实验室, 四川 成都） 摘 要：考虑到对数据包延迟等服务质量要求比较高的流媒体应用，文章研究了在有记忆接收节点模型 也即接收节点可以缓存多个数据包的前提下，数据包有延迟约束的无线网络中基于网络编码的广播调度问 题，目标在于最小化超过延迟约束数据包的数目。本文提出一种利用着色图的方法来进行编码调度的算法， 可以显著减少超过延迟约束数据包的数目，为以后针对QoS需求的网络编码问题提供了参考。模拟实验表明 相比于接收节点丢弃暂时无用数据包的无记忆模型，在有记忆模型下我们的算法可以在很多情况下有效地 降低超出延迟约束率，这对时间关键的应用非常重要。 关键词：时间约束；编码；传输；有记忆模型 Optimized Encode and Transmission Algorithm for Time Critical Wireless Networks Zhan Cheng (Key Laboratory of Electronic Information Control, Chengdu, Sichuan) Abstract: Considering the streaming media applications which need for high QoS requirement, this paper studies network coding based broadcast scheduling in a time-critical wireless network under the assumption that receiver can buffer the encoded packets which cannot be decoded immediately, so as to minimize the number of packets missing their deadlines. This paper presents a colored graph method to encode and schedule transmission, it can reduce the number of packets which miss their deadlines, which can be be a reference for designing the QoS aware network coding broadcast scheduling problem. Simulation results show that compared to the model that receiver drops packet which cannot be decoded immediately, under the assumption that receiver can buffer more packets, the presented method can reduce the number of packets which miss their deadlines, this is important in time critical applications. Key words: time critical; encode; transmission; memory model 0 引言 视为多个单跳广播。例如下图中的例子，有一个发 随着WiFi、3G蜂窝系统以及移动设备的引入， 送节点s和5个接收节点，r ,r ,r ,r ,r 。假定s需要传 1 2 3 4 5 近年来无线网络变得越来越普遍。有许