This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Impacts of Topology and Traffic Pattern on Capacity of Hybrid Wireless Networks
December 2009 (vol. 8 no. 12)
pp. 1585-1595
ASCII Text
x 
 
Pan Li, Yuguang Fang, "Impacts of Topology and Traffic Pattern on Capacity of Hybrid Wireless Networks," IEEE Transactions on Mobile Computing, vol. 8, no. 12, pp. 1585-1595, December, 2009.
 
 
BibTex
x
 
@article{ 10.1109/TMC.2009.79,
author = {Pan Li and Yuguang Fang},
title = {Impacts of Topology and Traffic Pattern on Capacity of Hybrid Wireless Networks},
journal ={IEEE Transactions on Mobile Computing},
volume = {8},
number = {12},
issn = {1536-1233},
year = {2009},
pages = {1585-1595},
doi = {http://doi.ieeecomputersociety.org/10.1109/TMC.2009.79},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Mobile Computing
TI - Impacts of Topology and Traffic Pattern on Capacity of Hybrid Wireless Networks
IS - 12
SN - 1536-1233
SP1585
EP1595
EPD - 1585-1595
A1 - Pan Li,
A1 - Yuguang Fang,
PY - 2009
KW - Hybrid wireless networks
KW - throughput capacity
KW - network topology
KW - traffic pattern.
VL - 8
JA - IEEE Transactions on Mobile Computing
ER -
 
Pan Li, University of Florida, Gainesville
Yuguang Fang, University of Florida, Gainesville
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 n^d (0<d<1) randomly chosen destination nodes, together with n^b (0<b<1) base stations in a network area of [0, n^w]\times [0, n^{1-w}] (0<w \le {1\over 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 \{n^{b-1}, n^{d-1}\}, \min \{{n^{w-1}\over \sqrt{\log n}}, n^{d-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 \{{n^{b - 1}\over \log n}, n^{d-1}\}, \min \{{n^{w-1}\over \sqrt{\log n}}, n^{d-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] A. Agarwal and P. Kumar, “Capacity Bounds for Ad Hoc and Hybrid Wireless Networks,” ACM SIGCOMM Computer Comm. Rev., vol. 34, no. 3, pp. 71-81, July 2004.
[2] O. Arpacioglu and Z. Haas, “On the Scalability and Capacity of Wireless Networks with Omnidirectional Antennas,” Proc. IEEE Information Processing in Sensor Networks (IPSN), Apr. 2004.
[3] N. Bansal and Z. Liu, “Capacity, Delay, and Mobility in Wireless Ad-Hoc Networks,” Proc. IEEE INFOCOM, Mar. 2003.
[4] C. Buraagohain, S. Suri, C. Toth, and Y. Zhou, “Improved Throughput Bounds for Interference-Aware Routing in Wireless Networks,” Proc. Computing and Combinatorics Conf. (COCOON '07), July 2007.
[5] T. Cormen, C. Leiserson, R. Rivest, and C. Stein, Introduction to Algorithms, second ed. MIT Press, 2001.
[6] O. Dousse, M. Franceschetti, and P. Thiran, “On the Throughput Scaling of Wireless Relay Networks,” IEEE Trans. Information Theory, joint special issue with IEEE/ACM Trans. Networking, vol. 52, no. 6, pp. 2756-2761, June 2006.
[7] O. Dousse and P. Thiran, “Connectivity vs Capacity in Dense AdHoc Networks,” Proc. IEEE INFOCOM, Mar. 2004.
[8] E. Duarte-Melo, A. Josan, M. Liu, D. Neuhoff, and S. Pradhan, “The Effect of Node Density and Propagation Model on Throughput Scaling of Wireless Networks,” Proc. IEEE Int'l Symp. Information Theory (ISIT '06), July 2006.
[9] M. Franceschetti, O. Dousse, D.N. Tse, and P. Thiran, “Closing the Gap in the Capacity of Wireless Networks via Percolation Theory,” IEEE Trans. Information Theory, vol. 53, no. 3, pp. 1009-1018, Mar. 2007.
[10] A. Gamal, J. Mammen, B. Prabhakar, and D. Shah, “Throughput-Delay Trade Off in Wireless Networks,” Proc. IEEE INFOCOM, Mar. 2004.
[11] M. Grossglauser and D. Tse, “Mobility Increases the Capacity of Ad Hoc Wireless Networks,” IEEE/ACM Trans. Networking, vol. 10, no. 4, pp. 477-486, Aug. 2002.
[12] P. Gupta and P. Kumar, “The Capacity of Wireless Networks,” IEEE Trans. Information Theory, vol. 46, no. 2, pp. 388-404, Mar. 2000.
[13] D. Knuth, The Art of Computer Programming. Addison-Wesley, 1998.
[14] U. Kozat and L. Tassiulas, “Throughput Capacity of Random AdHoc Networks with Infrastructure Support,” Proc. ACM MobiCom, June 2003.
[15] P. Li, C. Zhang, and Y. Fang, “Capacity and Delay of Hybrid Wireless Broadband Access Networks,” IEEE J. Selected Areas in Comm., special issue on broadband access networks, vol. 27, no. 2, pp. 117-125, Feb. 2009.
[16] X. Lin, G. Sharma, R. Mazumdar, and N. Shroff, “Degenerate Delay-Capacity Tradeoffs in Ad-Hoc Networks with Brownian Mobility,” IEEE/ACM Trans. Networking, special issue on networking and information theory, vol. 14, pp. 2777-2784, June 2006.
[17] B. Liu, Z. Liu, and D. Towsley, “On the Capacity of Hybrid Wireless Networks,” Proc. IEEE INFOCOM, Mar. 2003.
[18] B. Liu, P. Thiran, and D. Towsley, “Capacity of a Wireless Ad Hoc Network with Infrastructure,” Proc. ACM MobiHoc, Sept. 2007.
[19] J. Mammen and D. Shah, “Throughput and Delay in Random Wireless Networks with Restricted Mobility,” IEEE Trans. Information Theory, vol. 53, no. 3, pp. 1108-1116, Mar. 2007.
[20] R. Moraes, H. Sadjadpour, and J. Garcia-Luna-Aceves, “On Mobility-Capacity-Delay Trade Off in Wireless Ad Hoc Networks,” Proc. IEEE/ACM Int'l Symp. Modeling, Analysis, and Simulation of Computer and Telecomm. Systems (MASCOTS '04), Oct. 2004.
[21] A. Ozgur, O. Leveque, and D. Tse, “How Does the Information Capacity of Ad Hoc Networks Scale?” Proc. 44th Ann. Allerton Conf. Comm., Control and Computing, Sept. 2006.
[22] Y. Pei, J. Modestino, and X. Wang, “On the Throughput Capacity of Hybrid Wireless Networks Using an L-Maximum-Hop Routing Strategy,” Proc. IEEE Vehicular Technology Conf., 2003.
[23] T. Rappaport, Wireless Communications: Principles and Practice, second ed. Prentice-Hall PTR, 2002.
[24] S. Toumpis, “Capacity Bounds for Three Classes of Wireless Networks,” Proc. ACM MobiHoc, May 2004.
[25] A. Zemlianov and G. Veciana, “Capacity of Ad Hoc Wireless Networks with Infrastructure Support,” IEEE J. Selected Areas in Comm., vol. 23, no. 3, pp. 657-667, Mar. 2005.
[26] S. Zhao and D. Raychaudhuri, “On the Scalability of Hierarchical Hybrid Wireless Networks,” Proc. IEEE 40th Ann. Conf. Information Sciences and Systems (CISS '06), Mar. 2006.

Index Terms:
Hybrid wireless networks, throughput capacity, network topology, traffic pattern.
Citation:
Pan Li, Yuguang Fang, "Impacts of Topology and Traffic Pattern on Capacity of Hybrid Wireless Networks," IEEE Transactions on Mobile Computing, vol. 8, no. 12, pp. 1585-1595, Dec. 2009, doi:10.1109/TMC.2009.79
Usage of this product signifies your acceptance of the Terms of Use.