Network Coding Techniques in Cooperative Cognitive Networks
In this paper, we investigate transmission techniques for a fundamental cooperative cognitive radio network, i.e., a radio system where a Secondary user may act as relay for messages sent by the Primary user, hence offering performance improvement of Primary user transmissions, while at the same tim...
Saved in:
| Main Authors | , , |
|---|---|
| Format | Journal Article |
| Language | English |
| Published |
01.08.2018
|
| Online Access | Get full text |
| DOI | 10.48550/arxiv.1808.00263 |
Cover
| Summary: | In this paper, we investigate transmission techniques for a fundamental
cooperative cognitive radio network, i.e., a radio system where a Secondary
user may act as relay for messages sent by the Primary user, hence offering
performance improvement of Primary user transmissions, while at the same time
obtaining more transmission opportunities for its own transmissions.
Specifically, we examine the possibility of improving the overall system
performance by employing network coding techniques. The objective is to achieve
this while affecting Primary user transmissions only positively, namely: 1)
avoid network coding operations at the Primary transmitter in order avoid
increase of its complexity and storage requirements, 2) keep the order of
packets received by the Primary receiver the same as in the non cooperative
case and 3) induce packet service times that are stochastically smaller than
packet service times induced in the non-cooperative case. A network coding
algorithm is investigated in terms of achieved throughput region and it is
shown to enlarge Secondary user throughput as compared to the case where the
Secondary transmitter acts as a simple relay, while leaving the Primary user
stability region unaffected. A notable feature of this algorithm is that it
operates without knowledge of channel and packet arrival rate statistics. We
also investigate a second network coding algorithm which increases the
throughput region of the system; however, the latter algorithm requires
knowledge of channel and packet arrival rate statistics. |
|---|---|
| DOI: | 10.48550/arxiv.1808.00263 |