Figure 3 An example of weak and strong contentions: (a) the node topology graph, (b) the corresponding strong contention graph, and (c) the corresponding weak contention graph.
In "Incomplete Game", access delay performance is far better than "NM", and comparable with "IBM", as it can easily adapt the variable game state and choose the corresponding equilibrium strategy by adjusting contention window according to number of nodes.
Assuming that none of the collided L2/L3 messages can be correctly decoded by eNB, the corresponding UE will not receive the contention resolution message.
The core idea of our algorithm is to tune the contention window size (CW) corresponding to the maximum queue backlog to achieve the required transmission probability.
The metric used in this contention is a utility U, corresponding to the received SNR in the dB scale, i.e., (U equiv log {SNR_{{{rcvd}}}}).
Second, we follow [28] to modify the values of in accordance with the 802.11 MAC and PHY specifications [29], with corresponding to the first backoff stage using the maximum contention window size (8).
The generalized results were then compared with the corresponding performance results of B-MAC considering two different cases: (1) standard contention window, and (2) nonstandard contention window.
Given that, we define as the strong contention graph, where a vertex in corresponds to a flow in, and a bidirectional edge in denotes the corresponding flows in strongly contend with each other in the node topology graph.
The priorities of these ACs are determined by their corresponding operational parameters such as arbitration inter frame space (AIFS), contention window (CW) size, and transmission opportunity limit (TXOPlimit).
The latter involves waiting intervals of different length, called Arbitrary Distributed Interframe Spaces (AIFSs), and backoff intervals of different length, called Contention Windows (CWs), according to the priority of the corresponding packet buffer, called Access Category (AC).
