With a game-theoretic view, p-persistence slotted ALOHA is structured as a non-cooperative game, in which a Nash equilibrium is sought to provide a value for the probability of attempting to deliver a packet. An expression of Nash equilibrium necessar...
With a game-theoretic view, p-persistence slotted ALOHA is structured as a non-cooperative game, in which a Nash equilibrium is sought to provide a value for the probability of attempting to deliver a packet. An expression of Nash equilibrium necessarily includes the number of active outer stations, which is hardly available in many practical applications. In this paper, we thus propose a Bayesian scheme of predicting the number of active outer stations prior to deciding whether to attempt to deliver a packet or not. Despite only requiring the minimal information that an outer station is genetically able to acquire by itself, the Bayesian scheme demonstrates the competitive predicting performance against a method which depends on heavy information.