Delay Models for Contention Trees in Closed Populations

Abstract

In this chapter we extend the study of stand-alone contention trees to more practical settings. In such a setting, one must take into account that stations alternate between activity periods and idle periods, and the splitting procedure must be complemented with a channel access protocol to accommodate newcomers. We describe the standard algorithms to do this, free access and blocked access, and propose a novel mechanism: Scheduled blocked access.