Routing With Probabilistic Delay Guarantees in Wireless Ad-Hoc Networks
In many wireless ad-hoc networks it is important to find a route that delivers a message to the destination within a certain deadline (delay constraint). The authors propose to identify such routes based on average Channel State Information (CSI) only, since this information can be distributed more easily over the network. Such cases allow probabilistic QoS guarantees, i.e., they maximize and report the probability of on-time delivery. They develop a convolution-free lower bound on probability of on-time arrival, and a scheme to rapidly identify a path that maximizes this bound.