蜂窝移动通信中一种分级紧致的动态信道分配方案

本文提出一种分级紧致的动态信道分配（CCDCA）方案。文中首先根据信道使用情况与业务量的关系，将小区分成“冷态”和“热态”，并给出了相应的阈值，然后在对“热态”的处理过程中利用“冷态”的先验信息，对不同状态的小区给出了不同的紧致措施。该方案还能保证小区间有较小的服务偏差，提高了整个系统的服务质量。文中还根据冷、热态的特点构造了一个二维马尔科夫链模型，计算出了模型的主要参数；其思想可用于分析多种信道分配问题。仿真结果证明CCDCA方案有较小的呼阻率和较高的频谱利用率。     

基于分布式天线无线通信系统的信道选择策略

分布式天线系统是不同于传统蜂窝系统的一种崭新的系统,其信道分配问题是整个系统发挥优势的关键之一。所考察的信道选择策略就是基于该系统,考虑选择四根天线的情况,用CDMA多址方式,采用动态信道分配方案对信道资源进行分配,描述了DWCS系统的信道分配过程和信道选择策略,并且对于随机、最大SIR和最小SIR等方案进行仿真分析。在小业务下,最小SIR由于使得信道分配达到最大紧致,充分利用资源,阻塞率最低,在大业务下,随机和最大SIR性能更好些。同时也给出了不同的SIR门限时的系统阻塞率。     

IDMA系统中基于序列叠加信道估计的功率分配方法

本文在序列叠加信道估计研究的基础上,以交织多址接入系统为模型,利用导频训练序列与信息序列不相关的特性在接收端估计出信道状态信息,并采用最大化有效信噪比的方法给出了训练序列与信息序列的最优功率分配策略.此外,本文讨论了不同统计特性的训练序列对信道估计性能的影响以及估计误差对信道容量的影响,通过仿真研究验证了相关的理论分析,并说明了本文功率分配算法较其它分配策略更有利于提高系统性能.     

TD-SCDMA系统中的动态信道分配

该文主要介绍了TD-SCDMA系统中的动态信道分配技术(DCA),从TD-SCDMA的系统特性入手分别讨论了对小区的信道分配(慢速DCA)和对业务的信道分配(快速DCA),分析了各部分所要完成的功能和可以采取的策略,最后给出了动态信道分配方案优劣的评价指标。     

模块化分类紧致的信道分配方案及性能分析

本文给出了一种模块化分类紧致的信道分配方案.该方案既可象固定信道分配那样达到同道复用距离,又能如动态分配那样随业务量的变化而自适应地变化.文中还给出了一种基于三维马尔科夫链的分析模型,仿真结果表明该模型十分接近实际系统,为研究和评价系统的性能提供了一有效的方法.     

分布式阵列系统中反馈比特的分配方法

在采用频分双工的通信系统中,基站通常需要用户反馈信道状态信息以进行预编码。对于分布式阵列系统,由于多个接入节点布置在小区的不同位置,用户与小区内不同接入节点之间的信道条件不同。当用于反馈信道状态信息的资源受限时,需要对反馈比特的分配方法进行优化,从而提高系统的整体性能。在多用户分布式阵列系统中,采用基于距离阈值的接入节点选择方法,并在此基础上结合随机矢量量化码本的量化特性以及泰勒展开法,对系统量化容量损失进行推导,并给出了近似表达式。基于该表达式,提出了反馈比特分配方法,与其他的分配方法相比,不限制用户选择的接入节点数目使本文的方法更加具有普遍性。仿真结果显示,在反馈资源有限的情况下,提出的策略优于传统的等比特分配方案,可以获得较好的性能。     

用于慢速动态信道分配的热点小区簇衍生算法

针对TD-SCDMA系统现有慢速动态信道分配算法的不足,提出了一种热点小区簇衍生算法.该算法通过热点小区不断衍生的方式形成多小区系统模型,解决了热点小区簇的判别和扩展问题,提高了系统容量.仿真结果表明:热点小区簇衍生算法适用于不同的业务分布模型,相对于热点小区算法,系统资源利用率提高了3.8%.     

有限用户数多认知网络部分信道共享性能分析

