Performance of multipath routing for on-demand protocols in mobile ad hoc networks
Mobile Networks and Applications
ICPP '02 Proceedings of the 2001 International Conference on Parallel Processing
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
The Rigorous Evaluation of Enterprise Java Bean Technology
ICOIN '01 Proceedings of the The 15th International Conference on Information Networking
Connection-Oriented Routing in Ad Hoc Networks Based on Dynamic Group Infrastructure
ISCC '00 Proceedings of the Fifth IEEE Symposium on Computers and Communications (ISCC 2000)
A Performance Comparison of the Temporally-Ordered Routing Algorithm and Ideal Link-State Routing
ISCC '98 Proceedings of the Third IEEE Symposium on Computers & Communications
Introduction to Probability Models, Ninth Edition
Introduction to Probability Models, Ninth Edition
On Dynamic Distribution of Private Keys over MANETs
Electronic Notes in Theoretical Computer Science (ENTCS)
Hi-index | 0.00 |
Design and analysis of routing protocols are the key issues for a mobile ad hoc network (MANET). The Dynamic Source Routing (DSR) protocol is one of the important on-demand routing protocols. In this paper, we develop a comprehensive analytic model for the performance study of the DSR protocol with multiple routes. Two performance metrics, called probability of a successful data transmission and probability that the multiple routes can support the next data transmission, are introduced. We derive both of the two probabilities for the general case over n multiple routes for the DSR protocol. These analytic results provide insights into the mechanics of the multiple DSR routing protocol. It is also useful for the design and implementation of the on-demand routing for MANET.