A fully distributed power control algorithm for cellular mobilesystems

Several distributed power control algorithms that can achieve carrier-to-interference ratio (CIR) balancing with probability one have been proposed previously for cellular mobile systems. In these algorithms, only local information is used to adjust transmitting power. However, a normalization procedure is required in each iteration to determine transmitting power and, thus, these algorithms are not fully distributed. In this paper, we present a distributed power control algorithm which does not need the normalization procedure. We show that the proposed algorithm can achieve CIR balancing with probability one. Moreover, numerical results reveal our proposed scheme performs better than the algorithm presented in Grandhi et al. [1994]. The excellent performance and the fully distributed property make our proposed algorithm a good choice for cellular mobile systems     

Learning algorithm for pattern classification using cellular neuralnetworks

A new learning algorithm for pattern classification using cellular neural networks is described. The authors show that patterns belonging to the training set as well as patterns outside it can be classified reliably using the proposed algorithm. Comparisons with well established classification techniques clearly highlight the performances of the approach developed herein     

An efficient fault-tolerant distributed channel allocation algorithm for cellular networks

A channel allocation algorithm in a cellular network consists of two parts: a channel acquisition algorithm and a channel selection algorithm. Some of the previous works in this field focused on centralized approaches to allocating channels. But, centralized approaches are neither scalable nor reliable. Recently, distributed dynamic channel allocation algorithms have been proposed, and they have gained a lot of attention due to their high reliability and scalability. But, in most of the algorithms, the cell that wants to borrow a channel has to wait for replies from all its interference neighbors and, hence, is not fault-tolerant. In this paper, we propose a new algorithm that is fault-tolerant and makes full use of the available channels. It can tolerate the failure of mobile nodes as well as static nodes without any significant degradation in service.     

超密集异构蜂窝网多维资源联合优化算法

作为5G的关键技术,超密集组网(UDN)可以大幅度提高网络容量和用户体验,但其性能严重受限于小区间干扰。针对超密集异构蜂窝网络的无线资源高效管理问题,提出了一种多维无线资源联合分配算法。为了在保障用户服务质量的前提下,最大化系统能效,将时频资源与功率资源的最优分配问题建模为有约束的组合优化问题。由于这是一个NP-hard问题,求解比较困难。因此,采用分步优化+迭代搜索策略：首先基于模拟退火算法进行时频资源优化分配,并引入粒子删减和回火升温过程以提高搜索速度和避免落入局部最优陷阱;然后采用拉格朗日乘子法进行功率最优分配;最后,通过多次迭代,逼近全局最优解。仿真结果表明,提出的联合资源分配算法能够保障用户间的公平性并且有效提高系统能效与网络吞吐量,同时具有更快的收敛速度和更高的收敛精确度。     

Deep reinforcement learning based resource allocation algorithm in cellular networks

In order to solve multi-objective optimization problem,a resource allocation algorithm based on deep reinforcement learning in cellular networks was proposed.Firstly,deep neural network (DNN) was built to optimize the transmission rate of cellular system and to complete the forward transmission process of the algorithm.Then,the Q-learning mechanism was utilized to construct the error function,which used energy efficiency as the rewards.The gradient descent method was used to train the weights of DNN,and the reverse training process of the algorithm was completed.The simulation results show that the proposed algorithm can determine optimization extent of optimal resource allocation scheme with rapid convergence ability,it is obviously superior to the other algorithms in terms of transmission rate and system energy consumption optimization.     

基于遗传算法的蜂窝网络接入信道动态分配方案的设计

蜂窝网络中,使用信道复用技术能够在很大程度上提高移动通信的容量和质量。但是,信道复用过程中会产生不同程度的电子干扰问题,使得信道复用的作用大打折扣。传统的进行信道优化的方法很多,但是效果都不是很理想。这里利用遗传算法进行蜂窝网络接入信道的动态分配,主要通过对集中常出现的信道干扰问题加上一些约束条件,这样建立的数学模型能够获得一最小干扰信号的信道分配方案,在很大程度上避免了移动用户之间的干扰问题。     

Performance of directed retry in nonuniform cellular environments

