Multi-Objective Optimization of a QoS-Aware Channel Allocation in Cognitive Radio Networks using NSGA-II Algorithm

Abstract:
In this paper the QoS-aware channel allocation problem formulated as an optimization problem with two conflicting objectives; spectrum utilization and fairness among secondary users (SUs) subject to channel availabilities constraints. Any possible channel allocation which could be a solution of the optimization problem, encoded as a binary chromosome. By having coded available spectrum opportunities instead of all channel-user combinations, the search space is significantly reduced. Designing the QoS-aware channel assignment scheme is based on NSGA-II Algorithm to find the optimum allocation of these two objectives jointly and finally the set of Pareto optimal solutions achieved by proposed algorithm in discrete space of feasible solutions. Simulation results demonstrate the trade-off between spectrum utilization and fairness and the Pareto optimum points. Binary Integer Programming (BIP) confirms the results of the proposed evolutionary scheme in small-scale instances while our scheme outperforms BIP method significantly in computational for large-scale ones.
Language:
Persian
Published:
Journal of Control, Volume:11 Issue: 1, 2017
Pages:
1 to 9
magiran.com/p1727312  
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یک‌ساله به مبلغ 1,390,000ريال می‌توانید 70 عنوان مطلب دانلود کنید!
اشتراک سازمانی
به کتابخانه دانشگاه یا محل کار خود پیشنهاد کنید تا اشتراک سازمانی این پایگاه را برای دسترسی نامحدود همه کاربران به متن مطالب تهیه نمایند!
توجه!
  • حق عضویت دریافتی صرف حمایت از نشریات عضو و نگهداری، تکمیل و توسعه مگیران می‌شود.
  • پرداخت حق اشتراک و دانلود مقالات اجازه بازنشر آن در سایر رسانه‌های چاپی و دیجیتال را به کاربر نمی‌دهد.
In order to view content subscription is required

Personal subscription
Subscribe magiran.com for 70 € euros via PayPal and download 70 articles during a year.
Organization subscription
Please contact us to subscribe your university or library for unlimited access!