"... In PAGE 4: ... The distribu- tion of the measured transmission times for Mica2 and Mi- caZ are shown in Figure 4. Table1 summarizes the statistics of these times. In Table 1, the safe achievable rate (calculated using worst case latency) rmax is the maximum radio bandwidth a node in Wisden can support.... In PAGE 4: ... Table 1 summarizes the statistics of these times. In Table1 , the safe achievable rate (calculated using worst case latency) rmax is the maximum radio bandwidth a node in Wisden can support. As one might expect, the MicaZ allows approximately an order of magnitude higher packet rate5.... ..."

"... In PAGE 15: ... TCP performs well inside the US and causes many unnecessary retransmissions for the international countries. We can summarize the worst case percentage of retransmission and unnecessary retransmission with respect to the required number of packets sent in Table3 (The worst case is the largest number for the six times of day for each case). From the table at most 7% of the packets are retransmitted, and no more than 3.... ..."

"... In PAGE 10: ...1.4 Summary We summarize the worst case percentage of retransmission and unnecessary retransmission with respect to the required number of packets sent in Table2 . (The worst case is the largest number for the six times of day for each case in Tables A1 to A12.... ..."

"... In PAGE 13: ...etransmission varies from 20-66%. In .exe file this percentage is quite low, only 6-7%. Table4 summarizes the percentage of total and unnecessary retransmissions that occurred in the worst cases. Table 4: Worst case retransmission and unnecessary retransmission.... ..."

"... In PAGE 3: ... 4 bytes Now, we analyze the time spent on the bus to transmit a packet. Because steps 1 4 in Table1 are executed in the local processor, we do not take these delays into ac- count. Bus transfers start at step 5 where the time taken to transfer 2048 bytes of data is 2048b s tunit blt.... In PAGE 4: ... wc i;q = (q + 1)Ci + X 8j2hp(i) wc i;q Tj Cj: (3) We define P as the set of all processors and T(p) as the set of all tasks on processor p. Assuming task i is placed on processor p, the worst-case response time of message m is given by Rm i = max q=0;1;2;:::(Rc i + wm i;q ? qTi); (4) where width of bus busy period, wm i;q is given by wm i;q = Bm i + l1( + ) + l2( + ) (5) + X 8q2P; q6 =p min l1 + l2; X 8k2T(q) wm i;q Tk nk ; where l1 = ni(q + 1); l2 = X 8j2hp(i) wm i;q Tj nj: In Equation (5), is the time taken for the bus to transfer all data in a packet and is the worst-case computation time taken for the destination processor to handle packet arrival interrupt associated with steps 9 to 13 in Table1 . The pro- cessor p has l1 + l2 packets for the busy period where l1 and l2 respectively represent the number of packets for i and all tasks of higher priority than i.... ..."

"... In PAGE 5: ...Table1 illustrates the packet transmission steps. The map i describes the participant map located in the shared memory of participant i.... ..."

"... In PAGE 51: ...Table4 . From this table, the average number of packets per miss (read miss or invalidation) is 1 + 2PW + dp and the average number of message transmission per miss is 2 + 2PW .... ..."