Cellular Channel Assignment: A New Localized and Distributed Strategy

As the use of mobile communications systems grows, the need arises for new and more efficient channel allocation techniques. The total number of available channels on a real-world network is in fact a scarce resource, and many assignment heuristics suffer from a clear lack of flexibility (this is the case of Fixed Channel Allocation), or from high computational and communication complexity (as with channel borrowing techniques). Performance can be improved by representing the system with an objective function whose minimum is associated with a good configuration; the various constraints appear as penalty terms in the function. The problem is thus reduced to the search for a minimum, that is often performed via heuristic algorithms like Hopfield neural networks, simulated annealing or reinforcement learning. These strategies usually require a central process to have global information and decide for all cells. We consider an objective-function formulation of the channel assignment problem that has been previously solved by search heuristics; we prove that the search time for the global minimum of the objective function is O(nlogn), and therefore there is no need for search techniques. Finally we show that the algorithm that arises from this formulation can be modified so that global knowledge and synchronization are no longer required, and we give its distributed version. By simulating a cellular network with mobile hosts on a hexagonal cell pattern with uniform call distribution, we show that our technique actually performs better than the best known algorithms.     

Space Partitioning Hybrid Channel Assignment Scheme for Cellular Networks

The conventional approach of hybrid channel assignment strategy in cellular networks is rather inefficient due to the fact that it does not take advantage of the FCA scheme to the extreme. In this paper, we divide a cell into two parts: inner cell region and outer cell region, and apply the dynamic channel assignment and the fixed channel assignment schemes to the inner region and out region, respectively, in an attempt to fully utilize the strengths of the channel assignment schemes. In the performance evaluation, we demonstrate that the channel reuse efficiency has been improved compared to the FCA and DCA schemes. We also calculate the probability of an intracell handoff due to the use of the space partitioning. The proposed scheme can be adapted to a multi-tier structure with high/low speed mobile users, and hot spots.     

基于反向链路状态的动态优化信道分配

本文提出了一种基于反向链路载干比的信道分配优化模型.这种模型较原有的兼容矩阵模型更接近实际系统,并且能够应用于分析干扰自适应信道分配方案.本文在提出这种模型的同时,对比了该模型和原有模型在描述信道分配问题的精度和能力上的优劣.此外,本文还提出了使用改进遗传算法求解该模型下信道分配问题的方法.分析和实验均说明本文提出的模型对实际环境进行了更精确的描述,通过使用这种模型求解信道分配问题能够更好利用信道资源.     

Dynamic Flow Model for Borrowing Channel Assignment Scheme in Cellular Mobile System

A mathematical model that predicts the dynamic flows in cellular mobile networks that allocate channels using the Borrowing Channel Assignment (BCA) scheme is described in this paper. Two types of handoff procedures – the prioritized and non-prioritized schemes – will be considered in the model. Discrete event simulations were performed and the results were found to be comparable to the results obtained using the mathematical model. Application to comparative study of the dynamic behaviours of the BCA and the Fixed Channel Assignment (FCA) schemes is also presented.     

两跳蜂窝移动系统中继信道分配策略

在频率复用因子为1的两跳固定中继节点的蜂窝移动通信系统中,基于现实移动业务分布的时变性和非均匀性,提出了新的中继信道分配策略。与传统的中继信道分配策略相比,该策略不需要BS之间的协作,也能严格控制相邻小区之间同频RS的干扰距离,降低同信道干扰,在较低的系统复杂度下,实现了无线资源的有效利用。     

基于遗传算法的频率分配问题研究

针对频率数受限情况,提出了一种基于遗传算法的改进频率分配算法.通过设计新的编码策略,算法保证了初始频率分配方案中同一小区内的频率之间相互不存在干扰.为了和新的编码策略相适应,在变异操作中引入了特殊的变异方法.针对42小区GSM系统频率分配实验表明,在可用频率数受限的条件下,该算法能够使最终不满足约束条件的频率数降到最少.给出了就如何设置遗传算法各个运行参数的建议.     

蜂窝移动通信系统中的一种新的优化信道分配模型

本文提出了一种新的蜂窝移动通信系统最优信道分配模型.首先根据信道分配的特点构造了一种信道分配方程模型;进而建立了信道分配最优模型,利用Pontryain最小值原理获得了模型的最优解;给出的仿真结果验证了分析结论的正确性.该模型可以用来有效地研究信道分配问题的宏观性能,并提供了一种高效、快速的算法.     

