On Optimizing Non-Asymptotic Throughput of Wireless Mesh Networks

In this paper, throughput performance of WMNs is studied. In our model, a regular grid backbone network overlays on a random ad hoc network. We propose a framework to calculate non-asymptotic throughput, which can be obtained by computing several deterministic parameters. Two problems are investigated. In Maximum Throughput Partition (MTP) problem, the ideal throughput is achieved by optimally partitioning the network with a proper number of backbone nodes. In Maximum Throughput Partition with Hops´ number Constraint (MTPHC) problem, a similar problem is studied but with constraint on the average number of hops in the backbone network. The results show that it is critical to find an appropriate size of the backbone network for a WMN, especially when the hops´ number constraint is imposed Our solution of MTPHC problem can be also used to obtain the ideal transmission range when less-than-optimal number of backbone nodes is deployed. Comparing with the minimum transmission range, the ideal one can achieve the same optimal throughput but effectively reduce the average number of hops in mesh backbone communications.