论文部分内容阅读
无线网络越来越多地用于承载具有延时约束的实时应用,延迟成为无线网络服务质量的重要度量指标,而网络编码可以利用无线网络的广播特性,通过发送编码分组来减少分组传输次数,也就降低了传输延迟。这些实时应用的特点是分组截止时间是有约束的,也就是说,分组需要在截止时间的范围内发送到目的节点,否则,这些分组会由于截止时间超期而被丢弃。因此,文章基于网络编码对此进行实时调度机制的研究,使用拉格朗日对偶分解法和原始对偶更新法确定源节点每次发送的最优化分组块的大小和组成,并且给出了无线网络资源分配的确定性算法和随机性算法。
Wireless networks are increasingly used to carry real-time applications with delay constraints, and delay becomes an important metric for wireless network service quality. Network coding can utilize the broadcast characteristics of wireless networks to reduce the number of packet transmissions by sending encoded packets, Also reduces the transmission delay. These real-time applications are characterized by packet deadline constraints, that is, packets need to be sent to the destination within the deadline, or they will be dropped due to the expiration of the deadline. Therefore, based on the network coding, this paper studies the real-time scheduling mechanism, uses the Lagrange dual decomposition method and the original dual update method to determine the size and composition of the optimized sub-block sent by the source node each time, and gives the wireless network Deterministic and stochastic algorithms for resource allocation.