DocumentCode
2095700
Title
Opportunistic network coding for two-way relay fading channels
Author
Ni Ding ; Nevat, Ido ; Peters, Gareth W. ; Jinhong Yuan
Author_Institution
Sch. of Electr. & Telecommun., Univ. of New South Wales, Sydney, NSW, Australia
fYear
2013
fDate
9-13 June 2013
Firstpage
5980
Lastpage
5985
Abstract
When designing two-way relay channels, there is a dilemma of how to reduce the transmission power by network coding (XORing symbols of opposite directions) with a low symbol delay. Moreover, if the channels are fading, an extra penalty caused by error probability should be added to each transmission, which makes the decision-making problem more complex. In this paper, we propose a new model that considers instantaneous signal to noise ratio (SNR) in addition to queue occupation status. In this model, the channel state evolution is traced by a finite state Markov chain. We develop an efficient computational solution utilizing value iteration algorithm to find an optimal policy regarding symbol delay, transmission power consumption, symbol loss due to the queue overflow and transmission error probabilities. Simulation results show that there is an improvement in both the symbol loss rate and the overall system cost in practical scenarios, compared to the conventional modeling method where channel states are ignored.
Keywords
Markov processes; error statistics; fading channels; network coding; relay networks (telecommunication); channel states; error probability; finite state Markov chain; instantaneous signal to noise ratio; low symbol delay; opportunistic network coding; queue occupation status; transmission power consumption; two way relay fading channels; value iteration algorithm; Encoding; Fading; Mathematical model; Propagation losses; Relays; Signal to noise ratio; Wireless communication; Markov decision process; finite state Markov chain; network coding; value iteration;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications (ICC), 2013 IEEE International Conference on
Conference_Location
Budapest
ISSN
1550-3607
Type
conf
DOI
10.1109/ICC.2013.6655556
Filename
6655556
Link To Document