Robust Flow Admission Control and Routing for Mobile Ad Hoc Networks

Mobile ad hoc networks suffer from route breakups caused by nodal mobility. In a network that aims to support critical interactive real time data and flows, as well as the uninterrupted transport of a complete file or a critical series of messages, it is essential to identify robust routes that can be used for the un-interrupted transport execution of such transactions. Noting that route failures can induce long re-routing delays that may be highly interruptive for many applications and message/stream transactions, it is beneficial to configure the routing scheme to send a flow across a route whose lifetime is longer, with sufficiently high probability, than the estimated duration of the activity burst that it is selected to carry. We evaluate the ability of a mobile ad hoc wireless network to distribute flows across robust routes by introducing the robust throughput measure as a performance metric. For example, only transactions that are completed without being prematurely interrupted may convey data to their intended users that is of acceptable utility and is thus accounted for. We describe the mathematical calculation of a network's robust throughput measure, as well as its robust throughput capacity. In order to transport flows in mobile ad hoc wireless network in a robust fashion, we introduce the robust flow admission and routing algorithm (RFAR). Under this on-demand routing scheme, during the route discovery phase, nodal routers configure routing forwarding entries to forward flow packets only across links that induce a sufficiently high cumulative route robustness level. Shortest (or least end-to-end delay) such routes are subsequently discovered and established, serving to best utilize network capacity resources while meeting flow robustness objectives. We demonstrate through mathematical analysis and by using simulation evaluations that such a robust routing mechanism serves to significantly enhance the robust throughput performance of mobile ad hoc wireless network systems

[1]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[2]  I. Rubin,et al.  Mobility induced robust throughput behavior in mobile ad hoc networks , 2004, IEEE 60th Vehicular Technology Conference, 2004. VTC2004-Fall. 2004.

[3]  J. Broch,et al.  Dynamic source routing in ad hoc wireless networks , 1998 .

[4]  Satish K. Tripathi,et al.  Effects of multipath routing on TCP performance in ad hoc networks , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[5]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[6]  Izhak Rubin,et al.  Bit-Per-Joule Performance of Power Saving Ad Hoc Networks under Mobile Backbone Coverage , 2006, 2006 IEEE International Conference on Communications.

[7]  Izhak Rubin,et al.  Topological performance of mobile backbone based wireless ad hoc network with unmanned vehicles , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[8]  Yih-Chun Hu,et al.  Exploiting congestion information in network and higher layer protocols in multihop wireless ad hoc networks , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..

[9]  David B. Johnson,et al.  Routing in Ad Hoc Networks of Mobile Hosts , 1994, 1994 First Workshop on Mobile Computing Systems and Applications.

[10]  Izhak Rubin,et al.  Ad hoc wireless networks with mobile backbones , 2004, 2004 IEEE 15th International Symposium on Personal, Indoor and Mobile Radio Communications (IEEE Cat. No.04TH8754).

[11]  Izhak Rubin,et al.  Performance behavior of unmanned vehicle aided mobile backbone based wireless ad hoc networks , 2003, The 57th IEEE Semiannual Vehicular Technology Conference, 2003. VTC 2003-Spring..