A delay-bounded relaying diversity scheme in digital cooperative wireless networks

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

Relay-assisted cooperative communication has received considerable attention as a promising approach to alleviate the burden of installing multiple antennas on simple terminals but still achieving transmit diversity. In most prior work, perfect error detection is assumed to prevent relays that receive in error from forwarding. Since error detection is often performed at the medium access control (MAC) layer, each relay in the network needs to pass the received signal from the physical layer to the MAC layer before making the forwarding decision, resulting in the overhead that may not be necessary. Selection relaying thus has been proposed to avoid the MAC overhead at relays. The required election phase in selection relaying, however, needs to last for a deterministic duration proportional to the number of relays in a coordinated manner, or a nondeterministic duration in the absence of coordination. In this paper, we propose a cooperative relaying scheme that achieves diversity gain with a constant delay that is insensitive to the network size. In the proposed scheme, relays perform threshold testing instead of error detection, and a fix duration is allocated for the election phase. We analyze the end-to-end bit error rate (BER) of the proposed scheme in closed-form expressions, and prove the achievable diversity order. Numerical results are given to demonstrate the superior performance of the proposed scheme over the direct retransmission and the well-known opportunistic relaying scheme in terms of the end-to-end BER, average delay and delay variance.

Original languageEnglish
Title of host publication2010 IEEE Wireless Communications and Networking Conference, WCNC 2010 - Proceedings
DOIs
Publication statusPublished - 2010 Aug 3
EventIEEE Wireless Communications and Networking Conference 2010, WCNC 2010 - Sydney, NSW, Australia
Duration: 2010 Apr 182010 Apr 21

Publication series

NameIEEE Wireless Communications and Networking Conference, WCNC
ISSN (Print)1525-3511

Other

OtherIEEE Wireless Communications and Networking Conference 2010, WCNC 2010
CountryAustralia
CitySydney, NSW
Period10-04-1810-04-21

Fingerprint

Medium access control
Error detection
Wireless networks
Bit error rate
Cooperative communication
Antennas
Testing

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Cite this

Liu, K-H. (2010). A delay-bounded relaying diversity scheme in digital cooperative wireless networks. In 2010 IEEE Wireless Communications and Networking Conference, WCNC 2010 - Proceedings [5506148] (IEEE Wireless Communications and Networking Conference, WCNC). https://doi.org/10.1109/WCNC.2010.5506148
Liu, Kuang-Hao. / A delay-bounded relaying diversity scheme in digital cooperative wireless networks. 2010 IEEE Wireless Communications and Networking Conference, WCNC 2010 - Proceedings. 2010. (IEEE Wireless Communications and Networking Conference, WCNC).
@inproceedings{bef26f825a454566b8680bef152eb5e8,
title = "A delay-bounded relaying diversity scheme in digital cooperative wireless networks",
abstract = "Relay-assisted cooperative communication has received considerable attention as a promising approach to alleviate the burden of installing multiple antennas on simple terminals but still achieving transmit diversity. In most prior work, perfect error detection is assumed to prevent relays that receive in error from forwarding. Since error detection is often performed at the medium access control (MAC) layer, each relay in the network needs to pass the received signal from the physical layer to the MAC layer before making the forwarding decision, resulting in the overhead that may not be necessary. Selection relaying thus has been proposed to avoid the MAC overhead at relays. The required election phase in selection relaying, however, needs to last for a deterministic duration proportional to the number of relays in a coordinated manner, or a nondeterministic duration in the absence of coordination. In this paper, we propose a cooperative relaying scheme that achieves diversity gain with a constant delay that is insensitive to the network size. In the proposed scheme, relays perform threshold testing instead of error detection, and a fix duration is allocated for the election phase. We analyze the end-to-end bit error rate (BER) of the proposed scheme in closed-form expressions, and prove the achievable diversity order. Numerical results are given to demonstrate the superior performance of the proposed scheme over the direct retransmission and the well-known opportunistic relaying scheme in terms of the end-to-end BER, average delay and delay variance.",
author = "Kuang-Hao Liu",
year = "2010",
month = "8",
day = "3",
doi = "10.1109/WCNC.2010.5506148",
language = "English",
isbn = "9781424463985",
series = "IEEE Wireless Communications and Networking Conference, WCNC",
booktitle = "2010 IEEE Wireless Communications and Networking Conference, WCNC 2010 - Proceedings",

}

