Analog Network Coding Without Restrictions on Superimposed Frames

The applicability of analog network coding (ANC) to a wireless network is constrained by several limitations: 1) some ANC schemes demand fine-grained frame-level synchronization, which cannot be practically achieved in a wireless network; 2) others support only a specific type of modulation or require equal frame size in concurrent transmissions. In this paper, a new ANC scheme, called restriction-free analog network coding (RANC), is developed to eliminate the above limitations. It incorporates several function 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 in a wireless network with various linear modulation schemes. To demonstrate the distinguished features of RANC, two network applications are studied. In the first application, RANC is applied to support a new relaying scheme called multi-way relaying, which significantly improves the spectrum efficiency as compared to two-way relaying. In the second application, RANC enables random-access-based ANC in an ad hoc network where flow compensation can 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. Extensive experiments confirm that all function blocks of RANC work effectively without being constrained by the above limitations. The overall performance of RANC is shown to approach the ideal case of interference-free communications. The results of experiments in a real network setup demonstrate that RANC significantly outperforms existing ANC schemes and achieves constraint-free ANC in wireless networks.