e-merge : A Heuristic for Improving Minimum Power Broadcast Trees in Wireless Networks

Wireless multicast/broadcast sessions, unlike wired networks, inherently reaches several nodes with a single transmission. For omnidirectional wireless broadcast to a node, all nodes closer will also be reached. Heuristic algorithms for constructing the minimum power tree in wireless networks have been proposed by Wieselthier et al [1] and Stojmenovic et al [4]. In this paper, we present the e-merge procedure, a heuristic for improving minimum power broadcast (MPB) trees in wireless networks. Simulation results show that better solutions are usually obtained, with considerably lower tree power, if the proposed procedure is applied to the trees generated using the Broadcast Incremental Power (BIP) algorithm discussed in [1].

[1]  Anthony Ephremides,et al.  Energy-Efficient Broadcast and Multicast Trees in Wireless Networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[2]  Robert J. Marks,et al.  Minimum power broadcast trees for wireless networks: optimizing using the viability lemma , 2002, 2002 IEEE International Symposium on Circuits and Systems. Proceedings (Cat. No.02CH37353).

[3]  Mahtab Seddigh,et al.  Internal nodes based broadcasting in wireless networks , 2001, Proceedings of the 34th Annual Hawaii International Conference on System Sciences.