Back to search

Aristotle University Of Thessaloniki (AUTH)

Κωδικοποίηση δικτύου με στιγμιαία αποκωδικοποίηση σε ασύρματα τηλεπικοινωνιακά συστήματα πολλαπλών δεκτών

Abstract

dc:description

In this dissertation three problems in the area of wireless broadcast erasure networks with feedback are solved. Specifically, a multiple unicast system of one transmitter and three receivers - users is examined. This system is saturated, i.e. there is a predefined number of packets the transmitter needs to sends to each user. The problem is to achieve optimal throughput by using network coding that is solely based on XOR operations (Exclusive OR) and ensuring instant decodability. To solve this problem a network of virtual queues is created at the transmitter to store packets that need to be sent, in order to exploit the feedback information. The proposed algorithm is proved to be optimal for i.i.d. (independent and identically distributed) channels and for independent channels with erasure probability up to 8/9. The analysis is mainly theoretic using simple techniques. In the second problem a stochastic model is considered, i.e. the packets arrive randomly at the transmitter at any timeslot. The problem is to develop a systematic framework that uses network coding based only on XOR operations for arbitrary number of users, as well as achieving the optimal throughput by applying this framework in the case of four users. In order to achieve this, the virtual network of the previous problem is generalized for arbitrary number of users. This generalization concerns the virtual queues maintained as well as the rules that determine the packet movement among the queues. Moreover, a backpressure type algorithm is used, that determines the coding choice for every transmission based on instantaneous quantities instead of predefined choices. This problem is reduced to a linear programming problem, which is solved by using appropriate packets. The third problem concerns developing a suboptimal algorithm for transmitting packets using the system of the previous problem, which requires less overhead to be included in each packet. The proposed algorithm uses a subset of the coding choices in respect to the algorithm of the second problem. Determining the maximum transmission rate that can be achieved through this algorithm is again a linear programming problem, which is solved by using appropriate software, while loss of performance in respect to the channel capacity limit is examined.

Degree

thesis:*
Grantor dc:publisher
Aristotle University Of Thessaloniki (AUTH)
Year dc:date
2015

Author and committee

dc:creator, dc:contributor.*
Authors dc:creator
  • Athanasiadou, Sophia
  • Αθανασιάδου, Σοφία

Subjects

dc:subject × 12

Rights

Language dc:language
gre

Identifiers

dc:identifier.*
Identifier
10.12681/eadd/36696

Chain of custody

source
Harvested from
Greek National Archive of PhD Theses
Base URL
phdtheses.ekt.gr/eadd_oai/request
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
citation

Athanasiadou, Sophia; Αθανασιάδου, Σοφία. Κωδικοποίηση δικτύου με στιγμιαία αποκωδικοποίηση σε ασύρματα τηλεπικοινωνιακά συστήματα πολλαπλών δεκτών. Aristotle University Of Thessaloniki (AUTH), 2015. http://hdl.handle.net/10442/hedi/36696