当前位置:主页 > 科技论文 > 网络通信论文 >

协作通信中的中继选择和用户调度公平性研究

发布时间:2018-06-23 03:27

  本文选题:协作通信 + 中继选择 ; 参考:《西安电子科技大学》2014年硕士论文


【摘要】:近年来,协作通信技术因其具有提高系统容量、增大数据传输速率、有效对抗多径衰落及降低系统中断概率和误码率等优势受到了广泛关注。在协作通信系统中,中继节点的选择是一项关键技术,直接决定着协作能否带来性能上的增益。现有的对协作通信技术的研究主要考虑通过节点之间共享彼此的资源,来改善收发两端的性能,却忽略了资源共享过程中,各用户之间的公平性问题,而这一问题实际上是会影响到系统的整体性能的。本文主要针对协作通信系统下中继选择和用户调度过程的公平性问题展开研究,主要工作包括:1)通过分类介绍不同的公平性衡量准则,给出客观评判一个资源分配模型或者一个系统所能达到的公平性程度的方法,并对比分析了它们各自的优缺点。随后,进一步阐述了现有的基于网络寿命的公平协作协议和基于中继节点能量消耗的公平协作协议,这两种协议从不同的角度出发,通过设计不同的公平性算法,改善了节点之间的公平性,有效的提升了网络的整体性能。2)基于传统的机会中继,通过为每个中继节点设置计数器记录其被雇佣协助源节点的次数,本文提出了新颖的公平中继选择算法。该算法在中继节点选择过程中,同时考虑由该节点中继时的端到端信道质量和计数器值,避免了信道质量较好的用户被过度利用,保证了系统中所有中继节点被选择的次数近乎相等,拥有相同的资源消耗。最后,通过仿真证明该算法可以有效的平衡每个中继节点所消耗的功率,延长了网络寿命,改善了系统总吞吐量。3)将比例公平调度的思想延伸到协作通信中,提出比例公平协作调度算法,应用于协作蜂窝小区的上行链路传输过程中。仿真结果表明:公平中继选择与比例公平协作调度算法的结合,不仅在中继选择过程中有效的平衡了系统中各个节点被选择的次数,保证了中继选择的公平性,延长了网络寿命,还可以在系统吞吐量和用户公平性之间取得很好的折中,这样就能保证系统中每个用户都能获得近乎相等的吞吐量。
[Abstract]:In recent years, cooperative communication technology has attracted much attention because of its advantages such as increasing system capacity, increasing data transmission rate, effectively resisting multipath fading and reducing system interrupt probability and bit error rate. In cooperative communication systems, the selection of relay nodes is a key technology, which directly determines whether collaboration can bring performance gains. The existing research on cooperative communication technology mainly considers how to improve the performance of each other by sharing each other's resources among nodes, but neglects the fairness between users in the process of resource sharing. This problem will actually affect the overall performance of the system. This paper focuses on the fairness of relay selection and user scheduling in cooperative communication systems. The main work includes: 1) introducing different fairness criteria through classification. An objective method to judge the fairness of a resource allocation model or a system is given, and their respective advantages and disadvantages are compared and analyzed. Then, the existing fair cooperation protocol based on network lifetime and the fair cooperation protocol based on energy consumption of relay nodes are discussed. These two protocols design different fairness algorithms from different angles. Improved fairness between nodes, effectively improved the overall performance of the network .2) based on the traditional opportunity relay, by setting a counter for each relay node to record the number of times it is employed to assist the source node. In this paper, a novel fair relay selection algorithm is proposed. In the process of relay node selection, the end-to-end channel quality and counter value of relay node are taken into account in the algorithm, so that users with better channel quality are avoided from being overutilized. It ensures that all relay nodes in the system are selected almost equal times and have the same resource consumption. Finally, the simulation results show that the proposed algorithm can effectively balance the power consumption of each relay node, prolong the network life, improve the total throughput of the system, and extend the idea of proportional fair scheduling to cooperative communication. A proportional fair cooperative scheduling algorithm is proposed for uplink transmission in cooperative cellular cells. Simulation results show that the combination of fair relay selection and proportional fair cooperative scheduling algorithm not only effectively balances the number of times each node is selected in the relay selection process, but also ensures the fairness of relay selection. The network life is prolonged and a good compromise can be achieved between system throughput and user fairness, which ensures that every user in the system can achieve almost equal throughput.
【学位授予单位】:西安电子科技大学
【学位级别】:硕士
【学位授予年份】:2014
【分类号】:TN929.5

【参考文献】

相关期刊论文 前1条

1 李富年;朱光喜;王德胜;;多用户协作通信中基于比例公平的资源分配[J];华中科技大学学报(自然科学版);2012年02期



本文编号:2055552

资料下载
论文发表

本文链接:https://www.wllwen.com/kejilunwen/wltx/2055552.html


Copyright(c)文论论文网All Rights Reserved | 网站地图 |

版权申明:资料由用户0d92f***提供,本站仅收录摘要或目录,作者需要删除请E-mail邮箱bigeng88@qq.com