TY - GEN
T1 - Multi-constrained soft-QoS provisioning in wireless sensor networks
AU - Huang, Xiaoxia
AU - Fang, Yuguang
N1 - Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].
PY - 2006
Y1 - 2006
N2 - Due to the inexpensive cost and small size of the sensor node, sensor networks are densely deployed for most applications. In the application oriented wireless sensor networks, traffic is usually mixed with time-sensitive packets and reliability-demanding packets. Hence, routing regardless of the packet characteristics is not efficient. Our goal is to provide soft-QoS to different types of packets since accurate path information can be hardly obtained 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 determined based on local link state information. Through the estimation and approximation of path quality, traditional NP-complete QoS problem is split into many small problems. The idea is to formulate the problem as a probabilistic programming, then based on some approximation technique, we convert it into an integer programming, which is much easier to solve. The resulting solution is also one to the original probabilistic programming. Simulation results demonstrate the effectiveness of our approach. © 2006 ACM.
AB - Due to the inexpensive cost and small size of the sensor node, sensor networks are densely deployed for most applications. In the application oriented wireless sensor networks, traffic is usually mixed with time-sensitive packets and reliability-demanding packets. Hence, routing regardless of the packet characteristics is not efficient. Our goal is to provide soft-QoS to different types of packets since accurate path information can be hardly obtained 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 determined based on local link state information. Through the estimation and approximation of path quality, traditional NP-complete QoS problem is split into many small problems. The idea is to formulate the problem as a probabilistic programming, then based on some approximation technique, we convert it into an integer programming, which is much easier to solve. The resulting solution is also one to the original probabilistic programming. Simulation results demonstrate the effectiveness of our approach. © 2006 ACM.
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-34547617504&origin=recordpage
UR - http://www.scopus.com/inward/record.url?scp=34547617504&partnerID=8YFLogxK
U2 - 10.1145/1185373.1185392
DO - 10.1145/1185373.1185392
M3 - RGC 32 - Refereed conference paper (with host publication)
SN - 1595935371
SN - 9781595935373
VL - 191
T3 - ACM International Conference Proceeding Series
BT - ACM International Conference Proceeding Series - Proceedings of the 3rd International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks
T2 - 3rd International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks
Y2 - 7 August 2006 through 8 September 2006
ER -