Optimal Fair Scheduling in S-TDMA Sensor Networks for Monitoring River Plumes

<div>Example of network with twelve sensors: topology and throughput. Gateway node is node 1, in the gray circle, in both cases. Other nodes are clockwise numbered. (a) Gateway on the corner. (b) Gateway in the center.</div>

Journal of Sensors

fig2

Figure 2

Figure 2: Optimal Fair Scheduling in S-TDMA Sensor Networks for Monitoring River Plumes 