Skip to Main Content
In this paper, we propose an analytical framework in order to compute the throughput capacity of a multi-hop ad hoc network with a finite number of mobile wireless nodes. The proposed framework consists of two related queueing networks; a closed BCMP queueing network to represent the mobility model of the wireless nodes and an open BCMP queueing network comprising symmetric M/G/l nodes to represent the multi-hop packet routing process from sources to destinations. In this respect, we consider very simple MAC and routing schemes and then map the related parameters onto several components of the queueing network. By solving the linear traffic equations corresponding to concerned queueing networks and the stability requirement of each node, we obtain throughput capacity, i.e., the maximum throughput with which the packets can be successfully received with finite delay. Finally, we compute the throughput capacity for different number of nodes and several mobility patterns and verify our approach by simulation.