<p>Three of the most important factors with regards to wireless multi-hop networks, namely reachability, energy consumption and network stability are considered in our transmitter macrodiversity supported broadcasting routing algorithms. Broadcasting applications are not only used to send routing table, queries, programming logic, any specific request etc. to all the nodes from access point but are also capable of playing a vital role in wireless TV distributions and visual sensor networks. All the algorithms are simulated in the MATLAB environment in which the nodes are random and are battery driven on a multi-hop randomized topology. Four new single frequency network (SFN) based algorithms (SFN-A, SFN-B, SFN-C and SFN-D) are formed in order to work over multi-hopping and where three of the algorithms SFN-A, SFN-B and SFN-D bear more or less the same amount of reachability. These three algorithms are able to reach more than 90% of reachability in only Tx power -8dBm whereas non-SFN requires -4dBm and SFN-C requires -2dBm and, in addition can achieve a maximum of 29 percentage points more reachability than the non-SFN algorithm. However, the best algorithm SFN-D consumes a maximum of 58.76% less energy than the SFN-A and a maximum of 14.28% less energy than the SFN-B. The SFN-D algorithm achieves a maximum 3.43 dB diversity gain together with the maximum 37.33% energy consumption gain in comparison to the non-SFN algorithm.</p>

Three of the most important factors with regards to wireless multi-hop networks, namely reachability, energy consumption and network stability are considered in our transmitter macrodiversity supported broadcasting routing algorithms. Broadcasting applications are not only used to send routing table, queries, programming logic, any specific request etc. to all the nodes from access point but are also capable of playing a vital role in wireless TV distributions and visual sensor networks. All the algorithms are simulated in the MATLAB environment in which the nodes are random and are battery driven on a multi-hop randomized topology. Four new single frequency network (SFN) based algorithms (SFN-A, SFN-B, SFN-C and SFN-D) are formed in order to work over multi-hopping and where three of the algorithms SFN-A, SFN-B and SFN-D bear more or less the same amount of reachability. These three algorithms are able to reach more than 90% of reachability in only Tx power -8dBm whereas non-SFN requires -4dBm and SFN-C requires -2dBm and, in addition can achieve a maximum of 29 percentage points more reachability than the non-SFN algorithm. However, the best algorithm SFN-D consumes a maximum of 58.76% less energy than the SFN-A and a maximum of 14.28% less energy than the SFN-B. The SFN-D algorithm achieves a maximum 3.43 dB diversity gain together with the maximum 37.33% energy consumption gain in comparison to the non-SFN algorithm.