Energy Efficient Routing Based on Connected Dominating Sets

In this paper, we propose a set of heuristics to be used within greedy algorithms to build connected dominating sets (CDSs). These algorithms depends on a heuristic and we show that the selection of such heuristic is fundamental to optimizing system operation, both in terms of energy consumption and data transmission. Based on some parameters such as the node's degree, the distances between nodes and the already explored nodes, we propose two different heuristics, denoted H
_I
and H
_T
. Using the network simulator ns-2, we perform a number of experiments in different scenarios and analyzed the performance of our proposed algorithms. We show that our algorithms provide CDSs with lower connection duration at a lower energy cost than previous proposals.