A relaying algorithm for multihop TDMA TDD networks using diversity

Peer-to-peer multihop relaying in TDMA networks can provide significant gains in network throughput, particularly when relaying is combined with relaying diversity schemes such as multihop selection combining or multihop maximal ratio combining. This paper presents a novel diversity-aware routing algorithm adapted from the Bellman-Ford algorithm, which results in significant throughput gains and reduction in outage without requiring additional time resources. Performance is evaluated in a WLAN environment. One feature of this algorithm is that routing can be done effectively regardless of shadowing or channel variations provided channel measurement is supported.