A tunable QoS routing algorithm

We propose a new distributed route-selection scheme to look for a feasible route satisfying the quality of service (QoS) constraints without compromising any of the existing guarantees. The performance of the QoS routing algorithm is tunable by choosing different upper bounds of the expected delivery time at every node according to the status of the network. Simulation results are presented to demonstrate the effectiveness of the proposed route-selection scheme.