Transmitter Macrodiversity in Multihopping: SFN based algorithm for improved node reachability and robust routing
2010 (English)In: World Academy of Science, Engineering and Technology (WASET) International Conference on Computer Science and Technology (ICCST’10), Rome, Italy, 28-30 April 2010, Rome, Italy, 2010, 404-408 p.Conference paper (Refereed)
A novel idea presented in this paper is to combine multihop routing with single-frequency networks (SFNs) for a broadcasting scenario. An SFN is a set of multiple nodes that transmit the same data simultaneously, resulting in transmitter macrodiversity. Two of the most important performance factors of multihop networks, node reachability and routing robustness, are analyzed. Simulation results show that our proposed SFN-D routing algorithm improves the node reachability by 37 percentage points as compared to non-SFN multihop routing. It shows a diversity gain of 3.7 dB, meaning that 3.7 dB lower transmission powers are required for the same reachability. Even better results are possible for larger networks. If an important node becomes inactive, this algorithm can find new routes that a non-SFN scheme would not be able to find. Thus, two of the major problems in multihopping are addressed; achieving robust routing as well as improving node reachability or reducing transmission power.
Place, publisher, year, edition, pages
Rome, Italy, 2010. 404-408 p.
Broadcasting; Dsfn; Manet; Multihop routing; OFDM; Single-frequency networks (sfn); Transmitter macrodiversity
IdentifiersURN: urn:nbn:se:miun:diva-15975ScopusID: 2-s2.0-78651540228OAI: oai:DiVA.org:miun-15975DiVA: diva2:507111
International Conference on Computer Science and Technology (ICCST’10)