无线通信中的能效优化技术研究

 2022-08-08 09:08

论文总字数:33085字

摘 要

近年来,随着用户数量的增长和用户需求的提升,无线网络的能耗呈几何级的增长。如何降低能耗不仅仅是一个环境保护方面的问题,更是严峻的经济问题,因此如何在高质量通信的同时降低无线通信中的能耗成为近年来被广泛关注的问题,对该问题的研究也逐渐深入。本文针对无线通信网络的能耗问题做了如下研究:

研究了用于户外小型异构网络的上下文感知用户关联算法,该算法利用上下文感知信息(包括用户设备的位置和需求、异构网络架构知识、每个基站的可获得的频谱资源)以获得最大网络能效为目标进行用户关联。算法优先将用户设备与业务到达核心网络需要跳数最少的基站关联,从而减少回程网络的能耗,在跳数相同时,将用户设备与相应回程链路上业务负载较少的基站关联,从而更好地实现了回程链路上的负载平衡。

研究了异构网络中时延感知上行链路的用户关联算法,该算法考虑到上行链路通信中用户之间的相互干扰问题和用户流量需求的动态性问题,在自适应功率控制算法上加入延迟约束,通过穷举搜索的方法找到实际的空端时隙和延迟关键时隙,并通过迭代的方式不断优化信道条件,最后将用户设备与具有最优信道条件的基站关联。通过迭代,信道条件在优化的同时,最优发射功率也在不断被优化,从而降低了整个网络的能耗。

用Matlab对两个用户关联算法分别进行仿真工作,并将两个算法各自与其它参考算法的性能进行比较,最后证实两个算法的能效优化性能明显高于其它参考算法。

关键词:能效优化、用户关联、绿色通信、异构网络

Abstract

With the increase in the number of users and user demand, the energy consumption of wireless networks has grown rapidly. The issue of energy consumption is not only an environmental protection problem, but also a serious economic problem. Therefore, how to reduce the energy consumption in wireless communication with high-quality communication has become a topic of widespread concern in recent years, and the research on this issue has been gradually deepened. The energy consumption of wireless communication networks is investigated in this thesis.

(1) Context-aware user association algorithms for small outdoor heterogeneous networks is investigated. Context-aware information (including user equipment location and requirements, heterogeneous network architecture knowledge, and available spectrum resources for each base station) is used to perform user associations to ensure that the network energy consumption is minimized. It preferentially associates the user equipment to the base station with the least number of hops to core network. Thus the energy consumption of the back-haul network is reduced. And when the number of hops the user equipment is associated with the base station with less traffic load on the corresponding back-haul link, the load balancing on the back-haul link is better implemented.

(2) User association algorithm for delay-aware uplink in heterogeneous networks is investigated. Considering the mutual interference problem between users and the dynamic problem of user traffic demand in uplink communication, this algorithm adds the delay constraint based on the adaptive power control algorithm. It finds the actual air-end time slots and delay key time slots through the exhaustive search method, and continuously optimizes the channel conditions through iterative methods. Finally, the user equipment is associated with the base station with the optimal channel conditions. Through iterations, while the channel conditions are optimized, the optimal transmit power is constantly being optimized, thereby reducing the energy consumption of the entire network.

(3) Matlab is adopted to simulate the two user association algorithms, and the two algorithms are compared with that of other reference algorithms. Results show that the energy efficiency performance of the two algorithms is significantly higher than others.

KEY WORDS: energy efficiency optimization, user associations, green communications,

heterogeneous networks,

目录

摘要 Ⅰ

Abstract Ⅱ

第一章 绪论 1

1.1 研究背景及意义 1

1.1.1流量需求激增的移动互联网时代 1

1.1.2 数据传输的媒介——无线通信网络 2

1.1.3 无线通信面临的挑战 2

1.2 无线通信中的能效优化技术研究现状 3

1.2.1 国际绿色通信项目介绍 3

1.2.2 学术研究现状 3

1.3 本文主要内容及章节安排 5

第二章 用于户外小型异构网络的上下文感知用户关联算法 6

2.1 引言 6

2.2 系统模型 7

2.2.1 SNR计算 7

3.1.2 功耗模型 8

2.3 问题及算法描述 9

2.3.1 问题描述 9

2.3.2 算法描述 9

2.4 算法仿真 11

2.4.1 仿真参数 11

2.4.2 仿真结果及分析 14

2.5 本章小结 16

第三章 时延感知上行链路用户关联和异构蜂窝网络中的功率控制 17

3.1 引言 17

3.2 系统模型 17

3.3 问题及算法描述 19

3.3.1 问题描述 19

3.3.2 算法描述 22

3.4 算法仿真 24

3.4.1 仿真参数 24

3.4.2 仿真结果及分析 25

3.5 本章小结 27

第四章 总结 28

致谢 29

参考文献 30

第一章 绪论

近年来,无线网络飞速发展,智能移动终端设备更新换代速度持续加快,各类新型业务层出不穷,促使无线通信技术发展迅速,无线通信网络的规模日益壮大。数量急剧增长的移动终端设备和用户的流量需求不仅对无线通信网络的容量提出了新的要求,更是对无线通信网络的频谱效率和能量效率的严峻挑战。因此,如何在满足用户高需求的同时降低网络能耗,创造可持续发展的绿色通信环境,成为当前无线通信发展迫切需要解决的问题。本章首先概述了无线通信网络能效优化的研究背景及意义,然后介绍了能效优化技术的研究现状,最后对本文结构做出说明。

1.1 研究背景及意义

剩余内容已隐藏,请支付后下载全文,论文总字数:33085字

您需要先支付 80元 才能查看全部内容!立即支付

该课题毕业论文、开题报告、外文翻译、程序设计、图纸设计等资料可联系客服协助查找;