Abstract
The distributed coordination function (DCF) is specified for both ad-hoc and infrastructure network configurations in the IEEE 802.11 standard. In this paper, we present an analytic model for evaluating the performance at nodes in a DCF based ad-hoc network without the assumption of saturation condition made in previous works. We model each node as a discrete time M/G/1 queue and describe the distribution of the DCF virtual service time by means of probability generating function (PGF), and further, obtain the average packet queueing delay and response time. Three adjustable input parameters are the number of stations n, packet arrival rate λ, and average payload length E[P], The analytical results are validated through extensive simulations, and it is shown that the model has significant high accuracy.
Original language | English |
---|---|
Title of host publication | Proceedings ITCC 2005 - International Conference on Information Technology |
Subtitle of host publication | Coding and Computing |
Editors | H. Selvaraj, P.K. Srimani |
Pages | 681-686 |
Number of pages | 6 |
Volume | 2 |
Publication status | Published - 2005 |
Event | ITCC 2005 - International Conference on Information Technology: Coding and Computing - Las Vegas, NV, United States Duration: 2005 Apr 4 → 2005 Apr 6 |
Other
Other | ITCC 2005 - International Conference on Information Technology: Coding and Computing |
---|---|
Country/Territory | United States |
City | Las Vegas, NV |
Period | 05-04-04 → 05-04-06 |
All Science Journal Classification (ASJC) codes
- General Engineering