多跳全双工无线网络传输机制及性能评价研究

发布时间：2018-05-18 11:06

本文选题：全双工无线网 + 传输机制　；参考：《北京信息科技大学》2017年硕士论文

【摘要】：全双工(Full-duplex,FD)通信技术以其吞吐容量倍增及其潜在的频谱资源利用率提升能力得到学术界和工业界的广泛关注。本文围绕多跳全双工无线网络传输机制及性能评价展开研究。首先,本文深入分析了影响全双工无线网络容量增益的几种因素,构建了双信道下全双工无线网络容量分析模型,提出了一种综合分析框架以量化全双工无线网络网络层容量增益比。得出一维双信道全双工无线网络双向传输模式下,每一流的网络容量为W/(nD)?4/(2+Δ),二维双信道全双工无线网络双向模式的网络容量上界为(2W)/(nD)?2/(2+?)?(1+?)r。其次,针对双信道全双工无线网络提出两种链路调度算法以优化网络吞吐量。一种是集中式链路调度算法(简称为CLSA)。在CLSA算法中,本文把链路调度问题转化为求无线网络中链路干扰图的最大独立集问题。首先为多跳全双工无线网络构建链路的干扰冲突图,再运用模拟退火算法求其最大独立集。另一种是分布式链路调度算法(简称为DLSA)。在DLSA算法中,本文考虑了异步竞争并修改节点退避计时器的衰减机制以有效利用空闲网络资源。而后,通过MATLAB仿真工具分别构建网络场景实现了两种调度算法,并与理想的调度模式以及贪婪调度做分析对比。最后,针对多跳全双工无线网络中路由选择与链路调度联合优化问题,运用网络流相关理论对问题建模,给出了形式化描述。鉴于此问题是NP-hard问题,本文提出了两种路由选择算法:MinCostRo和MinMaxRo。待所有流均选择各自的路径后,再使用基于CSMA思想的链路调度机制为所选链路分配时间片。对于所提算法,本文使用MATLAB做仿真实验,并与经典的最短路径路由选择算法(简称为SPRA)和AODV-Based算法从不同角度作对比分析。实验结果验证了MinCostRo算法相比其他三种算法均有性能上的提升。MinCostRo提升系统吞吐量相比SPRA和AODV-Based分别是49%和33%。
[Abstract]:Full-duplex FDD (full Duplex) communication technology has attracted extensive attention from both academia and industry for its capacity doubling and potential spectral resource efficiency enhancement. This paper focuses on the transmission mechanism and performance evaluation of multihop full duplex wireless networks. Firstly, several factors affecting the capacity gain of full-duplex wireless network are analyzed, and a full-duplex wireless network capacity analysis model is constructed. A comprehensive analysis framework is proposed to quantify the capacity gain ratio of full duplex wireless network layer. It is obtained that in the bidirectional transmission mode of one-dimensional dual-channel full-duplex wireless network, each first-rate network capacity is W/(nD)?4/(2 螖, and the upper limit of network capacity of two-dimensional dual-channel full-duplex wireless network is 2W / 2 / 2 / 2 / 2 / 1 / r. Secondly, two link scheduling algorithms are proposed to optimize network throughput for dual channel full duplex wireless networks. One is a centralized link scheduling algorithm (CLSAA). In the CLSA algorithm, the link scheduling problem is transformed into the maximum independent set problem of the link interference graph in the wireless network. Firstly, the interference collision graph of multi-hop full-duplex wireless network is constructed, and then the maximum independent set is obtained by simulated annealing algorithm. The other is distributed link scheduling algorithm (DLSAN). In the DLSA algorithm, the asynchronous competition is considered and the attenuation mechanism of the node Backoff timer is modified to make efficient use of the free network resources. Then, two scheduling algorithms are implemented by constructing network scenarios with MATLAB simulation tools, and compared with ideal scheduling mode and greedy scheduling. Finally, aiming at the joint optimization problem of routing and link scheduling in multi-hop full-duplex wireless networks, the network flow correlation theory is used to model the problem, and a formal description is given. In view of the fact that this problem is a NP-hard problem, two routing algorithms: MinCostRo and MinMax Roo are proposed in this paper. After all the streams choose their own paths, a link scheduling mechanism based on CSMA is used to allocate time slices for the selected links. The proposed algorithm is simulated by MATLAB and compared with the classical shortest path routing algorithm (SPRA) and the AODV-Based algorithm from different angles. The experimental results show that the performance of the MinCostRo algorithm is 49% and 33% higher than that of the other three algorithms. MinCostRo improves the throughput of the system compared with SPRA and AODV-Based, respectively.
【学位授予单位】：北京信息科技大学
【学位级别】：硕士
【学位授予年份】：2017
【分类号】：TN92

【相似文献】