An effective heuristic for construction of all-to-all minimum power broadcast trees in wireless networks

All-to-all broadcast refers to the process by which every node inherently communicates to every other node in the network. The all-to-all broadcast problem seeks a broadcast tree scheme using minimum unique cast tree (MUCT) with minimum energy consumption. The “minimum all-to-all power broadcast problem is NP-Hard”. This work proposes an energy efficient heuristic to find minimum all-to-all power shared broadcast trees in wireless networks. The simulation results on numerous problem instances confirm that the proposed heuristic significantly outperforms existing heuristics in terms of all-to-all broadcast power minimization.