Research Article

A Grouping Algorithm for Random Access Networks and Supermartingale Evaluation

Table 1

The main notations and descriptions of grouping algorithm.

NotationsDescriptions

The number of terminals
The level of hidden nodes
The number of arrival packets from node in slot
The arrival intensity of node
The number of groups
The total traffic load of group
The set of participants
The strategy space for node
The gain of hidden node minimization
The gain of load balance
The number of hidden nodes in current group for node
The number of hidden nodes in target group for node
The maximum total traffic load after adjustment
The minimum total traffic load after adjustment
The overall income when node is adjusted
The final income of each node