ETRI-Knowledge Sharing Plaform

ENGLISH

성과물

논문 검색
구분 SCI
연도 ~ 키워드

상세정보

학술지 Performance Analysis of Exponential Backoff
Cited 281 time in scopus Download 6 time Share share facebook twitter linkedin kakaostory
저자
곽병재, 송나옥, Leonard E. Miller
발행일
200504
출처
IEEE/ACM Transactions on Networking, v.13 no.2, pp.343-355
ISSN
1063-6692
출판사
IEEE, ACM
DOI
https://dx.doi.org/10.1109/TNET.2005.845533
협약과제
05MH2200, WPAN 기반 무선홈네트워킹 기술 개발(High Data Rate WPAN 기반 초고속 무선 홈네트워킹 기술개발), 김재영
초록
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 case 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. © 2005 IEEE.
KSP 제안 키워드
Analytical performance, Medium access delay, Performance analysis, analytical results, binary exponential backoff, retry limit, saturation throughput, simulation results