On the Throughput Capacity of Heterogeneous Wireless Networks

A substantial body of the literature exists addressing the capacity of wireless networks. However, it is commonly assumed that all nodes in the network are identical. The issue of heterogeneity has not been embraced into the discussions. In this paper, we investigate the throughput capacity of heterogeneous wireless networks with general network settings. Specifically, we consider an extended network with n normal nodes and m = n
^b
(0 ≤ b ≤ 1) more powerful helping nodes in a rectangular area with width s(n) and length n/s(n), where s(n) = n
^w
and 0 ≤ w ≤ 1/2. We assume that there are n flows in the network. All the n normal nodes are sources while only randomly chosen n
^d
(0 ≤ d ≤ 1) normal nodes are destinations. We further assume that the n normal nodes are uniformly and independently distributed, while the m helping nodes are either regularly placed or uniformly and independently distributed, resulting in two different kinds of networks called Regular Heterogeneous Wireless Networks and Random Heterogeneous Wireless Networks, respectively. We show that network capacity is determined by the shape of the network area, the number of destination nodes, the number of helping nodes, and the bandwidth of helping nodes. We also find that heterogeneous wireless networks can provide throughput higher in the order sense than traditional homogeneous wireless networks only under certain conditions.