PROJECT TITLE :

Analog Network Coding Without Restrictions on Superimposed Frames

ABSTRACT:

The applicability of analog network coding (ANC) to a wireless network is constrained by several limitations: one) some ANC schemes demand fine-grained frame-level synchronization, which cannot be practically achieved in an exceedingly wireless network; a pair of) others support solely a particular kind of modulation or need equal frame size in concurrent transmissions. In this paper, a replacement ANC scheme, referred to as restriction-free analog network coding (RANC), is developed to eliminate the higher than limitations. It incorporates many perform blocks, including frame boundary detection, joint channel estimation, waveform recovery, circular channel estimation, and frequency offset estimation, to support random concurrent transmissions with arbitrary frame sizes during a wireless network with varied linear modulation schemes. To demonstrate the distinguished options of RANC, 2 network applications are studied. In the first application, RANC is applied to support a replacement relaying theme referred to as multi-way relaying, that considerably improves the spectrum potency as compared to two-manner relaying. In the second application, RANC permits random-access-primarily based ANC in an impromptu network where flow compensation will be gracefully exploited to further improve the throughput performance. RANC and its network applications are implemented and evaluated on universal software radio peripheral (USRP) software radio platforms. In depth experiments ensure that every one function blocks of RANC work effectively while not being constrained by the on top of limitations. The general performance of RANC is shown to approach the perfect case of interference-free communications. The results of experiments in a very real network setup demonstrate that RANC considerably outperforms existing ANC schemes and achieves constraint-free ANC in wireless networks.