认知网络中动态信道共享是提高频谱资源利用率的关键.针对有限用户数下多认知网络共存场景,该文建立3维马尔科夫链部分信道共享模型,仿真分析用户有/无信道切换功能下认知网络间部分信道共享的性能.分别就阻塞概率、强迫终止概率、切换概率和系统吞吐量等,与静态频谱分配策略和分级共享策略进行比较仿真测试,结果表明,采用部分信道共享策略的系统在容忍较小的切换概率和强迫终止概率下可以获得较大的系统吞吐量.     

蜂窝移动通信系统中一种热点业务分配算法

基于提出的最优组合业务量预测模型,对下一时刻的业务量进行预测,从而确定蜂窝系统中业务分布情况,据此将蜂窝小区分成冷点区域和热点区域,并提出一种优化的混合信道分配(OHCA)方案,分析并给出了该方案中动静信道比的定量关系。仿真结果证实了该最优组合预测模型较单一预测方法降低了预测误差、提高了预测精度,同时该优化分配算法较固定信道分配(FCA)和动态信道分配(DCA)方案,有较小的呼阻率和较高的频谱利用率,该策略可用来有效处理热点业务问题,有较好的应用前景。     

基于博弈论的OFDMA系统多小区功率协调分配算法

提出了一种用于正交频分多址(OFDMA)通信系统下行链路的多小区功率协调分配算法,协调相邻小区在同频子信道上的发送功率,抑制小区间干扰,提高信道容量.将博弈论引入到多小区功率分配中,给出基于定价的多小区非合作功率分配博弈模型,并分析了该博弈的纳什均衡解的存在性和惟一性,给出了该模型的分布式求解算法.通过仿真分别给出了单小区场景与多小区场景下算法性能,讨论了定价因子对系统性能的影响.仿真结果表明,提出的多小区功率协调分配算法可以充分利用无线资源,提高系统吞吐量,降低平均发送功率.     

A dynamic load balancing strategy for channel assignment using selective borrowing in cellular mobile environment

We propose a dynamic load balancing scheme for the channel assignment problem in a cellular mobile environment. As an underlying approach, we start with a fixed assignment scheme where each cell is initially allocated a set of channels, each to be assigned on demand to a user in the cell. A cell is classified as 'hot', if the degree of coldness of a cell (defined as the ratio of the number of available channels to the total number of channels for that cell), is less than or equal to some threshold value. Otherwise the cell is 'cold'. Our load balancing scheme proposes to migrate unused channels from underloaded cells to an overloaded one. This is achieved through borrowing a fixed number of channels from cold cells to a hot one according to a channel borrowing algorithm. A channel assignment strategy is also proposed based on dividing the users in a cell into three broad types – 'new', 'departing', 'others' – and forming different priority classes of channel demands from these three types of users. Assignment of the local and borrowed channels are performed according to the priority classes. Next, a Markov model for an individual cell is developed, where the state is determined by the number of occupied channels in the cell. The probability for a cell being hot and the call blocking probability in a hot cell are derived, and a method to estimate the value of the threshold is also given. Detailed simulation experiments are carried out in order to evaluate our proposed methodology. The performance of our load balancing scheme is compared with the fixed channel assignment, simple borrowing, and two existing strategies with load balancing (e.g., directed retry and CBWL), and a significant improvement of the system behavior is noted in all cases. This revised version was published online in June 2006 with corrections to the Cover Date.     

A compact dynamic channel assignment scheme based on Hopfield networks for cellular radio systems

In this paper, a new channel assignment strategy named compact dynamic channel assignment (CDCA) is proposed. The CDCA differs from other strategies by consistently keeping the system in the utmost optimal state, and thus the scheme allows to determine a call succeeding or failing by local information instead of that of the whole network. It employs Hopfield neural networks for optimization which avoids the complicated assessment of channel compactness and guarantees optimum solutions for every assignment. A scheme based on Hopfield neural network is considered before; however, unlike others, in this algorithm an energy function is derived in such a way that for a neuron, the more a channel is currently being allocated in other cells, the more excitation the neuron will acquire, so as to guarantee each cluster using channels as few as possible. Performance measures in terms of the blocking probability, convergence rate and convergence time are obtained to assess the viability of the proposed scheme. Results presented show that the approach significantly reduces stringent requirements of searching space and convergence time. The algorithm is simple and straightforward, hence the efficient algorithm makes the real‐time implementation of channel assignment based on neural network feasibility. Copyright © 2008 John Wiley & Sons, Ltd.     

蜂窝移动通信系统中基于紧凑模式的信道借用指配策略

