TY - GEN
T1 - Optimal secondary access in retransmission based primary networks via chain decoding
AU - Michelusi, Nicolo
N1 - Funding Information:
N. Michelusi is with the School of Electrical and Computer Engineering at Purdue University; email: michelus@purdue.edu This research was funded by NSF CNS-1642982 and by DARPA #108818.
Publisher Copyright:
© 2017 IEEE.
PY - 2017/8/9
Y1 - 2017/8/9
N2 - This paper investigates the design of secondary access policies which exploit the temporal redundancy of the retransmission protocol employed by primary users (PU) to improve the spectral efficiency of wireless networks. Secondary users (SU) perform selective retransmissions in order to optimize the potential of interference cancellation at the receiver. The corrupted signals are selectively buffered at the SU receiver, and then decoded via the successive application of chain decoding [1]. The optimal SU access policy which maximizes the SU throughput under a constraint on the maximum interference caused to the PU is derived, and its performance is found in closed form. It is shown that such policy optimally randomizes among three modes of operation of the SU: 1) The SU remains idle over the entire retransmission interval of the PU, to avoid interfering with the PU; 2) The SU transmits only after decoding the PU packet to leverage interference cancellation; 3) The SU always transmits over the entire retransmission interval of the PU, so as to leverage chain decoding. The optimal randomization is determined by the constraint on the maximum interference caused to the PU. It is shown numerically that chain decoding attains a throughput gain of 15% with respect to a state-of-the art scheme where the SU does not perform selective retransmissions.
AB - This paper investigates the design of secondary access policies which exploit the temporal redundancy of the retransmission protocol employed by primary users (PU) to improve the spectral efficiency of wireless networks. Secondary users (SU) perform selective retransmissions in order to optimize the potential of interference cancellation at the receiver. The corrupted signals are selectively buffered at the SU receiver, and then decoded via the successive application of chain decoding [1]. The optimal SU access policy which maximizes the SU throughput under a constraint on the maximum interference caused to the PU is derived, and its performance is found in closed form. It is shown that such policy optimally randomizes among three modes of operation of the SU: 1) The SU remains idle over the entire retransmission interval of the PU, to avoid interfering with the PU; 2) The SU transmits only after decoding the PU packet to leverage interference cancellation; 3) The SU always transmits over the entire retransmission interval of the PU, so as to leverage chain decoding. The optimal randomization is determined by the constraint on the maximum interference caused to the PU. It is shown numerically that chain decoding attains a throughput gain of 15% with respect to a state-of-the art scheme where the SU does not perform selective retransmissions.
UR - http://www.scopus.com/inward/record.url?scp=85034025377&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85034025377&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2017.8006716
DO - 10.1109/ISIT.2017.8006716
M3 - Conference contribution
AN - SCOPUS:85034025377
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 1187
EP - 1191
BT - 2017 IEEE International Symposium on Information Theory, ISIT 2017
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2017 IEEE International Symposium on Information Theory, ISIT 2017
Y2 - 25 June 2017 through 30 June 2017
ER -