平均分集合并Hybrid ARQ CDMA系统性能分析

针对干扰受限CDMA系统的Hybrid ARQ方案,推广了传统平均分集合并条件下的信噪比分析。引入有效吞吐率指标以反映分配单位功率所对应的无线小区吞吐率增益,分析了平均分集合并HARQ系统的吞吐率和有效吞吐率性能。结果表明,HARQ系统吞吐率在功率分配比例达到一定值后将达到饱和,为实现无线小区吞吐率增益的最大化,功率分配比例有相应的最优化值。     

Gbps无线传输关键技术及试验验证系统

面向IMT-Advanced系统高达Gbps的无线传输速率需求,本文针对Gbps无线传输关键技术及其实现进行了有效研究。本文介绍了所提出的Gbps无线传输技术的空中接口参数、帧协议、无线链路及物理层关键技术,引进了硬件平台与试验验证系统。多项研究成果以标准提案的形式被国际、国内标准组织接纳,并在Gbps试验验证系统上取得重要进展,实现了Gbps无线传输,演示了未来移动通信系统的典型业务,推动了我国4G移动通信技术研究的发展。     

WCDMAFemtoRLC层ARQ机制的研究及分析

无线链路控制（RLC）子层位于WCDMAFemto系统无线接口协议的第二层．它向高层提供三种数据传输模式：透明传输（TM）．非确认模式（UM）和确认模式（AM）。ARQ（自动重传请求）是WCDMAFemto系统为保证层2数据正确传送所采用的一种重传机制。本文在介绍WCDMAFcmtoRLC层AM模式的同时．对ARQ机制进行阐述．并详尽分析了AR0的工作原理。     

无线Mesh网络中数据传输可靠性的保障策略

无线Mesh网技术是一种新的无线网络技术,其核心是任何无线设备节点都可以同时作为接入点（AP）和路由器,网络中的每个节点都可以发送和接收信号,每个节点都可以与一个或者多个对等节点进行直接通信。无线Mesh网中需要考虑完成通信的多跳过程中产生的数据传输可靠性的保障问题。使用第三代合作伙伴计划（3GPP）的系统架构中提出的混合自动重传请求（HARQ）和自动重传请求（ARQ）功能,可以对多跳链路数据可靠传输进行保障。其中针对HARQ提出了逐跳和端到端两种方法,而对于ARQ功能除了逐跳和端到端两种方法外还增加了最后一跳的保障机制。从协议栈构架设计的角度,根据HARQ和OARQ机制提出了3种解决方法：分层机制、Relay ARQ机制、多剧SARQ机制。     

TD-LTE系统HARQ重传机制研究及性能分析

针对无线移动信道时变和多径衰落对信号传输的负面影响,TD-LTE系统采用前向纠错（FEC）和自动重传请求（ARQ）相结合的方法降低误码率;根据3GPP协议中对于冗余版本的规定以及LTurbo速率匹配的特点,研究不同的冗余版本号对应的重传数据分组对系统译码增益的提高空间,仿真分析不同重传机制对系统性能的影响,最后提出一个最佳的重传机制实施例使系统性能最优。     

无线Mesh网中基于网络编码感知的分组公平调度机制

 利用竞争无线媒介的用户的传输代价不同,本文提出了一种基于网络编码感知的分组公平调 度机制FSNC.FSNC机制的基本调度单位是编码集,编码集中的用户将依据自身在编码集中的 权重,公平地获取统计上的长期和短期系统服务时间.FSNC机制是通过用户的ARQ反馈消息, 感知用户的解码能力从而做出调度决策的.理论和仿真实验证明,FSNC机制在改善多用户分 集系统的用户的吞吐率的同时,能够为多用户提供公平的服务时间.     

一种无线网络中基于ARQ的拥塞控制方法

提出了一种适用于无线网络的基于多拒绝自动请求重传（ARQ）算法的拥塞控制方法。谊方法结合随机早探洲（RED）算法,通过ARQ发送窗口和分割队列长度以及重传率进行拥塞控制。仿真表明,这种方法能预测链路拥塞,反馈链路拥塞程度,提高链路吞吐率。     

