Channel assignment in cellular radio networks

The authors investigate algorithms based on simulated annealing to solve the channel assignment problem for cellular radio networks. The blocking probability of a network is chosen as the optimization criterion. In order to check the quality of the solutions obtained by simulated annealing, they examine some special types of networks which allow an effective calculation of optimal solutions by tailored algorithms. Their investigations show that simulated annealing is a very powerful tool for solving channel assignment problems     

Channel assignment through evolutionary optimization

The problem of assigning appropriate channels to the individual members of a cellular network is an important challenge facing network designers. Heuristics may be used to solve this problem, although in recent years parallel distributed methods have also been suggested. We investigate how an evolutionary inspired computing technique known as genetic algorithms (GAs) may be used. These global optimization techniques avoid many of the shortcomings exhibited by local search techniques on difficult search spaces. The new approach is tested on several problems of different sizes and complexity. The critical aspects of this technique and additional improvements are also discussed     

Hybrid blind interference alignment in homogeneous cellular networks with limited coherence time

The work presented in this paper is inspired by the user grouping approach of topological blind interference alignment (top‐BIA), which is a semi‐blind IA scheme and the fact that the partially connected networks can be advantageous in terms of degree of freedom (DoF) and sum rate. The hybrid‐BIA scheme proposed in the paper uses top‐BIA to group users that are randomly distributed in a dense small‐cell network and aims to reduce the supersymbol length and overcome the DoF loss of the state‐of‐the‐art hierarchical BIA (h‐BIA) technique. The proposed scheme is very suitable for channels where coherence time is limited and also could attain a good DoF over a small number of symbol extensions. Both the sum‐DoF and the network throughput for hybrid‐BIA is greater than that of h‐BIA. By varying the number of user groups, the paper shows that h‐BIA constitutes a special case of hybrid‐BIA. Finally, the paper demonstrates the effect of changing the number of transmit antennas and number of small cells on the sum‐DoF gain of hybrid‐BIA over that of h‐BIA.     

Channel assignment and layer selection in hierarchical cellularsystem with fuzzy control

We consider a hierarchical cellular system, which consists of a macrolayer and a microlayer. The macrocells accommodate fast mobile users. However, if we direct too many mobile users to the macrocells, the system capacity is low. On the other hand, the microcells are designed to increase capacity, but they cause a large number of handoffs. The aim is to maximize the system capacity while keeping the amount of handoff small. We minimize the handoff rate by a fuzzy layer selection algorithm, which makes use of the past cell dwell times of a user and the channel occupancy of the target cell. To maximize the capacity, we propose a distributed channel assignment algorithm to dynamically allocate the channels among the two layers. Exchange of information is allowed between neighboring macrocells. The state of channel assignment in a macrocell and its interfering cells are tabulated in a channel allocation table, which provides all information required in the integrated resource allocation scheme. The performance is evaluated by simulation and compared with the popular layer selection scheme known as the threshold method     

Soft eigenvalue assignment with limited disturbance feedforward and state controller norm

The method of softly assigning eigenvalues is attractive for design problems where constraining the control effort and disturbance feedforward is more important than following the exact pole location.     

Channel assignment in cellular radio using genetic algorithms

The channel assignment problem has become increasingly important in mobile telephone communication. Since the usable range of the frequency spectrum is limited, the optimal assignment problem of channels has become increasingly important. Recently Genetic Algorithms (GAs) have been proposed as new computational tools for solving optimization problems. GAs are more attractive than other optimization techniques, such as neural networks or simulated annealing, since GAs are generally good at finding an acceptably good global optimal solution to a problem very quickly. In this paper, a new channel assignment algorithm using GAs is proposed. The channel assignment problem is formulated as an energy minimization problem that is implemented by GAs. Appropriate GAs operators such as reproduction, crossover and mutation are developed and tested. In this algorithm, the cell frequency is not fixed before the assignment procedures as in the previously reported channel assignment algorithm using neural networks. The average generation numbers and the convergence rates of GAs are shown as a simulation result. When the number of cells in one cluster are increased, the generation numbers are increased and the convergence rates are decreased. On the other hand, with the increased minimal frequency interval, the generation numbers are decreased and the convergence rates are increased. The comparison of the various crossover and mutation techniques in a simulation shows that the combination of two points crossover and selective mutation technique provides better results. All three constraints are also considered for the channel assignments: the co-channel constraint, the adjacent channel constraint and the co-site channel constraint. The goal of this paper is the assignment of the channel frequencies which satisfied these constraints with the lower bound number of channels.     

