全双工协作多播业务在NOMA系统中的应用和性能

研究了多播业务在协作非正交多址接入（non-orthogonal multiple access,NOMA）系统中的应用及其性能。在一个单播和多播混合业务的场景中,多播用户组中选择某个信道状态最好的用户作为中继进行解码转发单播用户的信号,并在中继用户支持全双工的模式下,分析和推导了单播用户的中断概率和平均可达速率的闭式表达式。蒙特卡洛仿真结果和理论推导高度一致,表明提出的协作多播应用可以极大改善单播用户的中断性能,且多播用户的容量性能在中继发射功率不是很高的情况下不会受到影响。     

IEEE 802.11b DCF三维Markov非饱和链路模型

为了准确评估实际网络中IEEE 802.11b分布式协调功能(Distributed Coordination Function,DCF)的系统性能,提出了一种三维Markov链路模型,该模型综合考虑了DCF协议退避计数器冻结状态和有限重传次数,并结合M/M/1/K排队模型给出了在负载有限的情况下DCF系统性能的理论模型。仿真结果表明,该模型能准确地预测IEEE 802.11b DCF协议的系统性能。     

Throughput maximization in wireless powered communication networks with minimum node throughput requirement

This paper considers wireless powered communication network consisting of one hybrid access point and a set of one‐hop nodes. Hybrid access point conducts wireless energy transfer (WET) in the downlink and nodes conduct wireless information transmissions (WITs) in the uplink based on the time division multiple access (TDMA) mode. Specifically, for the scenario where each node has its own minimum throughput requirement and different nodes' data have different levels of utility, we aim to achieve the minimum node throughput constrained weighted sum throughput maximization (MT‐WSTM) by jointly optimizing the time allocations of the WET and the WITs. First, we formulate the MT‐WSTM problem as a nonlinear optimization problem and further transform it into a more tractable form. Then, we prove the MT‐WSTM problem is convex and develop an efficient algorithm utilizing the dual decomposition technique to obtain the optimal solution of this problem. Compared with two schemes which use the optimal WET time and allocate the surplus WIT time evenly to all nodes and solely to the best node, respectively, the weighted sum throughput of the MT‐WSTM scheme is obviously larger in both homogeneous and heterogeneous scenarios.     

基于Gilbert丢包机制的TCP吞吐量模型

 丢包机制是推导TCP吞吐量模型的关键,直接影响模型的准确性.本文利用四状态Gilbert丢包机制来描述端到端路径上的丢包行为,对TCP的拥塞控制过程进行建模,在此基础上提出了一种更精确的TCP吞吐量模型.实验表明,改进的模型能较好的与实际值相拟合,可以更精确地预测实际TCP数据流的吞吐量性能.     

Web服务器的网络负载均衡研究

介绍了网络负载均衡的定义和总体指标。详细讨论了网络负载均衡技术的4种类型。针对不同Web服务器的架构,分析了服务器的吞吐量和网络延迟,其结论对于有效提高服务器的整体性能、服务质量和服务水平具有参考意义。     

Improving TCP performance for vertical handover in heterogeneous wireless networks

The incorporation of wireless local area networks (WLANs) into existing cellular networks as supplementary access technologies has become an issue of great interest. However, vertical handover (VHO), which allows users to roam between a WLAN and a cellular network, causes an abrupt change in certain link characteristics such as the round trip time and data rate. Owing to such changes, reordering problem and premature timeout occur and trigger unnecessarily fast retransmission during VHO, causing throughput degradation. Thus, we propose a new transmission control protocol (TCP) mechanism, which resolves the reordering problem by suppressing unnecessary retransmission caused by spurious duplicate acknowledgments (dupacks) incurred because of the reordering problem, and prevents premature timeout by employing an adaptive retransmission timer. We analytically investigate the throughput of our proposed TCP scheme. The numerical and simulation results show that our proposed TCP performs better in terms of throughput than other schemes appearing in the literature. Copyright © 2009 John Wiley & Sons, Ltd.     

LTE-A下行CoMP反馈开销减小方案

简单介绍了LTE-Advanced的关键技术之一——协作多点传输技术,通过分析该技术,指出了在下行反馈方面存在的反馈开销巨大的问题。通过对比现有的方案,并在现有方案基础上提出了新的反馈方案,从而在减小反馈开销方面得到很大提升。     

OFDMA系统中多波束机会波束成形研究

机会波束成形（Opportunistic Beamforming,OBF）技术通过加大、加快信道的波动来提高多用户分集增益,将之使用在正交频分复用多址接入（OFDMA）系统中,可以使得系统的吞吐量最大化。在OFDMA系统中,通过对所有子载波进行分簇,可以实现在牺牲系统性能很少的情况下,大大降低系统反馈量。研究了对分簇OFDMA系统使用OBF技术来提高系统吞吐量,并进一步研究了在训练阶段使用多个随机加权向量进行多波束成形,然后从中选择最好的一个来实现数据阶段的波束成形。仿真证明,采用多波束机会波束成形技术能提高OFDMA系统吞吐量。     

Genetic algorithm‐based content distribution strategy for F‐RAN architectures

Fog radio access network (F‐RAN) architectures provide markedly improved performance compared to conventional approaches. In this paper, an efficient genetic algorithm‐based content distribution scheme is proposed that improves the throughput and reduces the transmission delay of a F‐RAN. First, an F‐RAN system model is presented that includes a certain number of randomly distributed fog access points (F‐APs) that cache popular content from cloud and other sources. Second, the problem of efficient content distribution in F‐RANs is described. Third, the details of the proposed optimal genetic algorithm‐based content distribution scheme are presented. Finally, simulation results are presented that show the performance of the proposed algorithm rapidly approaches the optimal throughput. When compared with the performance of existing random and exhaustive algorithms, that of the proposed method is demonstrably superior.     

An integrated FEC coding scheme for ATM transmission over regenerative satellite networks

The application of asynchronous transfer mode (ATM) on both wireless and satellite networks requires system adaptation. This adaptation has to improve the overall system's performance, and achieve high quality‐of‐service classes approaching that for fibre‐optic communications. In this paper, a new integrated forward‐error‐correction (FEC) coding scheme is introduced for ATM transmission over regenerative satellite networks. The proposed FEC scheme is a concatenation of two Reed–Solomon codes tailored for the header and payload parts of the ATM cell. This integrated coding scheme is shown to significantly improve the cell loss ratio as compared to the standard CRC code used in the ATM cell header. We obtain both upper and lower performance bounds for the concatenated code and check their accuracy when compared to exact system's performance. Both analytical and simulation results show that a cell loss ratio and bit‐error rate (BER) of 10^?25 and 10^?7 can be, respectively, achieved with minimum delay requirements on the SATCOM link. Finally, an approximation for the system's throughout is obtained. It is shown that using a hybrid selective‐repeat automatic‐repeat‐request (SR‐ARQ) with the RS code, a large throughput of approximately 0.843 can be achieved at BERs lower than 10^?7 for data services. Copyright © 2005 John Wiley & Sons, Ltd.