一种多优先级变长调度星载IP交换机交换结构的设计

针对星载IP交换机中硬件资源使用受限的情况,设计实现了一种具有8个优先级、采用指针复制和变长分组调度机制的大容量共享存储交换结构,给出了电路的具体组成、关键调度算法和工作流程.使用Xilinx V4sx55 FPGA实现了完整的8×8交换结构,电路共占用了164K字节片上存储器资源和5982个4输入查找表,可以满足三模冗余设计要求.在系统工作主频为100MHz、片外采用SRAM、数据位宽为64的情况下,交换结构的峰值吞吐率可以达到1.6Gbps;片外采用133MHz DDR存储器、位宽为64时,交换结构的峰值吞吐率可以达到4.25Gbps;该交换单元进行多级扩展后,可以满足10Gbps以上的系统设计需求.     

无线弱实时多媒体业务传输模型分析

提出了无线“弱实时多媒体业务”的概念。利用RTP协议的体系框架,结合自适应的ARQ重传算法,实现了新的传输模型。仿真结果显示,该传输模型很好地解决了无线“弱实时多媒体业务”传输在时延、吞吐时抖动和差错概率之间的均衡问题。     

基于波分复用的红外图像光纤传输系统

针对目前红外搜索跟踪系统中,光纤千兆以太网带宽无法满足多传感器实时图像传输需求,设计了基于波分复用的红外图像光纤传输系统,此系统带宽达到4 Gbps,体积算法不变的情况下,可扩展到8 Gbps,满足红外搜索跟踪系统使用要求。     

一种基于惩罚因子的LTE上行调度算法研究

针对LTE系统无线信道的复杂性和用户上行信道估计的不准确性,结合上行信道的实际情况,对经典PF调度算法进行改进,提出一种基于惩罚因子的LTE上行调度算法,并采用该算法对GBR业务进行上行调度仿真。实验结果表明,该算法在仿真网络环境下能有效提升LTE网络的上行业务量,提高网络资源的利用率。     

An efficient resource optimization scheme for D2D communication

With the rapid development of wireless technologies, wireless access networks have entered their Fifth-Generation (5G) system phase. The heterogeneous and complex nature of a 5G system, with its numerous technological scenarios, poses significant challenges to wireless resource management, making radio resource optimization an important aspect of Device-to-Device (D2D) communication in such systems. Cellular D2D communication can improve spectrum efficiency, increase system capacity, and reduce base station communication burdens by sharing authorized cell resources; however, can also cause serious interference. Therefore, research focusing on reducing this interference by optimizing the configuration of shared cellular resources has also grown in importance. This paper proposes a novel algorithm to address the problems of co-channel interference and energy efficiency optimization in a long-term evolution network. The proposed algorithm uses the fuzzy clustering method, which employs minimum outage probability to divide D2D users into several groups in order to improve system throughput and reduce interference between users. An efficient power control algorithm based on game theory is also proposed to optimize user transmission power within each group and thereby improve user energy efficiency. Simulation results show that these proposed algorithms can effectively improve system throughput, reduce co-channel interference, and enhance energy efficiency.     

基于改进遗传算法的C-RAN网络动态无线资源分配

针对云无线网络(Cloud Radio Access Network,C-RAN)中传统静态资源分配效率低下以及动态无线资源分配中资源种类单一的问题,提出了一种基于用户服务质量(Qulity of Service,QoS)约束的动态无线资源分配方案,对无线资源从无线射频单元(Remote Radio Head,RRH)选择、子载波分配和RRH功率分配三个维度进行研究.首先,根据传统的C-RAN系统传输模型和QoS约束在时变业务环境下建立了以发射功率为变量,以吞吐量最大为优化目标的优化问题;然后,基于改进的遗传算法,将原优化方案转变为通过优化RRH选择、子载波分配和RRH功率分配来达到提高系统吞吐量的目的;最后,将改进的遗传算法与其他智能算法在种群规模变化下进行了时间复杂度对比.实验结果表明,所提算法具有较低时间复杂度,所提资源分配方案下的平均吞吐量增益为17％.     