This paper investigates the effects of directed retry (DR) in cellular networks characterized by a nonuniform environment, that is, with unequal distribution of users and/or radio resources. We propose an analytical model able to take both propagation and network aspects into account. The nonuniform environment is modeled assuming the superposition on a uniform scenario of a circular area characterized by different offered load or radio capacity. The case of a hot spot of users is included. Path loss and lognormal shadowing have been considered. This is done through a statistical approach which is very general, and provides an expression for the probability of receiving a suitable power level from a given number of base stations within a fixed distance from the mobile. A comparison to simulation results is performed to validate the model. We show that the impact of DR on the blocking probability depends largely on the propagation parameters considered.     

Resource allocation for cellular radio systems

High terminal traffic densities are expected in urban multiuser radio systems. An efficient allocation of resources is the key to high system capacity. In this paper, a distributed dynamic resource allocation (DDRA) scheme based on local signal and interference measurements is proposed for multiuser radio networks. It offers “soft capacity” for time division multiple access (TDMA) and frequency division multiple access (FDMA) systems, bounded above by N per base station, where N is the total number of channels in the system. The decisions are made local to a terminal and its base and are essentially independent of the rest of the system. A distributed dynamic channel assignment scheme is used to assign channels to new calls. This scheme assigns a channel that offers the maximum carrier to interference ratio (CIR) to a new call. A distributed constrained power control (DCPC) scheme based on CIR measurements is used for power control. The channel assignment scheme and the power control scheme are coupled to obtain an interactive resource allocation scheme. We compare the capacity of a system which uses the distributed dynamic resource allocation scheme described above with the capacity of a system which uses the channel assignment scheme alone. The system capacity is measured by simulation as the number of terminals that can be served by the system with a CIR above an acceptable minimum. In a 1D cellular system, coupling the channel assignment scheme with power control is discussed. Simulations were also used to show the effect of varying the maximum transmitter power on system capacity     

Distributed fault-tolerant channel allocation for cellular networks

A channel allocation algorithm includes channel acquisition and channel selection algorithms. Most of the previous work concentrates on the channel selection algorithm since early channel acquisition algorithms are centralized and rely on a mobile switching center (MSC) to accomplish channel acquisition. Distributed channel acquisition algorithms have received considerable attention due to their high reliability and scalability. However, in these algorithms, a borrower needs to consult with its interference neighbors in order to borrow a channel. Thus, the borrower fails to borrow channels when it cannot communicate with any interference neighbor. In real-life networks, under heavy traffic load, a cell has a large probability to experience an intermittent network congestion or even a communication link failure. In existing distributed algorithms, since a cell has to consult with a large number of interference neighbors to borrow a channel, the failure rate will be much higher under heavy traffic load. Therefore, previous distributed channel allocation algorithms are not suitable for real-life networks. We first propose a fault-tolerant channel acquisition algorithm which tolerates communication link failures and node (MH or MSS) failures. Then, we present a channel selection algorithm and integrate it into the distributed acquisition algorithm. Detailed simulation experiments are carried out in order to evaluate our proposed methodology. Simulation results show that our algorithm significantly reduces the failure rate under network congestion, communication link failures, and node failures compared to nonfault-tolerant channel allocation algorithms. Moreover, our algorithm has low message overhead compared to known distributed channel allocation algorithms, and outperforms them in terms of failure rate under uniform as well as nonuniform traffic distribution     

蜂窝通信网络中的分布式无线信道分配方法

文中提出了一种适用于蜂窝通信网的分布式无线信道分配方法。当网络部署环境中出现干扰后,终端用户通过控制信道,发送反馈信息至基站;基站接收到反馈信息后,对可用信道进行扫频,利用广播帧通知受干扰的终端用户可用信道信息;然后终端用户收到基站发送的广播帧后,根据优先级机制,选择新的信道重新建立与基站的通信,当蜂窝通信网中终端用户受外部干扰而信道中断后,该方法可减少终端用户和基站之间信令的开销。     

EPON中一种动态带宽分配算法

以太无源光网络(EPON)被认为是下一代宽带接入的最有效的解决方案。文章提出了一种新的基于EOPN提供多种服务的动态带宽分配算法。为了能够应用这种算法还给出了协助带宽分配多点控制协议(MPCP)的控制消息的格式。     

Dynamic resource allocation in mobile heterogeneous cellular networks

