Supporting QoS routing in mobile ad hoc networks using probabilistic locality and load balancing

Harnessing the time varying topological aspect of mobile ad hoc networks so as to support Quality of Service (QoS) measures is a challenging problem. In this paper we develop and investigate the use of a simple spatial probabilistic locality model to enhance the performance of current on-demand routing algorithms. To explore the applicability of our approach, we examine two basic routing problems. The first problem calls for evaluating the likelihood that a given source-destination route exists, given that each mobile host on the route can be in any position of its locality set. The second problem calls for choosing the most probable route between a given source-destination pair that avoids traffic bottlenecks. In each case, we formalize a suitable problem, and devise an efficient solution strategy