Optimal cooperative strategy based on quantum bat for cognitive radio of energy harvesting

In order to reduce energy consumption and improve spectral efficiency of the cognitive relay wireless communication system in 5G network,an optimal cooperative transmission strategy of information and energy was designed for cognitive relay radio with wireless energy harvesting.For the proposed optimal cooperative strategy,the maximal throughput formula and outage probability of secondary user were deduced.In order to resolve the derived maximum throughput equation,a quantum bat algorithm which was based on the optimization mechanism of quantum computing and bat algorithm was designed to solve the deduced equation,and the optimal cooperative transmission scheme for information and energy could be obtained.Simulation results show that the proposed optimal cooperative strategy not only can meet the information transfer demand of primary user,but also can realize the energy self-supply of the secondary user system and improve the communication quality of the secondary user.The proposed optimal cooperative strategy has a better performance than the cooperative strategy of existing cognitive relay radio for different simulation scenarios.     

Programmable processor implementations of -best list sphere detector for MIMO receiver

An increasing number of standards in wireless communications have encouraged to study programmable processors as platforms for flexible receivers. A multiple-input multiple-output (MIMO) antenna system combined with orthogonal frequency division multiplexing (OFDM) technique has been introduced in many wireless communications standards, such as in the third generation long term evolution (3G LTE). The MIMO-OFDM system requires an efficient detector and a platform support for parallel processing of multiple subcarriers. A K-best list sphere detector (LSD) provides for near optimal decoding performance and a fixed throughput making it an interesting algorithm from the point of view of practical implementations.In this paper, we compare the implementations of the K-best LSD on four processor platforms: a digital signal processor (DSP), software defined radio (SDR), application-specific processor (ASP) and application-specific instruction-set processor (ASIP). The DSP is a popular very long instruction word (VLIW) device (TMS320C6455), the SDR processor employs multithreading and multiple cores (SB3500 core processor), the ASP is based on transport triggered architecture (TTA), while the ASIP is the SDR processor enhanced with a special instruction-set extension for sorting.A 2×2 MIMO antenna system with 64-quadrature amplitude modulation (64-QAM) is assumed. The chosen list sizes K=8 and 16 are based on simulation results carried out in MATLAB environment with the third generation long term evolution (3G LTE) parameters. The proposed ASIP achieved a promising throughput of 32.0 Mbps, where the software defined radio (SDR) implementation on the SB3500 core processor suffers from an inefficient software sorter. The ASP, in which the minimized hardware complexity has been the goal, achieves a throughput of 7.6 Mbps. However, more essential examination is related to the symbol time, which sets strict parallel processing requirements to the programmable processors.     

Dynamic Virtual Resource Allocation in Virtualized multi-RAT Cellular Networks

The legacy wireless systems are designed to exploit static configuration and deployment, and cannot handle the discrepancies of the spatio-temporal traffic demand. Cloud RAN (C-RAN) is a novel flexible radio technology that utilizes the virtualization concepts and can efficiently address the static deployment of conventional wireless systems. The C-RAN also leverages high radio network flexibility by introducing the network function virtualization approach to wireless networks. This paper presents a novel C-RAN platform that virtualizes and operates with full GSM and LTE systems. The presented platform is solely based on open-source and off the shelf solutions, providing easy implementation, low cost and high scalability. The paper also introduces a novel dynamic resource allocation algorithm that facilitates the C-RAN’s optimal performance in dynamic scenarios. The proposed algorithm is analyzed and validated on the presented C-RAN platform. The results of the performance analysis clearly show the advantages of the proposed dynamic resource allocation algorithm. Moreover, they prove the applicability of the C-RAN platform for variety of different scenarios.     

Physical layer capture aware MAC for WLANs

