On the use of a simple mobility model in ad hoc routing

Future ad hoc networks are expected to provide mobile hosts with access to a wide range of multimedia services. Mobility, however, poses a challenge towards providing adequate support to quality of service (QoS) routing. The paper considers ways of enhancing ad hoc routing by seeking means to quantify, model and exploit knowledge of various user mobility profiles. In this context, we investigate the use of a simple spatial probabilistic model for relatively low speed mobile hosts. Using the model, we examine combinatorial aspects of two basic routing problems: assessing the likelihood that a given end-to-end route exists, and selecting a highly probable route that balances nodal loads among a number of hosts. We devise efficient approximate solutions to both problems, and discuss possible ways of using the solutions in some existing on-demand routing protocols.

[1]  Chai-Keong Toh,et al.  Associativity-Based Routing for Ad Hoc Mobile Networks , 1997, Wirel. Pers. Commun..

[2]  Ian F. Akyildiz,et al.  A resource estimation and call admission algorithm for wireless multimedia networks using the shadow cluster concept , 1997, TNET.

[3]  Mario Gerla,et al.  Global state routing: a new routing scheme for ad-hoc wireless networks , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[4]  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.

[5]  Nitin H. Vaidya,et al.  Location-aided routing (LAR) in mobile ad hoc networks , 1998, MobiCom '98.

[6]  Ralf Steinmetz,et al.  Mechanisms for QoS Signaling in a Mobile Internet Environment , 2000 .

[7]  Imrich Chlamtac,et al.  A new approach to the design and analysis of peer‐to‐peer mobile networks , 1999, Wirel. Networks.

[8]  Charles E. Perkins,et al.  Performance comparison of two on-demand routing protocols for ad hoc networks , 2001, IEEE Wirel. Commun..

[9]  Geng-Sheng Kuo,et al.  A probabilistic resource estimation and semi-reservation scheme for flow-oriented multimedia wireless networks , 2000, 2000 IEEE Wireless Communications and Networking Conference. Conference Record (Cat. No.00TH8540).

[10]  Tatsuya Suda,et al.  An adaptive bandwidth reservation scheme for high-speed multimedia wireless networks , 1998, IEEE J. Sel. Areas Commun..

[11]  Suresh Singh,et al.  Quality of service guarantees in mobile computing , 1996, Comput. Commun..

[12]  Krishna M. Sivalingam,et al.  Architecture and experimental results for quality of service in mobile networks using RSVP and CBQ , 2000, Wirel. Networks.

[13]  William C. Y. Lee Mobile Cellular Telecommunications: Analog and Digital Systems , 1995 .

[14]  Bartosz Mielczarek,et al.  Scenario-based performance analysis of routing protocols for mobile ad-hoc networks , 1999, MobiCom.

[15]  Scott Shenker,et al.  Comments on the performance of measurement-based admission control algorithms , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[16]  Mary Baker,et al.  Analysis of a local-area wireless network , 2000, MobiCom '00.

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

[18]  Mario Gerla,et al.  Fisheye state routing: a routing scheme for ad hoc wireless networks , 2000, 2000 IEEE International Conference on Communications. ICC 2000. Global Convergence Through Communications. Conference Record.

[19]  B. R. Badrinath,et al.  Integrated services packet networks with mobile hosts: Architecture and performance , 1999, Wirel. Networks.

[20]  Geng-Sheng Kuo,et al.  A probabilistic resource estimation and semi-reservation scheme for flow oriented multimedia wireless networks , 2001 .

[21]  Mario Gerla,et al.  A simulation study of table-driven and on-demand routing protocols for mobile ad hoc networks , 1999, IEEE Netw..