1,077
Views
0
CrossRef citations to date
0
Altmetric
COMPUTER SCIENCE

A dynamic heuristic for WSNs routing

| (Reviewing editor)
Article: 1919040 | Received 11 Feb 2021, Accepted 23 Mar 2021, Published online: 18 May 2021

Figures & data

Figure 1. Weighted graph and its minimum spanning tree

Figure 1. Weighted graph and its minimum spanning tree

Figure 2. PRIM’s algorithm

Figure 2. PRIM’s algorithm

Figure 3. Nodes coverage in WSN

Figure 3. Nodes coverage in WSN

Figure 4. Tabu Node Selection Algorithm (TNS)

Figure 4. Tabu Node Selection Algorithm (TNS)

Figure 5. Nodes positions with 100 × 100 grid

Figure 5. Nodes positions with 100 × 100 grid

Table 1. WNS benchmarks

Table 2. Simulation parameters

Figure 6. Residual energy for energy level 10%

Figure 6. Residual energy for energy level 10%

Figure 7. Throughput for energy level 10%

Figure 7. Throughput for energy level 10%

Figure 8. Network lifetime for energy level 10%

Figure 8. Network lifetime for energy level 10%

Figure 9. Throughput for energy level 30%

Figure 9. Throughput for energy level 30%

Figure 10. Network lifetime for energy level 30%

Figure 10. Network lifetime for energy level 30%

Figure 11. Residual energy for energy level 30%

Figure 11. Residual energy for energy level 30%

Figure 12. Residual for energy level 40%

Figure 12. Residual for energy level 40%

Figure 13. Throughput for energy level 40%

Figure 13. Throughput for energy level 40%

Figure 14. Network lifetime for energy level 40%

Figure 14. Network lifetime for energy level 40%

Figure 15. Residual energy for energy level 50%

Figure 15. Residual energy for energy level 50%

Figure 16. Throughput for energy level 50%

Figure 16. Throughput for energy level 50%

Figure 17. Network lifetime for energy level 50%

Figure 17. Network lifetime for energy level 50%

Table 3. Comparison with E2S-DL (Sinde et al., Citation2020)