本文介绍了蜂窝移动通信系统中一种新的动态信道指配策略——基于紧凑模式的信道借用指配策略(CPCB).这种策略不仅具有基于紧凑模式的动态信道指配的优点,而且具有固定信道指配策略中信道借用的优点.作者将新算法在一种普遍采用的49个蜂窝的蜂窝通信网络上进行了仿真,分别对几种均匀和非均匀模式的业务分布情况进行了比较,结果表明:CPCB的系统平均阻塞率低于FCA、BDCL、基于CP的DCA和CPMCB等,而且随着负载的增加,其系统平均阻塞率的增长速率也明显低于上述各种策略.     

蜂窝移动通信系统中基于紧凑模式的通信借助用指配策略

本文介绍了蜂窝移动通信系统中一种新的动态信道指配策略──基于紧凑模式的信道借用指配策略（ＣＰＣＢ）．这种策略不仅具有基于紧凑模式的动态信道指配的优点,而且具有固定信道指配策略中信道借用的优点．作者将新算法在一种普遍采用的４９个蜂窝的蜂窝通信网络上进行了仿真,分别对几种均匀和非均匀模式的业务分布情况进行了比较,结果表明：ＣＰＣＢ的系统平均阻塞率低于ＦＣＡ、ＢＤＣＬ、基于ＣＰ的ＤＣＡ和ＣＰＭＣＢ等,而且随着负载的增加,其系统平均阻塞率的增长速率也明显低于上述各种策略．     

A novel load balancing scheme for the tele-traffic hot spot problem in cellular networks

We propose a dynamic load balancing scheme for the tele-traffic hot spot problem in cellular networks. A tele-traffic hot spot is a region of adjacent hot cells where the channel demand has exceeded a certain threshold. A hot spot is depicted as a stack of hexagonal ‘Rings’ of cells and is classified as complete if all cells within it are hot. Otherwise it is termed incomplete. The rings containing all cold cells outside the hot spot are called ‘Peripheral Rings’. Our load balancing scheme migrates channels through a structured borrowing mechanism from the cold cells within the ‘Rings’ or ‘Peripheral Rings’ to the hot cells constituting the hot spot. A hot cell in ‘Ring i’ can only borrow a certain fixed number of channels from adjacent cells in ‘Ring i+1’. We first propose a load balancing algorithm for a complete hot spot, which is then extended to the more general case of an incomplete hot spot. In the latter case, by further classifying a cell as cold safe, cold semi-safe or cold unsafe, a demand graph is constructed which describes the channel demand of each cell within the hot spot or its ‘Peripheral Rings’ from its adjacent cells in the next outer ring. The channel borrowing algorithm works on the demand graph in a bottom up fashion, satisfying the demands of the cells in each subsequent inner ring until ‘Ring 0’ is reached. A Markov chain model is first developed for a cell within a hot spot, the results of which are used to develop a similar model which captures the evolution of the entire hot spot region. Detailed simulation experiments are conducted to evaluate the performance of our load balancing scheme. Comparison with another well known load balancing strategy, known as CBWL, shows that under moderate and heavy tele-traffic conditions, a performance improvement as high as 12% in terms of call blockade is acheived by our load balancing scheme. This revised version was published online in June 2006 with corrections to the Cover Date.     

Capacity optimizing channel allocation schemes for multi‐service cellular systems with mobile users

In this paper, we study the blocking and dropping probability of mobile users in the multi‐service cellular systems with mobile users. Based on the idea that different services may require different signal‐to‐interference ratios and different reuse factors, we proposed a channel allocation scheme called channel partitioning to support different services using different reuse factors. Under channel partitioning scheme, the channels in each cell are divided into two or more sets of channels and each set of the channels supports certain service, depending on the required reuse factor of the service. We first apply this channel partitioning with fixed channel allocation scheme called fixed channel partitioning (FCP), where a three‐dimensional Markov chain is developed to analyze the impact of the mobile user. After that a simpler model, which can estimate the numeric result from the closed‐form solution, is presented to make the analysis easier. In order to cater for the traffic variation between services and between cells, a dynamic channel partitioning with flexible channel combination scheme, called FDCP, is proposed to support multiple services. This FDCP tries to minimize the effect of assigned channels on the availability of channels for use in the interfering cells. The analysis and the simulation results show that for equal arrival rate of two services, the proposed FCP and FDCP scheme can provide about 32% and 54% improvement, respectively, in terms of grade of service as compared with conventional FCA scheme using a single reuse factor to support two services for the mobile users. Copyright © 2006 John Wiley & Sons, Ltd.     

