In addition, if the quantity c of conflicts of the first UE is greater than the threshold C0, the conflict time w of the first UE is greater than the threshold W0, or whether the service priority Q of the first UE or the priority of the UE is lower than the threshold Q0, the transmit probability P is 1. It should be noted that when the priority of the first UE is relatively high, the transmit probability of the first UE is 100%. When the quantity c of conflicts and/or the conflict time w are/is greater than corresponding thresholds/a corresponding threshold, the transmit probability is 100%. That is, UE that has not obtained a resource for quite a long time has a transmit probability of 100%.
Alternatively, P=f(x)·x is one of N, N-S, N/S, the service priority Q of the first UE, the priority of the UE, a value customized by the first UE, c, w, or a function g(c, w) of c and w, and different values of x are corresponding to different functions represented by f(x). For example, P=f1(N), P=f2(N/S), P=f3(N-S), P=f4(Q), P=f5(c), P=f6(w), or P=f7(c, w). A correspondence between a function and a value of x may be stipulated or predefined in a protocol. The present invention includes, but is not limited to, the following function relationship a simple linear relationship P=ax+b, a modulo relationship P=x mod Nt, or a segmentation mapping relationship, where one value of x is corresponding to one value of P that is obtained by means of table lookup, and certainly, a parameter in the function, such as a, b, or Nt, is a predefined parameter.
It should be noted that, in this embodiment of the present invention, S is a quantity of UEs in a first group corresponding to the first UE, and N is a quantity of UEs that are in the first group and that send data.