Comparison of Algorithms for Station Registration on Power-up in an HFC Network

We study variations on the approach proposed by COM21's contribution to the IEEE 802.14 working group in 1] to re-register stations after a geographic power failure. This paper reports the results of a comparative study of various Contention Resolution Algorithms (CRA) that might be used in the registration process. The study described here focuses on the performance of three algorithms: p-persistent, in which stations transmit a registration request according to a probability of transmission at each frame, Truncated Binary Exponential Backoo which is driven by the number of frames the station has to wait between consecutive retransmissions and a Tree Algorithm which is centrally administered by the Head-end Controller (HEC) in a deterministic fashion. NOTICE: This contribution has been prepared to assist the IEEE 802.14 Working Group. It is ooered as a basis for discussion and is not binding on the authors or any company. The material in this document is subject to change in form and content after further study and the authors specially reserve the right to add to, amend, or withdraw the statements contained herein.