User's Guide

- 11 of 42 –
neo.
cortec
.
Let us consider a situation with 2 nodes (Node A & B) within radio range of each other,
where their Beacon Timing is already synchronized, and they are about to become
neighbours to each other:
First, let us take a look at the transmission activity of Node A:
Figure 5 – Single node activity pattern
In this example, the Beacon Period (P
B
) is twice as long as the Scheduled Data Period
(P
SCD
).
As mentioned above, the beacon transmissions include information about the time until
next Scheduled Data transmission. When the neighbouring nodes receive the beacon,
they can assign a wake up event to listen for the Scheduled Data transmission of Node
A. Let us take a look at Node B’s activity (both TX and RX) compared to A:
Figure 6 – Activity pattern of two nodes
In the example above, Node B does not pick-up the Beacon transmission from Node A
at time t
0
, but receives the beacon transmission a time t
0
+ P
B
. Node B wakes up
hereafter to receive the Scheduled Data transmissions of Node A – the first time at t
1
+
2*P
SCD
.
Now Node B is neighbour to Node A.