Period = P Slice = S Task = T P-S q qT = rS S/q rr P-(S/q) 0
Period = P Slice = S Task = T qT = rS One packet per slice in the network, therefore T = S = 0.01 ms One slice per node in the network But... each node schedules its routing in a TDMA fashion as well... So for each hop P = (C+1)*N*S where C is the number of connections and N is the total number of nodes in the network.
Period = P Slice = S Task = T qT = rS Three computations = three slices, so P = S1 + S2 + S3 Task times may be bigger than slice times! T1 = 0.5 ms T2 = 3 ms T3 = 7 ms It is part of the assignment to figure out how P should be chosen and divided over S1,S2 and S3.
Sensor 1 and 2 produce 1 packet every 2 ms Sensor 3 produces 50 packets every 100 ms Sensor 4 produces 10 packets every 20 ms Computation 1 needs 1 packet from sensor 1 and 2, and produces 1 packet for computation 2 and one for actor 1 Computation 2 takes 50 packets from computation 1 and 1 packet from computation 3 and produces 1 for actors 2 and 3 and for computation 3. Computation 3 takes 50 packets from sensor 3, 50 from sensor 4 and 1 packet from compation 2 and produces 1 for computation 2.