کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
453600 | 694978 | 2016 | 9 صفحه PDF | دانلود رایگان |
• A clone selection algorithm was proposed for the throughput problem in cognitive wireless network.
• The proposed algorithm presents a very reasonable tradeoff between computational complexity and performance.
• The proposed solution is more suitable for slowly varying spectral environments such as IEEE 802.22 networks in realistic network settings.
In cognitive wireless network, throughput scheduling optimization under interference temperature constraints has attracted more attentions in recent years. A lot of works have been investigated on it with different scenarios. However, these solutions have either high computational complexity or relatively poor performance. Throughput scheduling is a constraint optimization problem with NP(Non-deterministic Polynomial) hard features. In this paper, we proposed an immune-clone based suboptimal algorithm to solve the problem. Suitable immune clone operators are designed such as encoding, clone, mutation and selection. The simulation results show that our proposed algorithm obtains near-optimal performance and operates with much lower computational complexity. It is suitable for slowly varying spectral environments.
sFigure optionsDownload as PowerPoint slide
Journal: Computers & Electrical Engineering - Volume 52, May 2016, Pages 328–336