| Autor: |
Byung-Jae Kwak, Nah-Oak Song, Miller, Leonard E. |
| Předmět: |
|
| Zdroj: |
IEEE/ACM Transactions on Networking; Apr2005, Vol. 13 Issue 2, p343-355, 13p, 10 Color Photographs, 3 Diagrams |
| Abstrakt: |
New analytical results are given for the performance of the exponential backoff (EB) algorithm. Most available studies on EB focus on the stability of the algorithm and little attention has been paid to the performance analysis of EB. In this paper, we analyze EB and obtain saturation throughput and medium access delay of a packet for a given number of nodes N. The analysis considers the general case of EB with backoff factor r; binary exponential backoff (BEB) algorithm is the special ease with r = 2. We also derive the analytical performance of EB with maximum retry limit M (EB-M), a practical version of EB. The accuracy of the analysis is checked against simulation results. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