Channel assignment with QoS guarantees for a multiclass multicode CDMA system

In a wireless system that supports multimedia services, each traffic requires different quality of service (QoS) at both communication on radio links and connection admission. We initially derive the uplink capacity satisfying the QoS constraint on radio links in a multiclass multicode code-division multiple-access (CDMA) system. Based on the derived capacity, the number of channel elements, which is one of the system resources, is determined. Then, we define the QoS parameters associated with connection processes. To guarantee the defined QoS at the connection level, under given channel elements, we propose a channel-assignment scheme with dynamic priority adjustment (DPA). The proposed scheme gives multipriority to different traffic classes. Real-time classes can preempt non-real-time classes with restricted preemptive priority. Such restriction is regulated by preemption-free code channels and a buffer threshold for non-real-time classes. Among real-time classes, different priorities are assigned to each traffic class by code reservation parameters. These multipriority parameters are dynamically adjusted in order to guarantee different QoS requirements. We analyze the DPA scheme by the matrix-geometric method, and evaluate the performance of each traffic class. The results show that the proposed scheme flexibly guarantees QoS depending on traffic loading condition and achieves high channel utilization.     

有限波长转换能力的OBS网波长分配算法研究

结合国内外最新的研究动态,针对有限波长转换能力的光突发交换网中亟待解决的突发包资源竞争问题,探讨了各种传统的波长分配算法,并通过对其特点的分析和综合比较,提出了一种新的适合有限波长转换能力光突发交换网特点的动态波长分配算法,此算法可以实现更低的全网突发包阻塞率.     

Channel assignment for cellular radio using simulated annealing

The channel assignment problem, i.e. the task of assigning the channels to the radio base stations in a spectrum-efficient way, is an NP-complete optimization problem occurring during design of cellular radio systems. Previously, this problem has been solved by graph coloring algorithms. An alternative approach is presented. The problem is solved using simulated annealing, which is a general approach to combinatorial optimization. The algorithm has been successfully applied to practical radio network planning situations. One major benefit of the approach consists in the enhanced flexibility it gives to the engineer     

Channel assignment for cellular radio using extended dynamic programming

The channel assignment is an important aspect of cellular radio networks. Because of the limitations on the frequency spectrum, the optimal or near-optimal channel assignment has become an essential part of the network operations of wireless personal communication systems. We formulate a new strategy for the channel assignment problem in agreement with the electromagnetic compatibility constraints. We introduce and formulate the extended dynamic programming (EDP), as an extension of dynamic programming for solving the channel assignment problem in a cellular system. Using EDP an algorithm is developed for fixed channel assignment problem and it is tested and compared with other existing methods by solving different problems. In agreement with electromagnetic compatibility constraints, solution strategy based on EDP algorithm finds many valid solutions with minimum possible bandwidth.     

Channel assignment using genetic algorithm based on geometric symmetry

