Throughput analysis of IEEE802.11 multi-hop ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Modeling path capacity in multi-hop IEEE 802.11 networks for QoS services
IEEE Transactions on Wireless Communications
Performance analysis of the IEEE 802.11 distributed coordination function
IEEE Journal on Selected Areas in Communications
Capacity of large-scale CSMA wireless networks
Proceedings of the 15th annual international conference on Mobile computing and networking
A distributed CSMA algorithm for throughput and utility maximization in wireless networks
IEEE/ACM Transactions on Networking (TON)
Analytical modelling in 802.11 ad hoc networks
Computer Communications
Approaching throughput-optimality in distributed CSMA scheduling algorithms with collisions
IEEE/ACM Transactions on Networking (TON)
Stability and delay of distributed scheduling algorithms for networks of conflicting queues
Queueing Systems: Theory and Applications
| Hi-index | 0.00 |
This paper presents a simple method for computing throughputs of links in a CSMA network. We call our method back-of-the-envelop (BoE) computation, because for many network configurations, very accurate results can be obtained by simple hand computation. BoE beats prior methods in terms of both speed and accuracy. To explain BoE, we construct a theory based on the model of an "ideal CSMA network" (ICN). We find that link throughputs are insensitive to the distributions of the backoff countdown time and transmission time in ICN given the ratio of their mean c. The BoE computation method emerges from ICN in the limit c→0 . The insensitivity result explains why BoE works so well for IEEE 802.11 networks, in which the backoff countdown process is one that has memory and the transmission time can be arbitrarily distributed. Furthermore, c does not have to be very small for BoE to be highly accurate. BoE allows us to make shortcuts in performance evaluation, bypassing complicated stochastic analysis. An immediate application of BoE is for quick identification of starved links in the network so that remedies can be devised to solve the problem.