Liu, K-H 2010, A delay-bounded relaying diversity scheme in digital cooperative wireless networks. in 2010 IEEE Wireless Communications and Networking Conference, WCNC 2010 - Proceedings., 5506148, IEEE Wireless Communications and Networking Conference, WCNC, IEEE Wireless Communications and Networking Conference 2010, WCNC 2010, Sydney, NSW, Australia, 10-04-18. https://doi.org/10.1109/WCNC.2010.5506148

A delay-bounded relaying diversity scheme in digital cooperative wireless networks. / Liu, Kuang-Hao.

2010 IEEE Wireless Communications and Networking Conference, WCNC 2010 - Proceedings. 2010. 5506148 (IEEE Wireless Communications and Networking Conference, WCNC).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - A delay-bounded relaying diversity scheme in digital cooperative wireless networks

AU - Liu, Kuang-Hao

PY - 2010/8/3

Y1 - 2010/8/3

N2 - Relay-assisted cooperative communication has received considerable attention as a promising approach to alleviate the burden of installing multiple antennas on simple terminals but still achieving transmit diversity. In most prior work, perfect error detection is assumed to prevent relays that receive in error from forwarding. Since error detection is often performed at the medium access control (MAC) layer, each relay in the network needs to pass the received signal from the physical layer to the MAC layer before making the forwarding decision, resulting in the overhead that may not be necessary. Selection relaying thus has been proposed to avoid the MAC overhead at relays. The required election phase in selection relaying, however, needs to last for a deterministic duration proportional to the number of relays in a coordinated manner, or a nondeterministic duration in the absence of coordination. In this paper, we propose a cooperative relaying scheme that achieves diversity gain with a constant delay that is insensitive to the network size. In the proposed scheme, relays perform threshold testing instead of error detection, and a fix duration is allocated for the election phase. We analyze the end-to-end bit error rate (BER) of the proposed scheme in closed-form expressions, and prove the achievable diversity order. Numerical results are given to demonstrate the superior performance of the proposed scheme over the direct retransmission and the well-known opportunistic relaying scheme in terms of the end-to-end BER, average delay and delay variance.

AB - Relay-assisted cooperative communication has received considerable attention as a promising approach to alleviate the burden of installing multiple antennas on simple terminals but still achieving transmit diversity. In most prior work, perfect error detection is assumed to prevent relays that receive in error from forwarding. Since error detection is often performed at the medium access control (MAC) layer, each relay in the network needs to pass the received signal from the physical layer to the MAC layer before making the forwarding decision, resulting in the overhead that may not be necessary. Selection relaying thus has been proposed to avoid the MAC overhead at relays. The required election phase in selection relaying, however, needs to last for a deterministic duration proportional to the number of relays in a coordinated manner, or a nondeterministic duration in the absence of coordination. In this paper, we propose a cooperative relaying scheme that achieves diversity gain with a constant delay that is insensitive to the network size. In the proposed scheme, relays perform threshold testing instead of error detection, and a fix duration is allocated for the election phase. We analyze the end-to-end bit error rate (BER) of the proposed scheme in closed-form expressions, and prove the achievable diversity order. Numerical results are given to demonstrate the superior performance of the proposed scheme over the direct retransmission and the well-known opportunistic relaying scheme in terms of the end-to-end BER, average delay and delay variance.

UR - http://www.scopus.com/inward/record.url?scp=77955025584&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77955025584&partnerID=8YFLogxK

U2 - 10.1109/WCNC.2010.5506148

DO - 10.1109/WCNC.2010.5506148

M3 - Conference contribution

SN - 9781424463985

T3 - IEEE Wireless Communications and Networking Conference, WCNC

BT - 2010 IEEE Wireless Communications and Networking Conference, WCNC 2010 - Proceedings

ER -

Liu K-H. A delay-bounded relaying diversity scheme in digital cooperative wireless networks. In 2010 IEEE Wireless Communications and Networking Conference, WCNC 2010 - Proceedings. 2010. 5506148. (IEEE Wireless Communications and Networking Conference, WCNC). https://doi.org/10.1109/WCNC.2010.5506148