Heuristic algorithms for multiconstrained quality-of-service routing
IEEE/ACM Transactions on Networking (TON)
Highly-resilient, energy-efficient multipath routing in wireless sensor networks
ACM SIGMOBILE Mobile Computing and Communications Review
An Energy-Aware QoS Routing Protocol for Wireless Sensor Networks
ICDCSW '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Bandwidth-delay constrained path selection under inaccurate state information
IEEE/ACM Transactions on Networking (TON)
ReInForM: Reliable Information Forwarding Using Multiple Paths in Sensor Networks
LCN '03 Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks
Understanding packet delivery performance in dense wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Proceedings of the 1st international conference on Embedded networked sensor systems
QSHINE '04 Proceedings of the First International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks
Linear Programming and Network Flows
Linear Programming and Network Flows
IEEE Transactions on Wireless Communications
On the complexity of QoS routing
Computer Communications
Distributed quality-of-service routing in ad hoc networks
IEEE Journal on Selected Areas in Communications
Implementing distributed multicost routing in mobile ad hoc networks using dsr
Proceedings of the 6th ACM international symposium on Mobility management and wireless access
Joint multi-cost routing and power control in wireless ad hoc networks
Wireless Networks
| Hi-index | 0.00 |
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.