Skip to main content
. 2023 Nov 22;9:e1682. doi: 10.7717/peerj-cs.1682

Table 2. Node routing table at time  t.

Node ni
source Neighbor-node Hops RM 1 RM 2 RM 3 ... RM n
Class 0 sink n i1 h 0 RM1i1 RM2i1 RM3i1 ... RMn i1
sink n i2 h 0 RM1i2 RM2i2 RM3i2 ... RMn i2
sink n i3 h 0 RM1i3 RM2i3 RM3i3 ... RMn i3
Class 1 sink n i4 h 1 RM1i4 RM2i4 RM3i4 ... RMn i4
sink n i5 h 1 RM1i5 RM2i5 RM3i5 ... RMn i2
sink n i6 h 1 RM1i6 RM2i6 RM3i6 ... RMn i6
. . . . . . ... .
Class m . . . . . . ... .
sink n ik h m RM1ik RM2ik RM3ik ... RMn ik