Analytical model for evaluating blocking probability in wireless ad hoc networks
Yuvaan Ramesh. Gugrajah, Fambirai Takawira · 2003
Routing protocols for ad hoc networks need to overcome the problems associated with dynamic and unpredictable topologies due to mobile nodes and the absence of base stations and central controllers. Currently, routing protocols are evaluated using discrete event simulators. Analytical methods to evaluate the end to end blocking probability are required in order to generate faster results for routing protocol comparison and network optimization. This paper proposes a semi-analytical method that incorporates fixed point approximation to account for mobility in ad hoc networks. Results are compared to those obtained by discrete event simulation.