A Graph Theoretic Approach for Channel Assignment in Cellular Networks

We define a cellular assignment graph to model the channel assignment problem in a cellular network where overlapping cell segments are included in the model. Our main result is the Capacity-Demand Theorem which shows a channel assignment function is always possible unless there is a connected subregion of cells and overlap segments containing more channel requests then the total capacity of all transceivers within or on the boundary of the subregion and covering any part of the subregion with an overlapping segment. We further describe the simplicity and regularity of our proposed cellular assignment graphs and their accessibility for simulation and theoretical investigation without artifacts from the overall geographical region boundaries.     

基于拓扑分割的无线Mesh网络信道分配策略

该文根据无线Mesh网络流量呈现树状拓扑汇聚的特点提出基于拓扑分割的信道分配策略。依据无线干扰对不同链路的影响程度,把无线干扰分类为有确定方向的纵向干扰和横向干扰;提出沿着纵向干扰方向逐跳分割网络拓扑算法;提出最少信道隔离纵向干扰和为吞吐量最小的子拓扑增加信道的子拓扑间信道分配策略;提出横向干扰分块的子拓扑内信道使用方法;理论分析子拓扑内的冲突域及网络性能瓶颈,仿真研究子拓扑的吞吐性能及信道分配顺序。仿真结果表明,隔离纵向干扰和增加信道的分配策略能够有效保证和提升网络吞吐量,横向干扰分块的方法优于802.11s中定义的公共信道框架多信道机制。     

无线mesh网络中的信道分配问题研究

在多接口无线mesh网络中使用多信道可以减少碰撞和干扰,提高系统吞吐量。因此,合理的信道分配是无线mesh网络中多信道技术的关键。用图论理论建立信道分配数学模型以及用图着色理论研究信道分配问题是无线网络中解决信道分配问题的有效方法。因此针对无线mesh网络中多接口多信道(multi-radio and multi-channel)的特点,重点介绍了无线mesh网络中信道分配的基本理论、主要约束和图论模型等,最后提出应用图着色理论解决信道分配问题的一般途径。     

一种新的优化动态信道分配策略及建模分析

本文提出一种新的动态信道分配策略,称之为分级紧致的动态信道分配(CCDCA),所谓分级就是基于引入的"冷态"和"热态"的概念,将小区所处的状态分为冷态与热态;所谓紧致就是对处于不同状态的小区给出不同的紧致模型.该策略在对"热态"的处理过程中利用了"冷态"的先验信息,有机地结合了局部信息与整体信息,同时能保证小区间有较小的服务偏差,提高了整个系统的服务质量.文中还从理论上给出了冷、热态阈值的分析模型,计算出了模型的主要参数,该模型也可以用来分析系统性能.仿真结果证明该方案有较小的呼阻率和较高的频谱利用率,所提出的模型比较接近实际系统.     

基于改进混合遗传算法的信道分配研究

用遗传与模拟退火相结合的混合算法对信道分配问题进行研究,并通过加入"寻优式爬山"与大规模基因突变两种优化方法对混合算法进行改进,克服了一般遗传算法收敛速度慢以及易于陷入局部最优解的缺点。给出了算法的实现流程,并针对几个典型信道分配问题对一般遗传算法、遗传与退火混合算法、改进后的混合算法进行仿真。仿真结果证明改进算法较其他2种算法至少节省80%的时间,并具有更好的稳定性,是解决信道分配问题的一种很好的算法。     

Performance of Fixed Channel Assignment for Uplink Transmission and Direct Peer-to-Peer Communications in Multihop Cellular Networks

In this paper, we propose a clustered multihop cellular network （cMCN） architecture and study its performance using fixed channel assignment （FCA） scheme for uplink transmission. The proposed cMCN using FCA can be applied with some reuse factors. An analytical model based on Markov chain is developed to analyze its performance and validated through computer simulation. And then, we implement direct peer-to-peer communication （DC） in cMCN by considering more reasonable conditions in practice. DC means that two calls communicate directly instead of going through base stations. The results show that cMCN with FCA can reduce the call blocking probability significantly as compared with the traditional single-hop cellular networks with FCA and can be further reduced by using DC.     

一种启发式的信道分配优化方法

