A New TDMA Scheduling Algorithm for Data Collection over Tree-Based Routing in Wireless Sensor Networks

<table>An example where congestion-based scheduling performs better than nod-based scheduling and similar to level-based scheduling. (a) Node-based scheduling. (b) Level-based scheduling. (c) Congestion-based scheduling.</table>

International Scholarly Research Notices

fig4

Figure 4

Figure 4: A New TDMA Scheduling Algorithm for Data Collection over Tree-Based Routing in Wireless Sensor Networks 