Require:  neighborhood matrix
Ensure:  time-slots assignment scheme for each node
( )  ts = 1
( )  for   ; ; ++  do
( )   if   [ ][ ]==1 && node has not any time-slot  then
( )    ( ) T( ) (i, ts)
( )   T(i) T(i) (j, ts)
( )   end if
( )   for   ; ; ++  do
( )    if  I[ ][k]==1 &&   then
( )      T( ) T( ) ( , ts)
(10)   end if
(11) end for
(12)  ts++
(13)end for
Algorithm 1: Time-slots assignment algorithm.