Research Article

A Grouping Algorithm for Random Access Networks and Supermartingale Evaluation

Algorithm 1

The game-based grouping algorithm.
Input: The number of groups K, the arrival intensity , the hidden node matrix W.
Output: The grouping results .
1: Select arbitrary K nodes and assign them to the K groups respectively.
2: Calculate the traffic load of each group, and determine.
  the group M that has the minimum traffic load.
3: Assign the next node i to group M.
4: If node i is the last node
5: Go to step 9.
6: Else
7: Go to step 2.
8: End If
9: Calculate and for each node.
10: Determine the m nodes that satisfy inequality (10).
11: If m=0.
12: Stop.
13: Else
14: Calculate for the m nodes.
15: Adjust the node that could bring the largest to target group.
16: Go to step 9.
17: End If