The paper deals with the channel assignment problem in a hexagonal cellular network with two-band buffering, where channel interference does not extend beyond two cells. Here, for cellular networks with homogeneous demands, we find some lower bounds on the minimum bandwidth required for various relative values of s/sub 0/, s/sub 1/, and s/sub 2/, the minimum frequency separations to avoid interference for calls in the same cell, or in cells at distances of one and two, respectively. We then present an algorithm for solving the channel assignment problem in its general form using the elitist model of genetic algorithm (EGA). We next apply this technique to the special case of hexagonal cellular networks with two-band buffering. For homogeneous demands, we apply EGA for assigning channels to a small subset of nodes and then extend it for the entire cellular network, which ensures faster convergence. Moreover, we show that our approach is also applicable to cases of nonhomogeneous demands. Application of our proposed methodology to well-known benchmark problems generates optimal results within a reasonable computing time.     

下一代移动通信系统中的信道分配策略

下一代移动通信系统是一个由微蜂窝、宏蜂窝和卫星小区构成的多层覆盖体系结构,在该体系结构中,多媒体业务将占有很大的比重。基于这一特点,建立新的通信系统模型, 并通过将软-通信质量概念与统计复用技术相结合,获得了一种较好的信道分配方法。通过对算法进行系统仿真,比较了它与传统信道分配算法的优劣。仿真结果表明:新的信道分配方法会增加系统容量,减少通信业务阻塞概率,极大的提高整个系统的性能。     

Performance analysis of hop‐limited epidemic routing in DTN with limited forwarding times

Because of the uncertainty of transmission opportunity in delay tolerant networks (DTN), routing algorithms in DTN often need nodes to serve as relays for others to carry and forward messages. One classic policy is the Epidemic routing (ER) algorithm. To reduce the overhead, the hop‐limited ER protocol is proposed. This method can get better performance through controlling the message hop count. However, because of the energy constraint or other factors, each node may forward only limited times, that is, both the message hop count and the forwarding times may be limited. This paper proposes a unifying framework to evaluate the performance of ER with the aforementioned constraints. Simulations based on both synthetic and real motion traces show the accuracy of the framework. In addition, we explore the impact of many parameters (e.g., message hop count) through extensive numerical results. For example, numerical results show that both the message hop count and the forwarding times can have certain impact on the routing performance, but their impact is related with many other factors (e.g., the number of nodes). Copyright © 2014 John Wiley & Sons, Ltd.     

Channel assignment scheme in clustered multichannel cognitive radio networks with outdated CSI over Rayleigh fading channels

This work investigates channel assignment for cooperative spectrum sensing in multichannel cognitive radio networks, where the heterogeneity of primary user (PU) activity and the effect of varying channel condition on the received signal‐to‐noise ratio during cluster formation are considered. With the objective to minimize interference to the PU while enhancing multiple spectrum utilization of the secondary user (SU), an overlapping cluster‐based assignment is formulated into a nonlinear integer optimization problem. To obtain an efficient solution, the nonlinear integer problem is transformed into a mixed integer linear problem, based on which, this paper proposes an exact solution and then two new heuristic algorithms for suboptimal solutions, respectively. Furthermore, a comparative study of four different cluster head selection schemes with respect to their performance in cooperative spectrum sensing, under cluster's heterogeneity in terms of SUs distribution relative to PU transmitter location is presented. Based on the study, a robust cluster head selection scheme is proposed. Simulation results show that good sensing performance and increased opportunistic spectrum utilization in multichannel cognitive radio networks are two sides of a coin that depend on the ratio of the SUs to the number of PU channels. How far away the PU is from the cluster center is also seen to be key in the optimal selection of cluster heads in cooperative spectrum sensing.     

PERFORMANCE ANALYSIS OF POLLING SYSTEMS WITH LIMITED SERVICE

This paper analyzes a queue mode] of the polling system with limited service (K=1) in discrete time. By the imbedded Markov chain theory and the probability generating function method, the mean values of queue length and message waiting time are explicitly obtained. Also, we give the simulation results. The results obtained by H. Tagai (1985) are revised.     

Channel quality-to-interference ratio quantization criterion for limited feedback beamforming in MIMO systems

