Research Article
Evolutionary Computation with Spatial Receding Horizon Control to Minimize Network Coding Resources
Table 6
Summarized results of general tests on SRHCGAs.
| | (Best average results of all combinations of and ) | Case I-1 | Case I-2 | Case II-1 | Case II-2 | Case II-3 | Case II-4 |
| | Average minimal coding links | | | | | | | | SRHCGA1 | 0.75 | 0.00 | 0.00 | 0.00 | 0.00 | 1.50 | | SRHCGA2 | 0.75 | 0.00 | 0.00 | 0.00 | 0.00 | 0 | | SRHCGA3 | 0.00 | 0.00 | 0.00 | 0.00 | 0.00 | 0.00 |
| | Total computational time (sec.) | | | | | | | | SRHCGA1 | 35.61 | 11.94 | 0.00 | 4.72 | 12.89 | 64.59 | | SRHCGA2 | 28.25 | 9.83 | 0.00 | 3.35 | 11.17 | 58.93 | | SRHCGA3 | 32.86 | 6.04 | 0.00 | 3.82 | 8.43 | 27.38 |
| Minimum actually achieved rate
at sinks | | | | | | | | SRHCGA1 | 3.5 | 3 | 2 | 2 | 2 | 1.75 | | SRHCGA2 | 3.75 | 3 | 2 | 2 | 2 | 1.50 | | SRHCGA3 | 4 | 3 | 2 | 2 | 2 | 2 |
| | A typical () pair that gives the best average results | | | | | | | | SRHCGA1 | (2,2) | (3,1) | (2,2) | (2,2) | (3,1) | (1,2) | | SRHCGA2 | (2,1) | (3,1) | (2,2) | (2,2) | (2,2) | (1,1) | | SRHCGA3 | (2,1) | (2,1) | (2,2) | (2,2) | (2,2) | (2,2) |
| | How many () pairs that give the best average results | | | | | | | | SRHCGA1 | 1 | 2 | 16 | 12 | 2 | 1 | | SRHCGA2 | 2 | 2 | 16 | 13 | 4 | 1 | | SRHCGA3 | 10 | 14 | 16 | 16 | 16 | 13 |
|
|