Multicode multirate compact assignment of OVSF codes for QoS differentiated terminals

Orthogonal variable spreading factor (OVSF) codes are used in both universal terrestrial radio access-frequency division duplex (UTRA-FDD) and time division duplex (UTRA-TDD) of the third-generation (3G) mobile communication systems. They can support multirate transmissions for mobile terminals with multicode transmission capabilities. In this paper, a new OVSF code assignment scheme, namely "multicode multirate compact assignment" (MMCA), is proposed and analyzed. The design of MMCA is based on the concept of "compact index" and takes into consideration mobile terminals with different multicode transmission capabilities and different quality of service (QoS) requirements. Priority differentiation between multirate realtime traffic and best-effort data traffic is also supported in MMCA. Analytical and simulation results show that MMCA is efficient and fair.     

Channel carrying: a novel handoff scheme for mobile cellularnetworks

We present a new scheme that addresses the call handoff problem in mobile cellular networks. Efficiently solving the handoff problem is important for guaranteeing quality of service to already admitted calls in the network. Our scheme is based on a new approach called channel carrying: when a mobile user moves from one cell to another, render certain mobility conditions, the user is allowed to carry its current channel into the new cell. We propose a new channel assignment scheme to ensure that this movement of channels will not lead to any extra co-channel interference or channel locking. In our scheme, the mobility of channels relies entirely on localized information, and no global coordination is required. Therefore, the scheme is simple and easy to implement. We further develop a hybrid channel carrying scheme that allows us to maximize performance under various constraints     

Robust adaptive multi-service transmission with hierarchical modulation for OFDM systems in high mobility scenarios

Wireless communications play a key role in intelligent transportation systems for bearing multiple application services with different quality of service (QoS) requirements. Hierarchical modulation (HM) is an effective technique to increase the spectral efficiency (SE) of differentiated services multiplexing transmissions. In high mobility scenario, due to the impact of the feedback delay and channel estimation error, only the imperfect channel state information is available at the transmitter. Thus, the performance of the existing HM schemes degrades severely. In this paper, we propose a robust adaptive HM scheme to increase the overall SE in the mobile orthogonal frequency division multiplexing system. The bit error rate of the HM symbol is derived for the reliable QoS-aware multi-service transmission, and the strategies of bit assignment and modulation parameters selection for different services are designed. Finally, comparing with the traditional uniform modulation scheme, the proposed robust adaptive HM scheme increases the overall SE of multiplexing transmissions by \(15\%\) at \(300\,\hbox { km}/\hbox {h}\).     

Virtually fixed channel assignment in cellular mobile networks with recall and handoffs

A promising approach for implementing channel assignment and control in cellular mobile telephone networks is the virtually fixed channel assignment (VFCA) scheme. In VFCA channels are allocated to cells according to the fixed channel assignment (FCA) scheme, but cells are allowed to borrow channels from one another. As such, VFCA maintains the efficiency of FCA, but adds the flexibility lacking in FCA. One feature of a VFCA network is that, to prevent co-channel interference, it requires several channels to be locked to serve a single call that borrows a channel. This feature raises the concern that VFCA may lead to chain reaction in channel borrowing among cells and cause the network performance to degrade, especially under heavy traffic conditions. In this paper, we propose the virtually fixed channel assignment with recall (VFCAWR) scheme: The network is implemented according to VFCA, but a cell can recall a locked channel to service an arriving handoff call, which occurs when a mobile unit crosses the boundary of its cell. We model the network as a three-dimensional Markov chain and derive its steady-state performance. Through modification of this basic model, we evaluate two dynamic channel assignment strategies, the virtual channel reservation (VCR) strategy and the linear switch-over (LSO) strategy, which exploit the unique borrowing/recall capability of VFCAWR to reduce the weighted cost of blocking fresh and handoff calls by reserving several virtual channels (the channels that may be borrowed from adjacent cells when necessary) for handoff calls. We validate the analytical models by simulation; the simulation test cases show that our models accurately predict the system performance measures of interest. Numerical and simulation results also show that both dynamic strategies outperform conventional channel reservation schemes based on fixed channel assignment and hybrid channel assignment. This revised version was published online in June 2006 with corrections to the Cover Date.