Impacts of Topology and Traffic Pattern on Capacity of Hybrid Wireless Networks

In this paper, we investigate the throughput capacity in wireless hybrid networks with various network topologies and traffic patterns. Specifically, we consider n randomly distributed nodes, out of which there are n source nodes and nd (0 < d < 1) randomly chosen destination nodes, together with nb (0 < b < 1) base stations in a network area of [0, nw] times [0, n1-w] (0 < w les 1/2 ). We first study the throughput capacity when the base stations are regularly placed and their transmission power is large enough for them to directly transmit to any nodes associated with them. We show that a per-node throughput of max{min{nb-1, nd-1}, min {nw-1/radiclog n, nd-1}} bits/sec is achievable by all nodes. We then investigate the throughput capacity when the base stations are uniformly and randomly placed, and their transmission power is as small as that of the normal nodes. We present that each node can achieve a throughput of max{min{nb-1/log n, nd-1}, min {nw-1/radiclog n, nd-1}} bits/sec. In both settings, we observe that only when d > b and d > w, the maximum achievable throughput can be determined by both the number of base stations and the shape of network area. In all the other cases, the maximum achievable throughput is only constrained by the number of destination nodes. Moreover, the results in these two settings are the same except for the case d > b > w, in which the random placement of base stations will cause a degradation factor of log n on the maximum achievable throughput compared to the regular placement. Finally, we also show that our results actually hold for different power propagation models.

[1]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[2]  Hamid R. Sadjadpour,et al.  On mobility-capacity-delay trade-off in wireless ad hoc networks , 2004, The IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, 2004. (MASCOTS 2004). Proceedings..

[3]  Z.J. Haas,et al.  On the scalability and capacity of wireless networks with omnidirectional antennas , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[4]  Massimo Franceschetti,et al.  On the throughput scaling of wireless relay networks , 2006, IEEE Transactions on Information Theory.

[5]  D. Raychaudhuri,et al.  On the Scalability of Hierarchical Hybrid Wireless Networks , 2006, 2006 40th Annual Conference on Information Sciences and Systems.

[6]  Yuguang Fang,et al.  Capacity and delay of hybrid wireless broadband access networks , 2009, IEEE J. Sel. Areas Commun..

[7]  Olivier Leveque,et al.  How does the information capacity of ad hoc networks scale , 2006 .

[8]  Donald F. Towsley,et al.  Capacity of a wireless ad hoc network with infrastructure , 2007, MobiHoc '07.

[9]  Devavrat Shah,et al.  Throughput-delay trade-off in wireless networks , 2004, IEEE INFOCOM 2004.

[10]  Gustavo de Veciana,et al.  Capacity of ad hoc wireless networks with infrastructure support , 2005, IEEE Journal on Selected Areas in Communications.

[11]  Patrick Thiran,et al.  Connectivity vs capacity in dense ad hoc networks , 2004, IEEE INFOCOM 2004.

[12]  Panganamala Ramana Kumar,et al.  Capacity bounds for ad hoc and hybrid wireless networks , 2004, CCRV.

[13]  Devavrat Shah,et al.  Throughput and Delay in Random Wireless Networks With Restricted Mobility , 2007, IEEE Transactions on Information Theory.

[14]  Theodore S. Rappaport,et al.  Wireless communications - principles and practice , 1996 .

[15]  David Tse,et al.  Mobility increases the capacity of ad hoc wireless networks , 2002, TNET.

[16]  Stavros Toumpis,et al.  Capacity bounds for three classes of wireless networks: asymmetric, cluster, and hybrid , 2004, MobiHoc '04.

[17]  Leandros Tassiulas,et al.  Throughput capacity of random ad hoc networks with infrastructure support , 2003, MobiCom '03.

[18]  Zhen Liu,et al.  Capacity, delay and mobility in wireless ad-hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[19]  Donald F. Towsley,et al.  On the capacity of hybrid wireless networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[20]  Yong Pei,et al.  On the Throughput Capacity of Hybrid Wireless Networks Using an L-Maximum-Hop Routing Strategy , 2007, Wirel. Pers. Commun..

[21]  Ness B. Shroff,et al.  Degenerate delay-capacity tradeoffs in ad-hoc networks with Brownian mobility , 2006, IEEE Transactions on Information Theory.

[22]  Massimo Franceschetti,et al.  Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory , 2007, IEEE Transactions on Information Theory.

[23]  Mingyan Liu,et al.  The Effect of Node Density and Propagation Model on Throughput Scaling of Wireless Networks , 2006, 2006 IEEE International Symposium on Information Theory.

[24]  David Thomas,et al.  The Art in Computer Programming , 2001 .

[25]  Csaba D. Tóth,et al.  Improved Throughput Bounds for Interference-Aware Routing in Wireless Networks , 2007, COCOON.