In order to solve the real-time service scheduling problem in wireless Mesh networks,this paper proposed a dyna-mic programming based real-time service scheduling (DPRSS)algorithm.First,it transformed the network edges into mapping nodes through edge mapping.Then,it estimated the queuing time of each packet in the system according to the queue of the Mesh router and reassigned the priority of each packet with the consideration of the deadline of services in each node.After that,it obtained the access weights of the mapping edges.Finally,chose the optimal mapping nodes access sequence using dy-namic programming algorithm to get the optimal scheduling sequence of the service in each stage.The simulation results show that,the DPRSS algorithm proposed can meet the real-time requirements of different network services from high priority to low priority with the advantage of decreasing the average time delay and packet loss rate in the whole network.%为了解决无线 Mesh 网络实时业务的规划调度问题,提出一种基于动态规划的实时业务调度算法。首先,通过边集映射,将网络中的边转换为映射节点进行阶段划分;然后,每个 Mesh 路由器节点根据缓存中的队列情况预测数据包的排队时间,并结合业务截止期进行优先级重新分配,得到映射边的接入权值;最后,利用动态规划算法,根据映射边的接入权值选择最优的映射节点接入次序,得到该业务在各阶段的最优调度顺序。仿真结果表明,该算法能够兼顾高、低优先级业务的实时需求,降低全网业务的平均时延和丢包率。
展开▼