The discrete Fourier transform (DFT)-based codebook is employed in this paper to quantize channel state information so that the amount of feedback can be reduced in the multiple input multiple output (MIMO) downlink of long term evolution (LTE) system. And a novel beamforming (BF) scheme based on the proposed channel quality-to-interference (QIR) quantizing criteria is developed, which uses only the index of the optimal codebook for the beamforming at the base station (BS), and dramatically reduces the amount of feedback. The proposed BF scheme jointly considers the influences of the quality of the quantized channels and the mutual interference among the sub-channels. The extensive simulation results verify that throughput of the proposed BF scheme is better than that of the random BF with a little feedback, and that of the eigen-beamforming even under low signal noise ratio (SNR) scenario.     

Packet loss analysis in optical packet-switched networks with limited deflection routing

We present an approximate analytical method for the evaluation of packet loss probability in synchronous optical packet-switched networks which operate under limited deflection routing with the contention resolution method based on priorities. Packets are lost because they are removed by nodes. They are removed because they experience too many deflections and stay prohibitively long in the network. Such packets have to be removed because they will be ignored by the transmission protocols (like TCP) and because the quality of their optical signal is unacceptable. Presented are results for the network in the topology of the torus of the two-dimensional grid, which operates at a steady state with the uniform load u, . The strength of our analysis is its novel mathematical approach, which is capable of providing very low packet loss probabilities. For the network composed of 100 nodes, we predict the packet loss probability as low as 10⁻⁹ or lower, while simulation provided results only at the order of 10⁻⁶. For a given permissible packet loss probability, our analysis provides the maximal network load and the number of allowed deflections. We verify the analysis with simulation in the cases for which simulation gave results.

Multi-state homogeneous Markov models in reliability analysis

In the standard Markov technique applied to reliability analysis, components are characterized by two states: an up state and a down state. The present paper explores the possibility of studying system reliability, by modelling each component with a multi-state homogeneous Markov model (MHMM). It is shown that this approach is of value both in approximating non-exponential probability distributions and in helping to build up suitable models for physical processes. Examples are presented which illustrate how the multi-state technique fits many practical situations. Finally some open problems on this topic are suggested.     

Channel assignment for initial and handoff calls to improve the call-completion probability

The paper focuses on how to assign channels for initial and handoff calls. Previous schemes give priority to handoff calls by queuing handoff calls, reserving some channels for handoff calls, or subrating existing calls for handoff calls. We queue both initial and handoff calls. We take this idea from derivations of the optimal value for an approximation to the call-completion probability. Our goal is to have higher call-completion probability and still keep forced-termination probability low. We propose four schemes: SFTT (single-queue, FIFO, timeout, average timeout), SPTT (single-queue, priority, timeout, average timeout), DFTS (dual-queues, FIFO, timeout, statistical TDM), and DPTS (dual-queues, priority, timeout, statistical TDM). The four schemes, along with the NPS and FIFO schemes, were simulated and compared. For the SFTT scheme, we also simulated different average timeouts for initial calls. All four proposed schemes have better call-completion probabilities than the NPS and FIFO schemes. Call-completion probabilities can be improved by implementing a priority scheme which serves the waiting call with the least remaining time first. The implementation of statistical multiplexing also has the effect of increasing call-completion probability when the average new-call arrival rates are high. However, both the priority scheme and statistical multiplexing may increase forced-termination probability.     

Channel assignment schemes for cellular mobile telecommunication systems: A comprehensive survey

This article provides a detailed discussion of wireless resource and channel allocation schemes. The authors provide a survey of a large number of published papers in the area of fixed, dynamic, and hybrid allocation schemes and compare their trade-offs in terms of complexity and performance. We also investigate these channel allocation schemes based on other factors such as distributed⁄centralized control and adaptability to traffic conditions. Moreover, we provide a detailed discussion on reuse partitioning schemes, the effect of handoffs, and prioritization schemes. Finally, we discuss other important issues in resource allocation such as overlay cells, frequency planning, and power control.