A relaying algorithm for multihop TDMA TDD networks using diversity
- 1 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3 (10903038) , 1939-1943 Vol.3
- https://doi.org/10.1109/vetecf.2003.1285363
Abstract
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.Keywords
This publication has 3 references indexed in Scilit:
- Structure and performance of the HIPERLAN/2 physical layerPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A theoretical characterization of the multihop wireless communications channel with diversityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Code Combining--A Maximum-Likelihood Decoding Approach for Combining an Arbitrary Number of Noisy PacketsIEEE Transactions on Communications, 1985