Joint resource allocation and relay selection via genetic algorithm in multi‐user decode‐and‐forward cooperative systems. Issue 2 (1st June 2014)

• Record Type: Journal Article
• Authors: Fang, Wen‐Hsien; Chen, Chien‐Fu; Lang, Hung‐Sheng
• Is Part Of: IET networks. Volume 3:Issue 2(2014)
• Page Start: 65
• Page End: 73
• Publication Date: 2014-06-01
• Subjects: genetic algorithms -- integer programming -- nonlinear programming -- cooperative communication -- decode and forward communication -- relay networks (telecommunication); resource allocation -- relay selection -- genetic algorithm -- multiuser decode‐and‐forward cooperative systems -- relay subset selection -- bandwidth allocation -- power distribution -- optimisation problem -- mixed‐integer nonlinear programming problem -- integer string -- low‐complexity two‐stage implementation; Computer network architectures -- Periodicals; Computer network protocols -- Periodicals; Information networks -- Periodicals; Telecommunication systems -- Periodicals; 004.605
• DOI: 10.1049/iet-net.2013.0010
• Languages: English
• ISSNs: 2047-4954

Abstract

Abstract : This study presents a joint consideration of the relay subset selection, bandwidth allocation and power distribution in multi‐user decode‐and‐forward cooperative networks. The upper bound for the optimisation problem considered is first determined by ignoring some constraints. Thereafter, a genetic algorithm (GA) is addressed to resolve the mixed‐integer non‐linear programming problem involved. To accommodate this joint consideration, each chromosome in the proposed GA is divided into an integer string for relay selection, and two real number strings for bandwidth allocation and power distribution. In addition, new crossover and mutation operations are employed for this new type of chromosomes. To alleviate the complexity overhead, a low‐complexity two‐stage implementation is also addressed. Conducted simulations show that both of the proposed GA and the two‐stage implementation can attain close performance as the upper bound and outperform some representative previous works. The two‐stage implementation is in particular appealing by exhibiting negligible performance degradation with reduced computations.