Randomized dining philosophers to TDMA scheduling
Citations
1,050 citations
248 citations
Cites methods from "Randomized dining philosophers to T..."
...The slot assignment within the setup phase considers the two hop distance neighbor nodes and allocates different time slots based on the DRAND [65] algorithm and the frame size is determined by the time frame rule of the Z-MAC [66] protocol....
[...]
153 citations
Cites methods from "Randomized dining philosophers to T..."
...Z-MAC uses DRAND (Distributed RAND) [20] to compute time slot assignments....
[...]
...Because of the overhead of running DRAND, Z-MAC does not recommend running it periodically, hence it is not really traffic adaptive....
[...]
...However, DRAND is a complex coloring algorithm that allocates time slots to every node ensuring that no two nodes among a two-hop neighborhood are assigned to the same time slot by broadcasting the TDMA schedule of each node to its two hop neighbors....
[...]
110 citations
64 citations
References
1,050 citations
248 citations
153 citations
110 citations
64 citations