Issue No.08 - August (2008 vol.7)
pp: 1011-1024
An infrastructure wireless mesh network (WMN) is a hierarchical network consisting of mesh clients, mesh routers and gateways. Mesh routers constitute a wireless mesh backbone, to which mesh clients are connected as a star topology, and gateways are chosen among mesh routers providing Internet access. In this paper, the throughput capacity of infrastructure WMNs is studied. For such a network with Nc randomly distributed mesh clients, Nr regularly placed mesh routers and Ng gateways, assuming that each mesh router can transmit at W bits/s, the per-client throughput capacity has been derived as a function of Nc , Nr , Ng and W . The result illustrates that, in order to achieve high capacity performance, the number of mesh routers and the number of gateways must be properly chosen. It also reveals that an infrastructure WMN can achieve the same asymptotic throughput capacity as that of a hybrid ad hoc network by choosing only a small number of mesh routers as gateways. This property makes WMNs a very promising solution for future wireless networking.
Network topology, Network Communications, throughput capacity, wireless mesh networks
Ping Zhou, Xudong Wang, Ramesh Rao, "Asymptotic Capacity of Infrastructure Wireless Mesh Networks", IEEE Transactions on Mobile Computing, vol.7, no. 8, pp. 1011-1024, August 2008, doi:10.1109/TMC.2007.70778
[1] R. Bruno, M. Conti, and E. Gregori, “Mesh Networks: Commodity Multihop Ad Hoc Networks,” IEEE Comm. Magazine, vol. 43, no. 3, pp. 123-131, Mar. 2005.
[2] I.F. Akyildiz, X. Wang, and W. Wang, “Wireless Mesh Networks: A Survey,” Computer Networks J., vol. 47, no. 4, pp. 445-487, Mar. 2005.
[3] P. Gupta and P.R. Kumar, “The Capacity of Wireless Networks,” IEEE Trans. Information Theory, vol. 46, no. 2, pp. 388-404, 2000.
[4] P. Gupta and P.R. Kumar, “Internets in the Sky: The Capacity of Three-Dimensional Wireless Networks,” Comm. Information and Systems, vol. 1, no. 1, pp. 33-49, Jan. 2001.
[5] S. Kulkarni and P. Viswanath, “A Deterministic Approach to Throughput Scaling in Wireless Networks,” IEEE Trans. Information Theory, vol. 50, no. 6, pp. 1041-1049, June 2004.
[6] M. Grossglauser and D. Tse, “Mobility Increases the Capacity of Ad Hoc Wireless Networks,” Proc. IEEE INFOCOM '01, 2001.
[7] B. Liu, Z. Liu, and D. Towsley, “On the Capacity of Hybrid Wireless Networks,” Proc. IEEE INFOCOM '03, 2003.
[8] U.C. Kozat and L. Tassiulas, “Throughput Capacity of Random Ad Hoc Networks with Infrastructure Support,” Proc. ACM MobiCom '03, 2003.
[9] A. Zemlianov and G. de 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.
[10] S. Toumpis, “Capacity Bounds for Three Classes of Wireless Networks: Asymmetric, Cluster, and Hybrid,” Proc. ACM MobiHoc '04, 2004.
[11] A. Agarwal and P.R. Kumar, “Capacity Bounds for Ad Hoc and Hybrid Wireless Networks,” ACM SIGCOMM Computer Comm. Rev., special issue on science of networking design, vol. 34, no. 3, pp. 71-81, July 2004.
[12] M. Penrose, “The Longest Edge of the Random Minimal Spanning Tree,” Annals of Applied Probability, vol. 7, no. 2, pp. 340-361, 1997.
[13] T. Hagerup and C. Rub, “A Guided Tour of Chernoff Bounds,” Information Processing Letters, vol. 33, no. 6, pp. 305-308, 1990.
[14] R. Motwani and P. Raghavan, Randomized Algorithms, first ed. Cambridge Univ. Press, 1995.
[15] M. Kunde, “Block Gossiping on Grids and Tori: Deterministic Sorting and Routing Match the Bisection Bound,” Proc. European Symp. Algorithms (ESA '91), pp. 260-271, 1991.
[16] J. Robinson and E. Knightly, “A Performance Study of Deployment Factors in Wireless Mesh Networks,” Proc. IEEE INFOCOM '07, 2007.
[17] M. Alicherry, R. Bhatia, and L. Li, “Joint Channel Assignment and Routing for Throughput Optimization in Multi-Radio Wireless Mesh Networks,” Proc. ACM MobiCom '05, 2005.
[18] E.W. Weisstein, “Hypercube Line Picking,” Mathworld—A Wolfram Web Resource, HypercubeLinePicking.html , 2006.