Fair and efficient opportunistic interference alignment algorithm based on round-robin scheduling
Opportunistic interference alignment (OIA) algorithm was proposed for the practical implementation of interference alignment (IA).A fair and efficient OIA algorithm was presented for the unfairness in resource allocation and high dependence of tremendous users in the existing OIA algorithms.Firstly,...
Saved in:
Main Authors: | , , |
---|---|
Format: | Article |
Language: | zho |
Published: |
Editorial Department of Journal on Communications
2017-10-01
|
Series: | Tongxin xuebao |
Subjects: | |
Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2017193/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
_version_ | 1841539539920748544 |
---|---|
author | Xian-zhong XIE Hua-bing LU Zhao-yuan SHI |
author_facet | Xian-zhong XIE Hua-bing LU Zhao-yuan SHI |
author_sort | Xian-zhong XIE |
collection | DOAJ |
description | Opportunistic interference alignment (OIA) algorithm was proposed for the practical implementation of interference alignment (IA).A fair and efficient OIA algorithm was presented for the unfairness in resource allocation and high dependence of tremendous users in the existing OIA algorithms.Firstly,the users with the best channel was selected in the primary cell based on round-robin scheduling after the coordinate cluster was determined.Then,the interference from the primary users was eliminated by skillfully designing the useful signal spaces in the subordinate cells.Furthermore,the users with the minimum interference leakage was selected in the subordinate cells.Finally,the fairness performance was theoretically analyzed.Simulation results show that both the sum-rate and fairness of the proposed algorithm are significantly higher than that of the conventional algorithm with less interference leakage.Besides,the users can achieve a quick access. |
format | Article |
id | doaj-art-da47d5ce63ae403080faef420bb225bd |
institution | Kabale University |
issn | 1000-436X |
language | zho |
publishDate | 2017-10-01 |
publisher | Editorial Department of Journal on Communications |
record_format | Article |
series | Tongxin xuebao |
spelling | doaj-art-da47d5ce63ae403080faef420bb225bd2025-01-14T07:13:06ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2017-10-01381959712586Fair and efficient opportunistic interference alignment algorithm based on round-robin schedulingXian-zhong XIEHua-bing LUZhao-yuan SHIOpportunistic interference alignment (OIA) algorithm was proposed for the practical implementation of interference alignment (IA).A fair and efficient OIA algorithm was presented for the unfairness in resource allocation and high dependence of tremendous users in the existing OIA algorithms.Firstly,the users with the best channel was selected in the primary cell based on round-robin scheduling after the coordinate cluster was determined.Then,the interference from the primary users was eliminated by skillfully designing the useful signal spaces in the subordinate cells.Furthermore,the users with the minimum interference leakage was selected in the subordinate cells.Finally,the fairness performance was theoretically analyzed.Simulation results show that both the sum-rate and fairness of the proposed algorithm are significantly higher than that of the conventional algorithm with less interference leakage.Besides,the users can achieve a quick access.http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2017193/opportunistic interference alignment (OIA)round-robin schedulingfairnessquick accessflexibility |
spellingShingle | Xian-zhong XIE Hua-bing LU Zhao-yuan SHI Fair and efficient opportunistic interference alignment algorithm based on round-robin scheduling Tongxin xuebao opportunistic interference alignment (OIA) round-robin scheduling fairness quick access flexibility |
title | Fair and efficient opportunistic interference alignment algorithm based on round-robin scheduling |
title_full | Fair and efficient opportunistic interference alignment algorithm based on round-robin scheduling |
title_fullStr | Fair and efficient opportunistic interference alignment algorithm based on round-robin scheduling |
title_full_unstemmed | Fair and efficient opportunistic interference alignment algorithm based on round-robin scheduling |
title_short | Fair and efficient opportunistic interference alignment algorithm based on round-robin scheduling |
title_sort | fair and efficient opportunistic interference alignment algorithm based on round robin scheduling |
topic | opportunistic interference alignment (OIA) round-robin scheduling fairness quick access flexibility |
url | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2017193/ |
work_keys_str_mv | AT xianzhongxie fairandefficientopportunisticinterferencealignmentalgorithmbasedonroundrobinscheduling AT huabinglu fairandefficientopportunisticinterferencealignmentalgorithmbasedonroundrobinscheduling AT zhaoyuanshi fairandefficientopportunisticinterferencealignmentalgorithmbasedonroundrobinscheduling |