Fig. 2From: An analytical model for wireless mesh networks with collision-free TDMA and finite queuesAn exemplary schedule corresponding to N=3, l S =3, \(\mathcal {T}_{0} = ()\), \(\mathcal {R}_{0} =(0,1)\), \(\mathcal {K}_{0} (0) =1\), \(\mathcal {K}_{0} (1) =1\), \(\mathcal {T}_{1} =(0,1)\), \(\mathcal {R}_{1} =(2)\), \(\mathcal {K}_{1} (0) =0\), \(\mathcal {K}_{1} (1) =0\), \(\mathcal {K}_{1} (2) =2\), \(\mathcal {T}_{2} =(2)\), \(\mathcal {R}_{2} =() \) and \(\mathcal {K}_{2} (2) =1\)Back to article page