Research Article
Energy Aware Simple Ant Routing Algorithm for Wireless Sensor Networks
Table 3
Case 1 route discovery comparison for SARA and EASARA.
| | ā | EASARA | SARA |
| | Neighbor set | ( = 6.5) | | | ( = 6.5) | |
| | Link cost | : = 2; | : = 2; | | (, , ) = 0.25 | (, , ) = 0.25 | | : = 2; | : = 2; | | (, , ) = 0.33 | (, , ) = 0.33 |
| | Probability | (, , ) = 0.43 | (, , ) = 0.43 | | (, , ) = 0.56 | (, , ) = 0.56 |
| | Average energy threshold | 6.5 | ā |
| | Number of nodes in CBR | 2 (, ) | 2 (, ) |
| | Conclusion | Node is selected with greater probability based on energy and the less number of times it is used. Node energy is 6.5. | Node is selected based on less number of time used |
|
|