The Community for Technology Leaders
RSS Icon
Issue No.09 - September (2010 vol.9)
pp: 1319-1331
Soung Chang Liew , The Chinese University of Hong Kong, Hong Kong
Cai Hong Kai , The Chinese University of Hong Kong, Hong Kong
Hang Ching (Jason) Leung , Altai Technologies, Hong Kong
Piu (Bill) Wong , Altai Technologies, Hong Kong
This work started out with our discovery of a pattern of throughput distributions among links in IEEE 802.11 networks from experimental results. This pattern gives rise to an easy computation method, which we term back-of-the-envelop (BoE) computation. For many network configurations, very accurate results can be obtained by BoE within minutes, if not seconds, by simple hand computation. This allows us to make shortcuts in performance evaluation, bypassing complicated stochastic analysis. To explain BoE, we construct a theory based on the model of an “ideal CSMA network” (ICN). The BoE computation method emerges from ICN when we take the limit c \to 0, where c is the ratio of the mean backoff countdown time to the mean transmission time in the CSMA protocol. Importantly, we derive a new mathematical result: the link throughputs of ICN are insensitive to the distributions of the backoff countdown time and transmission time (packet duration) given the ratio of their means c. This insensitivity result explains why BoE works so well for practical 802.11 networks, in which the backoff countdown process is one that has memory, and in which the packet size can be arbitrarily distributed. Our results indicate that BoE is a good approximation technique for modest-size networks such as those typically seen in 802.11 deployments. Beyond explaining BoE, the theoretical framework of ICN is also a foundation for fundamental understanding of very-large-scale CSMA networks. In particular, ICN is similar to the Ising model in statistical physics used to explain phenomena arising out of the interactions of a large number of entities. Many new research directions arise out of the ICN model.
Access schemes, algorithm/protocol design and analysis, protocols and wireless.
Soung Chang Liew, Cai Hong Kai, Hang Ching (Jason) Leung, Piu (Bill) Wong, "Back-of-the-Envelope Computation of Throughput Distributions in CSMA Wireless Networks", IEEE Transactions on Mobile Computing, vol.9, no. 9, pp. 1319-1331, September 2010, doi:10.1109/TMC.2010.89
[1] G. Bianchi, "Performance Analysis of the IEEE 802.11 Distributed Coordination Function," IEEE J. Selected Areas in Comm., vol. 18, no. 3, pp. 535-547, Mar. 2000.
[2] P.C. Ng and S.C. Liew, "Throughput Analysis of IEEE802.11 Multi-Hop Ad-Hoc Networks," IEEE/ACM Trans. Networking, vol. 15, no. 2, pp. 309-322, Apr. 2007.
[3] P.C. Ng and S.C. Liew, "Offered Load Control in IEEE 802.11 Multi-Hop Ad-Hoc Networks," Proc. IEEE Int'l Conf. Mobile Ad-Hoc and Sensor Systems (MASS), 2004.
[4] G. Yan, D.-M. Chiu, and J.C.S. Lui, "Determining the End-to-End Throughput Capacity in Multi-Hop Networks: Methodology and Applications," Proc. ACM Sigmetric, 2006.
[5] M. Garetto, T. Salonidis, and E.W. Knightly, "Modeling Per-Flow Throughput and Capturing Starvation in CSMA Multi-Hop Wireless Networks," Proc. IEEE INFOCOM, 2006.
[6] K. Wang, F. Yang, Q. Zhang, and Y. Xu, "Modeling Path Capacity in Multi-Hop IEEE 802.11 Networks for QoS Services," IEEE Trans. Wireless Comm., vol. 6, no. 2, pp. 738-749, Feb. 2007.
[7] K. Medepalli and F.A. Tobagi, "Towards Performance Modeling of IEEE 802.11 Based Wireless Networks: A Unified Framework and Its Applications," Proc. IEEE INFOCOM, 2006.
[8] S.C. Liew, C. Kai, B. Wong, and J. Leung, "Back-of-the-Envelope Computation of Throughput Distributions in CSMA Wireless Networks," Technical Report,, Dec. 2007.
[9] R.R. Boorstyn et al., "Throughput Analysis in Multihop CSMA Packet Radio Networks," IEEE Trans. Comm., vol. 35, no. 3, pp. 267-274, Mar. 1987.
[10] X. Wang and K. Kar, "Throughput Modelling and Fairness Issues in CSMA/CA Based Ad-Hoc Networks," Proc. IEEE INFOCOM, 2005.
[11] M. Durvy and P. Thiran, "A Packing Approach to Compare Slotted and Non-Slotted Medium Access Control," Proc. IEEE INFOCOM, 2006.
[12] F.P. Kelly, "Loss Networks," Annals of Applied Probability, vol. 1, no. 3, pp. 319-378, 1991.
[13] D.Y. Burman, J.P. Lehoczky, and T. Lim, "Insensitivity of Blocking Probabilities of a Circuit-Switched Network," J. Applied Probability, vol. 21, no. 4, pp. 850-859, 1984.
[14] "MRF," , 2010.
[15] F.P. Kelly, Reversibility and Stochastic Networks. Wiley, 1979.
[16] "Maximum Independent Set," , 2010.
[17] "MADwifi," http://madwifi.orgwiki, 2008.
[18] IEEE Std 802.11-1997, IEEE 802.11 Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications, IEEE, 1997.
[19] IEEE Std 802.11e-2005, IEEE 802.11 Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications: Medium Access Control (MAC) Quality of Service Enhancements, IEEE, 2005.
[20] S.C. Liew and Y.J. Zhang, "Proportional Fairness in Multi-Channel Multi-Rate Wireless Networks—Part I: The Case of Deterministic Channel; Part II: The Case of Time-Varying Channel," IEEE Trans. Wireless Comm., vol. 7, no. 9, pp. 3446-3456 and 3457-3467, Sept. 2008.
[21] L. Jiang and J. Walrand, "A Distributed CSMA Algorithm for Throughput and Utility Maximization in Wireless Networks," IEEE/ACM Trans. Networking, vol. 18, no. 3, pp. 960-972, June 2010.
[22] V. Raghunathan and P.R. Kumar, "A Counterexample in Congestion Control of Wireless Networks," Performance Evaluation, vol. 64, no. 5, pp. 399-418, June 2007.
[23] L.B. Jiang and S.C. Liew, "Hidden-Node Removal and Its Application in Cellular WiFi Networks," IEEE Trans. Vehicular Technology, vol. 56, no. 5, pp. 2641-2654, Sept. 2007.
14 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool