Successive Dirty Paper Coding: New Relaying Scheme for Cooperative Networks

Author

Kurniawan, E. ; Madhukumar, A.S. ; Chin, Francois ; Liang, Ying-Chang

Author_Institution

Nanyang Technol. Univ., Singapore

fYear

2007

fDate

3-7 Sept. 2007

Firstpage

1

Lastpage

5

Abstract

The present paper proposes a new relaying scheme called successive dirty paper coding. Theoretical achievable rate of the scheme is derived and its performance is compared to other existing relaying schemes in terms of their outage probability. It is shown via numerical studies and supported by simulation analysis that the proposed scheme is able to achieve higher bandwidth efficiency by reusing relay slots to transmit new messages. An improvement of up to M-fold, where M is the average number of relay stages in every transmission, compared to traditional non-cooperative relaying is observed.

Keywords

ad hoc networks; encoding; probability; ad hoc network; bandwidth efficiency; cooperative networks; outage probability; relaying scheme; successive dirty paper coding; Ad hoc networks; Bandwidth; Centralized control; Communication system control; Interference; Land mobile radio; Local area networks; Protective relaying; Relays; Time division multiple access;

fLanguage

English

Publisher

ieee

Conference_Titel

Personal, Indoor and Mobile Radio Communications, 2007. PIMRC 2007. IEEE 18th International Symposium on

Conference_Location

Athens

Print_ISBN

978-1-4244-1144-3

Electronic_ISBN

978-1-4244-1144-3

Type

conf

DOI

10.1109/PIMRC.2007.4394860

Filename

4394860