p-shrink: A Heuristic for Improving Minimum All-to-All Power Broadcast Trees in Wireless Networks

摘要

All-to-all broadcast refers to a network scheme where every node communicates to every other node in the network; all-to-all broadcast problem uses minimum unique cast tree (MUCT) scheme to generate power efficient all-to-all broadcast tree (BT) in wireless networks. The minimum all-to-all power broadcast problem is shown as NP-complete. In this paper, we have presented the p-shrink procedure, a heuristic to find all-to-all minimum power broadcast trees in wireless networks. Specifically, we focus on low complexity Kruskal's minimum spanning tree algorithm and show through extensive experimentations that power-efficient broadcast trees are obtained almost always, with considerably minimum all-to-all power with the proposed heuristic. The simulation results on numerous bench mark problem instances with 20, 50, and 100 vertices confirm that the proposed heuristic significantly reduces the total all-to-all power cost of broadcast trees.