A deadline-driven probabilistic quality of service routing for mobile ad hoc networks

Provision of quality of service (QoS) in an ad hoc network is a challenging task due to their inherent characteristics. In this paper, we present a routing protocol for QoS provisioning in mobile ad hoc networks. Our protocol tries to discover multiple node-disjoint paths between a given source and a destination that are able to satisfy QoS requirements in terms of bandwidth required by a fow of packets. We discuss how one can have probabilistic QoS guarantees using a protocol where nodes are aware of their neighbors that may interfere with them while relaying packets to other nodes along the paths towards the destination. We analyze the probability that the packets arrive at the destination before their respective deadlines.