摘要
针对无线多跳自组织网络中随机网络编码,之前提出了一种网络编码随机优先级检测调度算法(Random early detection with priority,REDP),对两条不同优先级的数据流建立Markov数学模型,推导出了引入REDP算法下数据流的单节点的时延数学表达式,该算法使得数据流能够根据自身优先级和拥塞程度调整丢包概率,从而主动丢弃数据包提前避免拥塞。文中将单节点时延问题拓展到多节点的网络拓扑结构中,提出了动态时延分配算法,该算法能够根据各个节点队列的缓存情况,动态调整各个节点的时延分配,仿真结果表明,动态时延分配算法能够实现实时数据流严格的Qo S时延保障,更利于视频、语音等实时业务流的传输。
For wireless multi-hop Ad-hoc network ol random network coding,this paper proposed a network coding andom priority detection scheduling algorithm ( R E D P ) ,the algorithm makes it possible to adjust the packet loss probability ol data streams according to their degree ol priority and congestion,thus actively discards packets to avoid congestion in advance. It extends the single node to multi-node,and proposes a dynamic delay assignment algorithm that each node can be dynamically adjusted. The simulation result shows that the dynamic delay assignment algorithm can achieve real-time data streams guarantee strict QoS delay, more conducive to the transmission ol video, voice and other real-time trallic flow.
作者
刘琼霄
陈昂杨
丁良辉
杨峰
钱良
LIU Qiong-xiao;CHEN Ang-yang;DING Liang-hui;YANG Feng;QIAN Liang(Department of Electronic Engineering,Shanghai Jiaotong University,Shanghai 200240,China)
出处
《信息技术》
2016年第12期30-35,共6页
Information Technology
基金
自然科学基金项目(61301117
61221001
61420106008)
上海市数字媒体处理与传输重点实验室(12DZ2272600)
