Aristotle University Of Thessaloniki (AUTH)
Cooperative wireless communication networks: performance evaluation and algorithms
Abstract
dc:descriptionIn Chapter 2, we consider the N-receiver broadcast erasure channel with feedback and message side information at the receivers prior to beginning of transmission.Specifically the transmitter must deliver different, independent messages to each of the receivers, and each receiver knows a function of these messages before transmission begins. We provide an outer bound to the capacity region of this system. For the case where each message consists of a number of symbols taking values in a finite Field and each receiver knows linear combinations of these symbols, the outer bound is given in terms of ranks of matrices expressing the linear combinations. For the latter case and when N = 2, the outer bound is tight under mild conditions on the limiting behavior of the ranks of matrices expressing the side information. We provide a capacity achieving code for this case. The special case where each receiver either knows the entire message of another receiver or has no information about it, constitutes a generalization of the index coding problem that incorporates channel erasures. For this instance, and when there are no channel errors, we show that the outer bound reduces to the Maximum Weighted Acyclic Induced Subgraph (MWAIS) bound. In Chapter 3, we investigate transmission techniques for a fundamental cooperative cognitive radio network, i.e., a cognitive 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. The objective is to achieve this while affecting Primary user transmissions only positively. 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. In Chapter 4, we examine the maximum communication rates that can be achieved for the channel studied in Chapter 3. To that end, we studied the capacity of the channel from an Information Theoretic point of view. We develop an outer bound to the capacity of the fundamental cooperative cognitive radio network under consideration. Then, we propose a coding-scheduling algorithm suitable for this type of networks, which involves only XOR network coding operations. The complexity of the scheduling decisions of the proposed algorithm depends on the channel statistical parameters and three cases, depending on the relations between channel erasure probabilities, are distinguished. For the first two cases the rate region of the proposed algorithm coincides with the developed capacity outer bound, hence the algorithm is capacity achieving. For the third case, the rate region of the proposed algorithm is not identical to the outer bound; however, numerical results show that it is fairly close to the derived outer bound for a wide range of the statistical parameters of the system.
Degree
thesis:*- Grantor dc:publisher
- Aristotle University Of Thessaloniki (AUTH)
- Year dc:date
- 2020
Author and committee
dc:creator, dc:contributor.*- Authors dc:creator
-
- Papadopoulos, Athanasios
- Παπαδόπουλος, Αθανάσιος
Subjects
dc:subject × 10- Θεωρία πληροφοριών
- Δίκτυα επικοινωνιών
- Communication networks
- Information theory
- Επιστήμη Ηλεκτρολόγου Μηχανικού, Ηλεκτρονικού Μηχανικού, Μηχανικού Η/Υ
- Επιστήμες Μηχανικού και Τεχνολογία
- Μηχανική και συστήματα επικοινωνιών, Τηλεπικοινωνίες
- Electrical Engineering, Electronic Engineering, Information Engineering
- Engineering and Technology
- Communication engineering and systems, Telecommunications
Rights
- Language dc:language
- eng
Identifiers
dc:identifier.*- Identifier
- 10.12681/eadd/49732