采用发送功率加权分配策略的群小区架构容量与覆盖分析

随着用户对高速率、高质量无线通信业务需求的不断增长,以及对多入多出、空时码、分布式天线等多天线信号处理技术的深入研究,探讨面向未来移动通信系统的小区构建方法成为必然的需求。该文介绍了一种广义分布式小区架构群小区,群小区架构适应先进的物理层技术,能够充分利用多天线技术带来的优势,并且可以解决未来移动通信系统由于载频提高导致小区变小带来的频繁切换问题。该文介绍了群小区架构的概念、构建方法以及基于群小区架构的滑动切换策略,重点分析了群小区架构采用下行发送功率加权分配策略下的容量性能和覆盖性能。理论分析和仿真结果证明,与当前的小区架构相比较,群小区架构可以有效地提高系统容量,扩大覆盖范围。     

分布式虚拟小区网络及其反向链路容量分析

本文提出了一种新的无线系统结构:基于分布式天线的分布式虚拟小区网络.在新型无线系统结构里,虚拟小区可自主移动与改变面积,这有益于容量提高,给无线资源管理带来诸多方便;其次,在不考虑阴影效应和多径衰落的情况下,对虚拟小区的反向容量进行了理论计算分析,并与分布式天线系统进行了对比.理论分析证明,虚拟小区可以降低用户发射功率,从而减少多用户干扰,提高系统容量.     

蜂窝系统中分布式空域基站协作的仿真研究

对分布式空域基站协作进行了分析仿真,重点对两小区场景和三小区场景采用最大化层虚拟信干噪比算法的预编码技术进行了仿真验证,并与采用最大化虚拟信干噪比算法的预编码技术进行了比对。仿真结果表明通过分布式的基站协作预编码算法,可以有效地抑制小区间干扰,提高系统的性能;结果还表明层虚拟信干噪比算法比虚拟信干噪比算法有更好的性能,增加天线数量也可以提高系统的性能。     

基于分布式天线系统的虚拟小区研究

在无线用户增多,而无线通信小区不能再微小化的情况下,提出了在分布式天线系统中构建虚拟小区,介绍了虚拟小区重组与切换过程及功率控制下的无线接入与信道分配策略。最后仿真了虚拟小区的系统性能,结果表明虚拟小区有较高的通信速率,虚拟小区网络可以服务更多用户,适用于密集用户的无线局域网通信。     

基于分布式天线选择的TD—SCDMA动态小区覆盖技术

分布式M IMO天线结构可以降低发射功率,减少小区干扰,而天线选择技术在保持了M IMO系统优点的同时降低成本。TD-SCDMA有独特的时隙结构,可将不同时隙用于不同的天线组来覆盖不同的小区。基于此,提出了一种分布式天线选择的动态小区覆盖技术,采用两级天线选择,第一级可根据用户的具体位置选择天线组并确定覆盖范围,有效减少小区干扰,同时采用了预分配天线组方法,避免了通用天线选择算法的复杂性;第二级在选定的天线组内确定具体的天线,仿真结果说明该方法具有与一般天线选择相同的性能但更简单。     

基于粒子群算法的分布式MIMO系统圆形小区天线位置优化研究

本文研究分布式MIMO(Multiple-Input Multiple-Output)系统圆形小区基站侧天线端口的位置优化问题.论文首先建立了包含小尺度Nakagami衰落、阴影衰落和路径损耗的复合衰落信道模型,然后在收发端皆配置多根天线、移动台于小区内具任意概率分布、发射和接收端分别实施选择性传输和最大比合并方案下,在高信噪比条件下推导出圆形小区下行平均遍历容量的近似闭型表达式;随后通过对小区进行相应的区域预划分,采用粒子群算法而非传统遗传算法以快速搜索当前区域内天线端口的最佳位置,并最终根据小区天线端口位置的整体搜索结果确定天线优化布局.仿真结果表明,本文所推导的平均遍历容量近似表达式能较好地反映分布式MIMO系统性能,且所采用的基于粒子群算法的小区最优天线端口位置搜索结果也能较好地接近理论最佳位置.     

分布式小区架构结合STBC的小区间干扰协调策略

针对分布式小区架构的小区间干扰抑制问题,提出了一种结合空时分组码(STBC)的小区间干扰协调策略.该策略一方面通过小区间干扰协调对一个小区的可用频率资源进行某种限制,从而提高相邻小区在这些资源上的信干比和小区边缘的数据速率.另一方面,针对分布式小区架构的多天线技术优势,通过在多天线结构中使用STBC编码获得分集增益,进一步提高小区边缘用户性能.为了减少多天线同时服务引入的额外干扰,只有当用户收到的来自多个小区的信号强度相差不大时,才使用STBC编码.否则,选用一个信号强度最大的小区为用户提供服务.仿真结果表明,所提出的方法有效地提高了系统吞吐量,特别是小区边缘用户的吞吐量.     

