Deterministic bisection search algorithm for distributed sensor/relay networks

This paper investigates the problem of adaptive distributed beamforming for wireless sensor/relay networks. Existing schemes seek to adaptively achieve distributed phase alignment for beamforming via the help of an error-free, one-bit feedback link from the receiver to all distributed transmitters. Under such setting, we proposed a Deterministic Bisection Search Algorithm (DBSA), designed to achieve distributed phase alignment efficiently in a greedy fashion. Extensive simulations demonstrated significant improvement in the convergence time of the proposed DBSA compared with existing schemes. For wireless sensor/relay networks, inherent issues of system uncertainty such as random node addition or removal often occur due to power depletion or requests from new nodes to join the network. To resolve these issues, DBSA was further extended and numerical experiments have shown that the extended version is indeed robust against such system uncertainty.