Algorithms for Enumerating All Spanning Trees ofUndirected and Weighted Graphs
SIAM Journal on Computing
Derandomizing Approximation Algorithms Based on Semidefinite Programming
SIAM Journal on Computing
Hi-index | 0.00 |
Common information dissemination through multihop broadcasting is a key application in many wireless network operations. In all such applications the data transmission rate of broadcast plays a vital role in determining network performance. In this paper we propose two schemes for maximizing the broadcast rate in case of static wireless networks. Our two novel deterministic heuristic approaches, Alluvion and Cascade, effectively solve the problem. Both these algorithms are based on the idea of formation of spanning(broadcast) trees and then using a pipelined TDMA scheme to find the transmission rate. Alluvion, on an average performs significantly better than existing approaches like Deluge by atleast 80 percent which in turn proves the efficiency of our heuristic. Cascade, on the other hand performs better than Alluvion for small networks and can push upto 125 percent improvement over Deluge.