Dynamic tuning of the IEEE 802.11 protocol to achieve a theoretical throughput limit
IEEE/ACM Transactions on Networking (TON)
A capacity analysis for the IEEE 802.11 MAC protocol
Wireless Networks
Performance analysis of the IEEE 802.11 distributed coordination function
IEEE Journal on Selected Areas in Communications
IEEE Transactions on Mobile Computing
Queuing network models for delay analysis of multihop wireless ad hoc networks
Proceedings of the 2006 international conference on Wireless communications and mobile computing
On the performance of ad hoc wireless LANs: a practical queuing theoretic model
Performance Evaluation - Performance modelling and evaluation of wireless ad hoc and sensor networks
Characterizing the exit process of a non-saturated IEEE 802.11 wireless network
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Capacity-aware routing in heterogeneous mesh networks: an analytical approach
Proceedings of the 12th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Load-aware routing in mesh networks: Models, algorithms and experimentation
Computer Communications
Routing Internet traffic in heterogeneous mesh networks: Analysis and algorithms
Performance Evaluation
Survey: Performance models for wireless channels
Computer Science Review
A new modeling and delay analysis of IEEE 802.11 distributed coordination function
UIC'07 Proceedings of the 4th international conference on Ubiquitous Intelligence and Computing
International Journal of Ad Hoc and Ubiquitous Computing
Cross-Layer Modeling of Wireless Channels: An Overview of Basic Principles
Wireless Personal Communications: An International Journal
Hi-index | 0.00 |
An M/MMGI/1/K queuing model is developed for the analysis of IEEE 802.11 DCF using RTS/CTS. Results are based on arbitrary contention conditions, namely, collision probabilities, transmission probabilities and contention window sizes vary arbitrarily among nodes contending for channel access. This is fundamentally different from earlier work. Results are presented for the fully-connected case and validated via simulation with statistical analysis. The main contributions are the analysis of DCF and the foundation for the analysis of multi-hop scenarios. A key element of the model is that complexity normally encountered is reduced by effectively restoring the independence between service times and packet inter-arrivals.