Algorithmic approaches to distributed adaptive transmit beamforming

We present three approaches for algorithmic improvements on distributed adaptive transmit beamforming in wireless sensor networks. These algorithms reduce the time to synchronise carrier signals among nodes compared to the global random search approaches commonly applied to this problem. For a local random search heuristic we provide an asymptotic bounds on the optimisation time. All approaches are also studied in mathematical simulations on greater networks sizes.