Distributed Opportunistic Wireless Channel Access in Decode-and-Forward Relay Networks
Date
Author
Institution
Degree Level
Degree
Department
Specialization
Supervisor / Co-Supervisor and Their Department(s)
Examining Committee Member(s) and Their Department(s)
Citation for Previous Publication
Link to Related Item
Abstract
The main goal of this thesis is to develop an opportunistic scheduling strategy in distributed networks with decode-and-forward (DF) relays without direct link. Two cases are considered: 1) the winner source has full CSI (CSI of source-relay link and relay-destination link), 2) the winner source has partial CSI (CSI of source-relay link only). For the first case, a pure threshold scheduling strategy is proposed. Specifically, only when the minimum of the detected signal-to-noise ratio (SNR) of the source-relay link and relay-destination link exceeds a certain threshold, it is optimal for the source to transmit data. For the second case, the scheduling strategy is also threshold-based. In specific, when the detected SNR of the source-relay link exceeds a certain threshold, it is optimal for the winner source to transmit data. After the relay receives the data, the optimal strategy is probing the second hop until the second-hop channel condition is good.