User mobility is a challenging issue in macro and femto cellular networks for the fifth-generation and newer mobile communications due to the time-varying interference and topology experienced. In this paper, we consider an OFDMA-based two-tier network with one macro cell and several femto cells, wherein each macro user and/or femto user can leave or enter its serving cell frequently, referred to as user mobility. A resource allocation problem with different rate requirements of mobile users is then formulated. Assuming well knowledge of the user locations and the channel state information, we propose a dynamic algorithm with static and dynamic parts for a better trade-of between computational complexity and system throughput. The static algorithm, named interference weighted cluster algorithm in this paper, is based on the graph theory to cluster the femtocells by minimizing the interference between clusters, while the dynamic algorithm is to deal with the user mobility by sharing the resource blocks under the constraints of rate requirements. Numerical results are demonstrated to show the effectiveness of the proposed dynamic resource allocation algorithm in terms of capacity, computational time, and outage probability.

     

An efficient algorithm for sensitivity analysis of nonuniform transmission lines

This paper presents a new algorithm that addresses an important issue arising in computation of sensitivity for nonuniform transmission lines using the idea of model reduction through integrated congruence transform. This issue is related extending the concept of implicit basis construction, which was introduced earlier to simulate nonuniform transmission lines, to the task of sensitivity analysis. A new algorithm is presented to compute the orthogonal basis needed to obtain the reduced system used in sensitivity analysis. The proposed algorithm incorporates a new orthogonalization procedure which can be used to find an orthogonal basis for a set of moments derived from inhomogeneous differential equations, but without having to compute those moments explicitly. Numerical results demonstrate that reduced-order systems constructed by the proposed algorithm have improved numerical accuracy in sensitivity computation.     

基于并行分配算法的认知无线电频谱分配算法

针对传统频谱分配方式不合理造成频谱匮乏以及CSGC算法在频谱分配上消耗时间过长影响实时通信的问题,文中提出了一种基于并行分配算法的认知无线电频谱分配算法,其通过同时给各顶点进行上色,从而节省了时间开销。实验证明,并行算法不仅具有与CSGC算法同样的高频谱利用率,且其频谱分配时间开销更低,是一种理想的认知无线电频谱分配算法。     

Function-based compact test pattern generation for path delay faults

We present a function-based nonenumerative automatic test pattern generation (ATPG) methodology for detecting path delay faults (PDFs). The proposed technique consists of a number of topological circuit traversals during each a linear number of Boolean functions is generated per circuit line. From each such function we derive a test that detects many PDFs. The two major strengths of the approach, that stem from the function-based formulations used, are very compact test sets, and scalability in test efficiency. The performance of an implementation based on binary decision diagrams is evaluated and compared with existing compact methods to demonstrate the superiority of the proposed method.     

简单无向图的压缩存储及格式转换算法

对于图的同构判定问题、Ramsey理论、计算Folkman数等图论的研究方向,研究人员通常需要用计算机程序生成并处理大量的简单无向图.为了节省内存和外存空间、提高程序运行速度,应该对图进行压缩存储.文中对目前研究中广泛采用的简单无向图graph6存储格式进行了介绍,并给出了将图的邻接表存储格式转换为graph6存储格式的程序片段.     

改进遗传算法在线阵波束方向图中的应用

通过对传统遗传算法应用在线阵波束方向图中进行分析,从编码方式、变异策略以及选择机制上提出了新的改进策略。改进后的算法减少了编码长度,增加了变异灵活性,更好的保持了种群中个体的多样性,加快了搜索和运算速度和收敛性能。对线阵波束方向图的零陷点生成和旁瓣抑制进行仿真,仿真结果表明改进算法与传统算法相比能明显减少遗传代数,能够更快地找到满意解。     

Dynamic bandwidth allocation algorithm utilizing full band

A kind of Dynamic Full Bandwidth Utilized （DFBU） allocation algorithm is introduced. This algorithm allows a single link to use bandwidth far beyond its fair share bandwidth in a multi-service packet transporting system. Three important parameters as the bound on maximum and minimum bandwidth, the maximum packet delay and the minimum band width utilization are discussed and analyzed. Results of experiments show that the DFBU-algorithm is capable of making a single link in the system to use all the spare bandwidth （up to full-bandwidth） while the performance of fairness and QoS requirement is still guaranteed.