三角形蜂窝小区的遍历信息论容量分析

三角形小区通信系统（TCCS）是一种新型分布式基站（BS）通信系统。小区结构为正三角形,分为3个单一覆盖区（UCR）和1个交叉覆盖区（CCR）。移动台（MS）在单一覆盖区内只与邻近的BS通信,在交叉覆盖区内与小区所有3个基站通信。在该小区结构的基础上,该文提出了在单一覆盖区内采用频率复用,在交叉覆盖区内采用宏分集的频率规划方案。在这种规划方案和每根天线最大发送功率限制下,计算了多小区环境下TCCS在MS单天线和多天线时的遍历容量,与相同条件下的广义分布式天线系统（GDAS）作了比较,结果显示在各种情况下,TCCS的容量相对于GDAS都有显著的增益。     

一种广义分布式多小区架构--群小区

为了更好地适应如空时码、联合发送、多入多出等未来移动通信系统核心技术的应用，满足第三代移动通信系统（3G）的多媒体业务对通信链路质量越来越高的要求。需要探讨全新的移动通信小区与网络拓扑结构。广义分布式多小区架构可以适应先进的多天线技术，并有效地解决由于载频提高导致的频繁切换问题。基于该架构的新型切换策略——群切换可以消除小区边缘效应，而进一步将群切换思想应用于3G系统的快速小区组选择方案可以大幅度地提高小区边缘用户的数据速率。     

线型小区中V-BLAST两根分布发射天线的位置优化

在分布式发射天线多输入多输出(MIMO)系统中,不同的发射天线位置将影响系统的性能。针对这一问题,该文在考虑了传播时延、路径损耗、阴影衰落、小尺度衰落和高斯白噪声的基础上研究了V-BLAST两根分布式发射天线在线型小区的平均误码率(AABER)。理论分析表明存在一个关于小区中心对称的位置使得AABER性能最优,这一位置可以通过数值计算的方法得到。仿真结果验证了理论分析的正确性。     

DHT网络中一种基于虚拟服务器拆分的负载平衡算法

分析比较了目前DHT网络中基于虚拟服务器（virtual server）的负载平衡算法,根据节点间间距的分布概率,建立了基于虚拟服务器的DHT网络负载分布数学模型,详细分析和计算了DHT网络中单虚拟服务器问题（SVSP）发生的概率,提出了一种基于虚拟服务器拆分的负载平衡算法（VSSLBA）,仿真实验验证了理论推导的正确性与算法方案的有效性。     

Multicast routing strategies for zoned VP-based ATM networks

In ATM networks, the concept of virtual path (VP) greatly simplifies cell processing in switches. The virtual channel connection (VCC) can be more quickly and efficiently established by good strategies of resource management. The method of constructing virtual path and the strategies of managing and allocating resources greatly affect the performance of the system operation. We propose a new architecture and the corresponding methods of constructing virtual paths; various methods and strategies, such as bandwidth control, rerouting, resource management, and fault recovery, are studied (Lee and Shie 2000). This paper focuses on multicast routing and analyzes some algorithms for this model. Simulation results show the good performance in bandwidth utilization, blocking probability, and loss probability     

Pushout with virtual thresholds buffer management scheme in a shared buffer ATM switch

In this paper we investigate the performance metrics of buffer management schemes. In general, the selective pushout (SP) scheme can support very low loss probability of the high‐priority cells, but it may cause unfairness of buffer allocation among different output queues and high overall cell loss probability. In order to fit the dynamic required performance metrics of ATM switches, a novel buffer management scheme called pushout with virtual thresholds (PVT) is proposed. In the PVT scheme, each output queue is guaranteed to increase in length until its virtual threshold (VT). Simulation results show the PVT can dynamically achieve the fairness and low overall cell loss probability or very low loss probability of the high priority cells by adequately adjusting the VT. Specially, when the VT = 0, the PVT control can be viewed as the SP control. Copyright © 2003 John Wiley & Sons, Ltd.     

Capacity analysis in CDMA distributed antenna systems

In this letter, the effect of maximal ratio combining (MRC)-based macrodiversity on the reverse-link and forward-link capacity in code division multiple access (CDMA)-distributed antenna systems is analyzed. The concept of virtual cell is illustrated, and the analytical outage probability expressions are derived. The present investigation shows that on the reverse link, the interference can be suppressed greatly with macrodiversity, which leads to a significant increase in capacity. However, on the forward-link, it is proven that if simulcasting is used in CDMA-distributed antenna systems, the forward-link capacity cannot increase with macrodiversity whatever power allocation scheme is adopted. Based on the analysis of the cause of capacity loss, a new transmission scheme is further presented and the optimal power allocation scheme is derived. It is shown that, in this case, the forward-link capacity increases rapidly with the number of involved distributed antennas.     

