We propose a distributed heuristic algorithm for finding power aware connected dominating set in a graph representing an ad hoc network. Simulation results show that we can route more packets compared to fixed dominating set finding algorithms. An extension of our algorithm constructs multiple node-disjoint power aware minimum connected dominating sets. Applying multi-path routing strategies on this multiple dominating sets, we show that the new algorithm works better than other power aware dominating set based schemes and offers results competitive with general power aware schemes in terms of various energy consumption metrics while maintaining smaller size of the dominating set.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.