Delay analysis of completely irrepressible sequences for mobile ad hoc networks

Without requiring time synchronization, protocol sequences can be used to design a simple and reliable channel access protocol for mobile ad hoc networks. This paper focuses on completely irrepressible (CI) sequences, which can be employed to allow each user to have at least one successful packet transmission within each sequence period for a completely asynchronous channel. Previous numerical studies have shown by using carefully designed CI sequences, the average delay performance can be improved than using ALOHA-type schemes. To gain a unique insight into the characteristics of the protocol, we present an analytical model for the delay performance of CI sequences. The accuracy of our analytical model is verified via numerical results.