Approximating All-to-All Broadcast in Wireless Networks

All-to-all broadcast is a communication pattern in which every node initiates a broadcast request. In this paper we investigate the problem of building a unique cast tree, that is unoriented (unrooted) tree and has minimal total power - minimal unique cast (MUC) tree - to be used or all-to-all broadcast. We propose a polynomial-time approximation algorithm for MUC problem. The power level of a node is selected to ensure bidirectional communication with its siblings, thus broadcast and convergecast can be performed in the tree starting at any node.