在对信道分配问题分析的基础上,给出数学模型,将此问题转化为带约束的优化问题,并通过设计遗传算法的个体编码方式,适应度函数、遗传算子实现了移动通信中的信道分配问题的优化。     

Dynamic Channel Assignment with Flexible Reuse Partitioning in Cellular Systems

In cellular communications, one of the main research issues is how to achieve optimum system capacity with limited frequency spectrum. For many years, researchers have proposed and studied many dynamic channel assignment (DCA) schemes to increase the capacity of cellular systems. Another proposed technique, Reuse Partitioning (RP), is used to achieve higher capacity by reducing the overall reuse distance. In convention, when RP is exploited in network-based DCA, a portion of channels will be assigned permanently to each partitioned region. However, the number of channels assigned to each region may not be~optimum due to factors like the uneven and time-varying traffics. In this paper, a new network-based DCA scheme is proposed with the flexible use of RP technique, named as flexible dynamic reuse partitioning with interference information (FDRP-WI). In this scheme, channels are open to all incoming calls and no channel pre-allocation for each region is required. As long as the channel assignment satisfies the co-channel interference constraints, any user from any region can use any channel. The scheme aims to minimize the effect of assigned channels on the availability of channels for use in the interfering cells and to reduce overall reuse distance. Both FDRP-WI with stationary users and mobile users are investigated. Simulation results have confirmed the effectiveness of FDRP-WI scheme. In the case with stationary users, FDRP-WI exhibits outstanding performance in improving the system capacity under both uniform and non-uniform traffic distributions. Under the uniform traffic case, the scheme can provide over 100% capacity improvement as compared to conventional fixed channel assignment scheme with 70 system channels at 1% blocking probability. In the case with mobile users, the impact of mobility on the new call probability, P _b, and the call dropping probability, P _d, is evaluated. The effect on system capacity of reserving some channels for handoff calls is first studied. Then, we propose a new handoff scheme, called “Reverse Overflow” (RO), to improve the utilization of channels with smaller reuse distances under mobile environment. Simulation results show that, with RO handoff, the system capacity of FDRP-WI is effectively improved at the expense of higher handoff rates in the cellular system.     

天然粗糙面杂波中雷达目标的检测

本文引入时变分形曲面描述天然粗糙面的局部动态特征,给出三个合理电磁散射假设,采用基尔霍夫解定性分析散射的时域分形特性,导出天然粗糙面杂波的分形模型.根据随机分形信号小波系数近似不相关的特性,提出小波白化滤波—相关检测法,并详细论述了该方法的相关理论.理论分析和实验表明,天然粗糙面杂波符合分形模型,文中所提出的方法可以有效地实现杂波中雷达目标的检测.     

基于混沌神经网络的移动通信信道分配方法研究

该文应用混沌神经网络求解信道分配问题,给出了信道分配的能量函数表达式和混沌神经网络模型,研究了判别混沌神经网络混沌特性的Lyapunov指数法,讨论了网络模型参数对网络混沌特性的影响,提出了基于混沌神经网络的信道分配算法.仿真结果表明,混沌神经网络具有复杂的瞬态混沌特性,它比Hopfield网络具有更强的搜索全局最优解的能力,和更快的收敛速度.     

Formulation and Computationally Efficient Algorithms for an Interference-Oriented Version of the Frequency Assignment Problem

The frequency assignment problem will maintain its importance for several years, since future versions of legacy cellular systems, e.g., those of GSM, will continue to exist. This paper elaborates on an interference-oriented version of the frequency assignment problem. The objective function is associated with the interference levels that are imposed by the frequency allocation, while the constraints are related to the allocation of the frequencies required in each cell and the prevention of some unacceptable interference situations. The problem is formally stated, mathematically formulated and solved by means of computationally efficient heuristics. Finally, results are obtained and concluding remarks are made.     

一种新的矢量量化索引值分配算法

借鉴于生物免疫系统强大的防御能力,本文提出了一种免疫克隆(MCIAA)算法.该算法能更好地在群体的收敛性和个体的多样性之间保持动态平衡,有效地克服了局部收敛和早期收敛问题.将该算法应用于噪声信道矢量量化索引值分配寻优中,在存在信道噪声时,可较好地提高矢量量化器的性能.模拟试验表明该算法比其他算法有更好的增益和收敛速度.     

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

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