DGA: Distributed genetic algorithm based relay assignment in cooperative communication

Abstract

A crucial challenge in the implementation of cooperative protocol is how to assign relay nodes properly. In this paper, we address the relay assignment issue in the wireless networks where the source nodes, destination nodes and relay nodes are randomly distributed in a large area. Without any kind of central controller, we try to solve the relay assignment problem in a distributed manner with the local information. Based on this network model, we developed a Distributed Genetic Algorithm (DGA) based scheme to pursue a better system capacity compared with other distributed algorithms. We also presented a brief discussion and analysis on the DGA algorithm. At last, extensive simulations show that the DGA outperforms other distributed algorithms with obvious improvement of the system capacity and converges fast.