Skip to Main Content
A wireless network is composed of a set of autonomous mobile hosts. Each host has a transmission radius and energy level that are combined to determine its ability to transmit (receive) messages to (from) other peers in the network. Many algorithms have been proposed for dominating set calculations in Ad hoc wireless networks. In this paper we present an algorithm that could be applied to a network with unidirectional links taking power consumption, recharging, failures to recharge, and mobility into consideration. Since power consumption in nodes forming the dominating set is higher than in other nodes, our algorithm uses a selection scheme based on the energy level of each node and therefore changes the dominating set dynamically. This of course aims at extending the life span of a node, therefore extending the life span of the whole network. Our dominating set only consists of nodes that act as gateways for the network. This is done in order to minimize the selected dominating set and as a consequence minimize the consumed energy.