The physical layer capture (PLC) effect occurs frequently in the real wireless deployment; when two or more nodes transmit simultaneously, a receiver can successfully decode the collided frame if the signal strength of one frame is sufficiently high enough. Although the PLC effect increases the channel utilization, it results in an unfair channel access among the wireless nodes. In this paper, we propose a PLC-aware media access control (MAC) algorithm that employs the average waiting time as a common control reference. It enables the nodes to converge to a fair channel access by changing one of the IEEE 802.11 enhanced distributed channel access parameters: contention window, arbitration interframe space, or transmission opportunity. We then find multiple control references that meet the fair channel access constraint and obtain the near-optimal reference that maximizes the overall throughput. Through ns-2 simulations and real in-door experiments using the universal software radio peripheral platform, we evaluate the fairness and throughput performance of the PLC-aware MAC algorithm.     

认知无线电中资源优化问题的研究

认知无线电中,主用户活动的随机性、无线信道的时变性及硬件设备的固有限制会使认知用户的监听结果出现误差,导致在数据传输时隙,主用户和认知用户之间出现传输碰撞。针对这种情况,研究了基于正交频分复用(OFDM)认知无线电中总有效可达吞吐量的最优化问题。利用拉格朗日乘子法推导了该问题的最优解,提出了一种基于混沌优化的搜寻算法以获取最优解。仿真结果验证了该算法的有效性。     

The Maximum Throughput of A Wireless Multi-Hop Path

In this paper, the maximum end-to-end throughput that can be achieved on a wireless multi-hop path is investigated analytically. The problem is modeled using the conflict graph, where each link in the multi-hop path is represented uniquely by a vertex in the conflict graph and two vertices are adjacent if and only if the associated links mutually interfere. Using the conflict graph and the linear programming formulations of the problem, we analyzed the maximum end-to-end throughput of a wireless multi-hop path a) in a simple scenario where nodes are optimally placed and each node can only interfere with the transmission of its adjacent nodes along the path, and b) in a more complicated scenario where nodes are randomly placed and each node can interfere with the transmission of any number of nearby nodes along the path in both a) an error free radio environment and b) an erroneous radio environment. The maximum end-to-end throughputs for each of the above four scenarios are obtained analytically. We show that the maximum achievable end-to-end throughput is determined by the throughput of its bottleneck clique, where a clique is a maximal set of mutually adjacent vertices in the associated conflict graph. Further our analysis suggests the optimum scheduling algorithm that can be used to achieve the maximum end-to-end throughput and that it is convenient to use the (maximal) independent sets as the basic blocks for the design of scheduling algorithms. The findings in this paper lay guidelines for the design of optimum scheduling algorithms. They can be used to design computationally efficient algorithms to determine the maximum throughput of a wireless multi-hop path and to design a scheduling algorithm to achieve that throughput.     

Cooperative load-balancing strategy based on N-hops routing algorithm of ad hoc network in heterogeneous overlapping networks

A major challenge of the heterogeneous wireless networks is how to jointly utilize the resources of different radio access technologies in an efficient manner. In this paper, system performance, such as the block probability and throughput, was investigated in communication hot spots overlapped by heterogeneous networks: cellular, WLAN, and WiMax networks. Two cooperative load-balancing strategies based on hops-limited routing algorithm of ad hoc network are proposed in order to raise the resource utilization of the whole overlapping heterogeneous networks. They both firstly make a decision whether to admit a new call or not based on common radio resource management strategies, and in overloaded condition, select certain traffic to transfer into targeted BS/AP according to minimum price strategy or minimum load BS/AP and nearest traffic strategy, which take into account these factors such as load index, number of hops, traffic prediction, cost, etc. An analytical model is used to compute the call block probability and throughput performance for two different traffic models. Simulation results show that the proposed load-balancing strategies can distribute traffics to the whole heterogeneous wireless networks, decrease the call block probability, improve system throughputs efficiently, and obviously outperform HM-MACA and HS-TC load-balancing strategies.