A call admission control scheme for ATM networks using a simplequality estimate

The authors propose a call admission control scheme based on a method of estimating cell loss quality for individual bursty traffic sources. The estimate is expressed in terms of virtual cell loss probability, which may be defined by two traffic characteristic parameters alone: peak and mean rate. The approach is suitable for the estimation of real cell loss probability in heterogeneous and homogeneous traffic models when burst length is larger than buffer capacity. The concept of virtual cell loss probability is extended to the individual call level so as to be able to estimate the quality of service (QOS) provided to individual calls. A virtual bandwidth method is used to develop a practical call admission control system. Quality is ensured by combining a traffic clustering scheme, with a scheme for assigning individual clusters to subcapacities of a link. Priority levels are presented in terms of the class of QOS required, i.e., deterministic or statistical, and the allocation of virtual bandwidth is discussed in terms of both QOS class and traffic characteristics     

改善系统中断速率的一种新虚拟接收天线方案

在发射分集系统中,使用虚接收天线技术将时间分集转化为虚接收天线分集,以提高信道的秩,可以有效提高系统中断速率,这十分适用于某些需要能够在较低的中断概率下以一定的传输速率进行通信的系统。已有的研究是将同样的数据在两个时隙内重复发送以形成虚接收天线,而这使得传输效率下降了一半。为改善性能,提出了一种新的虚接收天线方案,不再简单地重复发送,而用一个时隙发送前两个时隙数据的和,从而提高传输效率。分析和仿真表明,新方案可以提供与重复发送方案相同的分集阶数,而且相对于重复发送方案,新方案可以更有效地提高系统中断速率,并且遍历容量也相应提高。     

一种新的基于单元扩大的拥挤度驱动的布局算法

描述了一种新的基于单元扩大的拥挤度驱动的布局算法 .这个方法用概率估计模型和星型模型来评价线网的走线 .使用全局优化和划分交替的算法来进行总体布局 .提出了单元的虚拟面积的概念 ,单元的虚拟面积不仅体现了单元的面积 ,而且指出了对布线资源的需求 .单元的虚拟面积可以由单元的扩大策略来得到 .把单元的虚拟面积用到划分过程中 ,从而减小拥挤度 .并且使用了单元移动的策略来进一步减小走线的拥挤 .用来自美国公司的一些例子测试了这个算法 ,结果显示布局的结果在可布性方面有了很大的提高     

Correlation parameter estimation for LDPC-based slepian-wolf coding

Currently, many practical SWC systems are implemented using the low-density parity-check (LDPC) codes in which the virtual correlation channel between source and side information is modeled as a binary symmetric channel (BSC) characterized by the crossover probability. This paper is contributed to the estimation of crossover probability through the probability mass function (PMF) of the magnitudes of loglikelihood ratio (LLR) messages. Simulation results are given to verify our proposed method.     

Probabilistic Forwarding Decision Scheme for Reliable Geocasting in Wireless Sensor Networks

Geocasting is an important communication service in wireless sensor networks. Most of the existing geocasting protocols assume that sensor nodes and the area of interest have accurate location information. However, this assumption is unreasonable if localization systems or schemes cannot work well. This study proposes an efficient probabilistic forwarding decision scheme for reliable geocasting in virtual coordinate-based wireless sensor networks. The proposed scheme uses directional code and hop distance to identify sensor node’s location. The sensor node determines a direction-based probability and a distance-based probability derived from its directional code and hop distance, respectively. The sensor node depends on the two probabilities to determine its ultimate forwarding probability. Simulation results confirm that the proposed scheme outperforms the pure direction-based forwarding scheme in packet delivery ratio though it occurs more packets. Results also show that the direction-based probability significantly dominates the geocasting performance.     

基于动态错误图的容错计算机系统可靠性分析(英文)

Dependability analysis is an important step in designing and analyzing safety computer systems and protection systems.Introducing multi-processor and virtual machine increases the system faults' complexity,diversity and dynamic,in particular for software-induced failures,with an impact on the overall dependability.Moreover,it is very different for safety system to operate successfully at any active phase,since there is a huge difference in failure rate between hardware-induced and softwareinduced failures.To handle these difficulties and achieve accurate dependability evaluation,consistently reflecting the construct it measures,a new formalism derived from dynamic fault graphs(DFG) is developed in this paper.DFG exploits the concept of system event as fault state sequences to represent dynamic behaviors,which allows us to execute probabilistic measures at each timestamp when change occurs.The approach automatically combines the reliability analysis with the system dynamics.In this paper,we describe how to use the proposed methodology drives to the overall system dependability analysis through the phases of modeling,structural discovery and probability analysis,which is also discussed using an example of a virtual computing system.