Abstract: The classic QoS（Quality of Service）-based routing algorithms in WSN（Wireless Sensor Network） always consider
only restricted factor，such as energy，amount of hops，delay，and so on.But the requirement of QoS often needs multiple factors
in complex WSN circumstances.This makes it hard to find an optimal routing in a real condition.An algorithm which is
based on dynamic programming problem is brought up to solve the problem.When algorithm is choosing a routing which has minimum
delay，nodes’energy and link loss rate effect as the restrickt factors.It is proved that this algorithm has optimality.

摘要： 经典的基于QoS（Quality of Service，服务质量）的WSN（Wireless Sensor Network，无线传感器网络）路由算法往往只考虑了单一的条件限制，如能量、通信跳数、延时等。而在一个复杂的WSN环境中，对于QoS 的需求通常综合了多种条件。这使得现有的路由算法难以选择出实际情况下的最优路由。一种基于动态规划问题的算法被提出，用来解决这一问题。当算法选择最小延时路由时，节点能量和链路丢失率将被作为约束条件。经过证明，算法具有最优性。