A Bio-Inspired Robust Adaptive Random Search Algorithm For Distributed Beamforming

2011 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC)(2011)

引用 10|浏览2
暂无评分
摘要
A bio-inspired robust adaptive random search algorithm (BioRARSA), designed for distributed beamforming for sensor and relay networks, is proposed in this work. It has been shown via a systematic framework that BioRARSA converges in probability and its convergence time scales linearly with the number of distributed transmitters. More importantly, extensive simulation results demonstrate that the proposed BioRARSA outperforms existing adaptive distributed beamforming schemes by as large as 29.8% on average. This increase in performance results from the fact that BioRARSA can adaptively adjust its sampling stepsize via the "swim" behavior inspired by the bacterial foraging mechanism. Hence, the convergence time of BioRARSA is insensitive to the initial sampling stepsize of the algorithm, which makes it robust against the dynamic nature of distributed wireless networks.
更多
查看译文
关键词
array signal processing,probability,radio networks,radio transmitters,search problems,BioRARSA,adaptive distributed beamforming schemes,bacterial foraging mechanism,bio-inspired robust adaptive random search algorithm,distributed transmitters,distributed wireless networks,relay networks,sensor,systematic framework,
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要