Wireless Networks

, Volume 14, Issue 4, pp 465–478

Multiconstrained QoS multipath routing in wireless sensor networks


DOI: 10.1007/s11276-006-0731-9

Cite this article as:
Huang, X. & Fang, Y. Wireless Netw (2008) 14: 465. doi:10.1007/s11276-006-0731-9


Sensor nodes are densely deployed to accomplish various applications because of the inexpensive cost and small size. Depending on different applications, the traffic in the wireless sensor networks may be mixed with time-sensitive packets and reliability-demanding packets. Therefore, QoS routing is an important issue in wireless sensor networks. Our goal is to provide soft-QoS to different packets as path information is not readily available in wireless networks. In this paper, we utilize the multiple paths between the source and sink pairs for QoS provisioning. Unlike E2E QoS schemes, soft-QoS mapped into links on a path is provided based on local link state information. By the estimation and approximation of path quality, traditional NP-complete QoS problem can be transformed to a modest problem. The idea is to formulate the optimization problem as a probabilistic programming, then based on some approximation technique, we convert it into a deterministic linear programming, which is much easier and convenient to solve. More importantly, the resulting solution is also one to the original probabilistic programming. Simulation results demonstrate the effectiveness of our approach.


Quality of service Routing Constrained optimization Wireless sensor network 

Copyright information

© Springer Science + Business Media, LLC 2007

Authors and Affiliations

  1. 1.Department of Electrical & Computer EngineeringUniversity of FloridaGainesvilleUSA

Personalised recommendations