Skip to Main Content
In this paper, we focus our study on energy-efficient routing algorithms. We study an algorithm called energy-efficient tree-based routing, which is based on a tree-like topology rooted at a fixed base station (sink node) of the network with a fixed 2-dimensional (2D) grid topology. The performance of this algorithm is assessed by computer simulation and is compared with other existing algorithms. Tree-based routing algorithm is found to achieve longer network lifetime, smaller end-to-end network delay, and has better robustness to failures when compared with other algorithms in the case where the base station is placed at the perimeter of the grid.