Random, deterministic, and hybrid algorithms for distributed beamforming

Abstract

Distributed beamforming is a form of cooperation among nodes in a wireless network to efficiently deliver a common message to a distant receiver. The critical requirement to achieve electromagnetic coherence is to synchronize the initial phases of all local oscillators, introducing minimal overhead and complexity. In the paper we introduce random, deterministic and hybrid algorithms, all based on feedback from the common receiver as the driving force, but with different phase update strategies. Our numerical results show that these algorithms achieve faster convergence time than previously proposed approaches.