mainthesisUVIC.lof

\addvspace {10\p@ }
\addvspace {10\p@ }
\contentsline {figure}{\numberline {2.1}{\ignorespaces A simple illustration of hidden terminal problem}}{8}
\contentsline {figure}{\numberline {2.2}{\ignorespaces Simple three-node linear network. Nodes $A$ and $B$ have packets to exchange and node $R$ acts as a relay}}{9}
\contentsline {figure}{\numberline {2.3}{\ignorespaces Traditional relaying. First, node $A$ transmits its packet to the relay, then the relay forwards $A$'s packet to $B$, then in time slot three, node B sends its packet to the relay, which is then forwarded to node $A$ in time slot four.}}{10}
\contentsline {figure}{\numberline {2.4}{\ignorespaces Straightforward network coding. First, $A$ transmits its packet to relay, then $B$ transmits its message to the relay, then relay calculates $Z_1=X_1 \oplus Y_1$ and broadcasts it to $A$ and $B$ in time slot three, which can then decode the other nodes message by another XOR.}}{11}
\contentsline {figure}{\numberline {2.5}{\ignorespaces Physical layer network coding. In time slot one, $A$ and $B$ will transmit their packets to the relay at the same time (multiple access phase). The relay, using its mapping function extracts XOR of $A$ and $B$'s packets and broadcasts it to them in time slot two (broadcast phase).}}{11}
\contentsline {figure}{\numberline {2.6}{\ignorespaces PNC signal constellation at end nodes and the relay}}{12}
\contentsline {figure}{\numberline {2.7}{\ignorespaces Simple illustration of software defined radio concept}}{13}
\addvspace {10\p@ }
\contentsline {figure}{\numberline {3.1}{\ignorespaces Time diagram of RSS-based grouping algorithm, $\text {Beacon}^{\ast }$ is a BF initiating the grouping scheme. As it is shown in the figure, a GUP can be as large as several beacon intervals. Essentially it can last as long as the AP is satisfied with the throughput performance.}}{17}
\contentsline {figure}{\numberline {3.2}{\ignorespaces A sample grouping showing how nodes are categorized location-wise using RSS-based grouping}}{19}
\contentsline {figure}{\numberline {3.3}{\ignorespaces Two nodes and group head in one Voronoi cell}}{21}
\contentsline {figure}{\numberline {3.4}{\ignorespaces Grouping performance metrics}}{23}
\contentsline {figure}{\numberline {3.5}{\ignorespaces Probability of two nodes, within a group, being in the sensing range of each other}}{24}
\contentsline {figure}{\numberline {3.6}{\ignorespaces Throughput of Uplink traffic}}{25}
\addvspace {10\p@ }
\contentsline {figure}{\numberline {4.1}{\ignorespaces Receiver chain.}}{30}
\contentsline {figure}{\numberline {4.2}{\ignorespaces Testbed, two-hop scenario.}}{33}
\contentsline {figure}{\numberline {4.3}{\ignorespaces BER performance, two-hop.}}{34}
\contentsline {figure}{\numberline {4.4}{\ignorespaces Multi-hop performance. Multi-hop End-to-End BER are calculated using formulations outlined in table 5.1 of \cite {zhang2017cross}.}}{34}
\contentsline {figure}{\numberline {4.5}{\ignorespaces Goodput, per-hop SNR $=9$, $\alpha =4$, Payload=$256$ bits.}}{36}
\contentsline {figure}{\numberline {4.6}{\ignorespaces Effect of CFO and channel estimation error on BER. }}{37}
\addvspace {10\p@ }
\addvspace {10\p@ }