Algorithm 1 The Process of MD-MAC.

Input: node $N_i$, the previous neighbor $N_j$, the following neighbor $N_k$, time stamp K Output: Initialization  Each node initializes its time stamp       //add the time stamp  For t=1 to T  While $t\le$ 2       //the first two period, collecting neighbors information   Each node transmit with its neighbors and build its   neighbor table  endwhile  If $t>2$ then       //start to adjust   For i=1 to N    If ${\varphi }_i=0$ then     $N_i$ send fire packet broadcast       //reach the firing point    else                                           //adjust phase according to different cases     If in case 1 & ${\varphi }_j$ = 0 then      $N_i$ adjusts its phase to $(1-\alpha ){\varphi }_i+\alpha {\varphi }_{mid}$     endIf     If in case 2 & ${\varphi }_{oh}=0$ & $K_i=K_{th}$ then      ($oh$ means one-hop neighbor and $tw$ means      two-hop neighbor)      $N_i$ adjusts its phase to $(1-\alpha ){\varphi }_i+\alpha {\varphi }_{mid}$     endIf     If in case 3 & ${\varphi }_{nearest}=0$ & $K_i+1=K_j=K_k$     then      $N_i$ adjusts its phase to $(1-\alpha ){\varphi }_i+\alpha {\varphi }_{mid}$     endIf     endIf   endFor  endIf  Each node has occupied a period of the frame       //success to occupy time slots  // Conflict detection process  If the collision occurs between nodes $N_i$ and $N_J$ in the one-hop    then       //punching    $N_i$ and $N_j$ calculate the punching frame based on $M_i$ and $M_j$   In next period    $N_i$ and $N_j$ keep listening in the frame they select  else    the collision occurs between nodes $N_i$ and $N_J$ in the two-hop       //neighbor detection    $N_k$ is the junction node of $N_i$ and $N_j$    $N_k$ send collision-warning packet to $N_i$ and $N_i$ backs off  endIf  endFor