We study network coding for multi-hop wireless networks. We focus the case of broadcasting, where one source transmits information to all the nodes in the network. Our goal is energy-efficient broadcasting, in other words, to minimize the number of transmissions for broadcasting to the entire network. To achieve this goal, we propose a family of methods that combine the use of network coding and connected dominating sets. They consists in rate selections using connected dominated sets (RAUDS: Rate Adjustment Using Dominating Sets, and an generalized version, MARAUDS). The main insight behind these methods is that their use of connected dominating sets, allows near-optimality in the core of the network, while they efficiently handle borders and non-uniformity. The main contribution is a formal proof of the performance of these families of algorithms. One main result is the comparison of performance between routing and these methods (and in general, network coding).
展开▼
