Algorithm 1. CSMA SINR threshold scheduling algorithm

-Each node is assigned with transmission attempt rate $\lambda >0$. -In each time slot, a randomly selected node $i$ is allowed to update its schedule $x_i\left(t\right)$ based on the information in the previous time slot. if $SIN{R}_i\left(x\left(t-1\right)\right)<T$, then $x_i\left(t\right)=0$ and node $i$ waits for another time slot to update its schedule again. else if $SIN{R}_i\left(x\left(t-1\right)\right)\ge T$, then Node $i$ exchanges messages with neighbors, to find if they can meet their $SINR$ requirements if link $i$ gets activated. if any of its neighbors can’t meet its requirement, then $x_i\left(t\right)=0$ and node $i$ waits for another time slot to update its schedule again. else if all neighbors can meet their $SINR$ requirements if link $i$ gets activated, then $x_i\left(t\right)=1$ with probability $\frac{{\lambda }_i}{1+{\lambda }_i}$ and $x_i\left(t\right)=0$ with probability $\frac{1}{1+{\lambda }_i}$. end if end if