Network Coding-based Packet Relaying in Wireless Networks

Please enable javascript in your browser.

Farhadi, Farzaneh | 2012

648 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 43304 (05)
University: Sharif University of Technology
Department: Electrical Engineering
Advisor(s): Ashtiani, Farid
Abstract:
In this thesis, we propose two new network coding-based packet relaying schemes suitable for multiple unicast scenarios in a random access network. In such networks the channels may have memory dependent upon the random access scheme. Thus, the optimal scheme for memoryless channels reported recently in the literature is not necessarily optimal in random access networks. In our proposed schemes, we convert a multiple unicast scenario to a combination of multiple anycast and a few multicast scenarios. By such an approach, we exploit the channels between relay node and the other nodes, instead of using only one channel at each packet transmission, for as many as possible. By simple analytical reasoning, we prove that the proposed relaying scheme is able to outperform simple forwarding (SF) scheme in memoryless independent channels. The superiority of the proposed NC-based scheme is due to throughput enhancement and lower average waiting time. In the last part of the thesis, we show the superiority of the proposed scheme in different conditions, i.e., independent channels with and without memory by numerical results.
Keywords:
Network Coding ; Anycasting ; Waiting Time ; Stable Throughput ; Unicast Scenario

No TOC