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.     

一种分层蜂窝网中基于用户分类的建模分析方法

随着无线网中用户需求的业务量持续增大,且用户具有不同移动性,分层蜂窝结构(HCS)被提出。该文研究一种微小区/宏小区的双层蜂窝结构的网络性能,此系统采用双向溢出策略,呼叫用户根据其速度选择合适的接入层(慢用户接入微小区,快用户接入宏小区)。该文提出一种用户分类建模分析方法(分为快用户和慢用户)来估计分层蜂窝网络性能,它不同于以往的蜂窝层分类(分为微小区层和宏小区层)建模方法。此用户分类模型包括一个快用户模型和一个慢用户模型,两个模型都是简单的一维马尔可夫过程。理论分析和仿真结果都证明了用户分类分析模型的正确性。随后利用此模型分析了为速度阈值的作用和被阻用户重复呼叫情况下的网络性能。     

蜂窝网络和Ad Hoc网络综述

文章首先分别介绍了无线通信网络中的蜂窝网络及Ad Hoc网络的概念、发展及特点,分析了两者的不同及联系.之后又讨论了这两种网络中的信道分配问题:对于蜂窝网络介绍了基本的信道分配策略;对于Adhoc网络介绍了单频、双频和多频各自的频率分配特点.最后展望无线通信网络的发展方向和未来.     

A Channel Sharing Scheme for Cellular Mobile Communications

This paper presents a channel sharing scheme, Neighbor Cell Channel Sharing (NCCS) , based on region partitioning of cell coverage for wireless cellular networks. Each cell is divided into an inner-cell region and an outer-cell region. Cochannel interference is suppressed by limiting the usage of sharing channels in the inner-cell region. The channel sharing scheme achieves a traffic-adaptive channel assignment and does not require any channel locking. Performance analysis shows that using the NCCS scheme leads to a lower call blocking probability and a better channel utilization as compared with other previously proposed channel assignment schemes.     

蜂窝中继网络的身份认证技术综述

首先回顾了蜂窝中继网络的基本情况,分析了蜂窝中继网络中身份认证技术的重要性和关键点;然后系统地介绍了蜂窝中继网络中不同系统结构的身份认证技术及国内外研究现状,对其进行了细致而科学的分类;最后,给出了研究难点和研究方向。     

Lagrangean Based Methods for Solving Large-Scale Cellular Network Design Problems

The cellular network design (CND) problem is formulated as a comprehensive linear mixed integer programming model integrating the base station location (BSL) problem, the frequency channel assignment (FCA) problem and the topological network design (TND) problem. A solution algorithm based on Lagrangean relaxation is proposed for solving this complex cellular network design problem. Pursuing the optimum solution through exact algorithms to this problem appears to be unrealistic considering the large scale nature and NP-hardness of the problem. Therefore, the solution algorithm strategy consists in computing effective lower and upper bounds for the problem. Lower bounds are evaluated through a Lagrangean relaxation technique and subgradient method. A Lagrangean heuristic is developed to compute upper bounds based on the Lagrangean solution. The bounds are improved through a customized branch and bound algorithm which takes in account specific knowledge of the problem to improve its efficiency. Thirty two random test instances are solved using the proposed algorithm and the CPLEX optimization package. The results show that the duality gap is excessive, so it cannot guarantee the quality of the solution. However, the proposed algorithm provides optimal or near optimal solutions for the problem instances for which CPLEX also provides the optimal solution. It further suggests that the proposed algorithm provides optimal or near optimal solutions for the other instances too. Finally, the results demonstrate that the proposed algorithm is superior to CPLEX as a solution approach for the CND problem.     

Channel Assignment for Cellular Networks Based on a Local Modified Hopfield Neural Network

In this paper, we propose a modified discrete Hopfield neural networks algorithm for the channel assignment problem. In opposition to previous work, we tried to apply the optimization locally on a per cell basis in order to reduce the CPU processing time and decrease the designed system complexity while obtaining a near-optimum solution. In addition, the research is extended to study the algorithm performance in a more realistic cellular system where the number of requested channels is continuously changing with time. In this paper, the channel assignment problem is formulated as an energy function which is at its minimum when all the defined compatibility constraints are satisfied and the assigned channel number (ACN) is equal to the requested channel number (RCN) in each cell.     

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.     

应用于分级复用系统的全光网波长分配算法

研究了全光网中采用分级复用系统的波长分配问题,充分考虑到分级复用系统在降低整个网络成本上的重要意义,以最小化光纤数量和波长路径为优化目标,提出一种启发式波长分配算法。     

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.     

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.     

最优化方法在蜂窝通信中的应用

本文研究了最优化方法在蜂窝通信系统信道复用，信道配置中的应用，通过研究共信道干扰总概率Ｐｔ与系统各参数间的关系，应用最优化方法求出使ｐｔ最小的各参数值，从而达到信道最佳复用，通过系统呼叫失败概率ｐｔ与信道配置参数间的关系，应用最优化方法求出使ｐｔ最小的信道配置参数，从而达到信道的最佳配置，文中还给出了设计实例。     

Mobility Influences on the Capacity of Wireless Cellular Networks

Capacity has always been a major concern in wireless networks. This letter studies the impact of mobility on the overall system capacity in wireless cellular networks. In this letter, we present a simple system model which we developed to capture the inherent relationships among system capacity, new call blocking probability, handoff dropping probability, call terminating probability, and bandwidth utilization rate. We investigate the complex relationship between mobility and capacity‐related parameters. Through simulation, we demonstrate that mobility has a significant impact on capacity and is reversely proportional to the bandwidth reserved for handoff traffic.     

分级递阶网络的失效恢复

针对分级递阶网络中建立基于备用信道的失效恢复机制的难点问题,首次提出分级递阶网络中的备用资源分配算法和备用信道建立算法。通过将整个可靠连接分解成级联的多个可靠段的方法,同时为域间链路和边界节点引入备用机制,较好地解决了分级递阶网络路由算法和备用信道路由条件之间的矛盾。     

Channel Sharing Scheme for Packet-Switched Cellular Networks

In this paper, we study an approach for sharing channels to improve network utilization in packet-switched cellular networks. Our scheme exploits unused resources in neighboring cells without the need for global coordination. We formulate a minimax approach to optimizing the allocation of channels in this sharing scheme. We develop a measurement-based distributed algorithm to achieve this objective and study its convergence. We illustrate, via simulation results, that the distributed channel sharing scheme performs significantly better than the fixed channel scheme over a wide variety of traffic conditions. This research was supported in part by the National Science Foundation through grants ECS-0098089, ANI-0099137, ANI-0207892, ANI-9805441, ANI-0099137, and ANI-0207728, and by an Indiana 21st century grant. A conference version of this paper appeared in INFOCOM 99. This work was done when all the authors were at Purdue University. Suresh Kalyanasundaram received his Bachelors degree in Electrical and Electronics Engineering and Masters degree in Physics from Birla Institute of Technology and Science, Pilani, India in 1996. He received his Ph.D. from the School of Electrical and Computer Engineering, Purdue University, in May 2000. Since then he has been with Motorola, working in the area of performance analysis of wireless networks. Junyi Li received his B.S. and M.S. degrees from Shanghai Jiao Tong University, and Ph.D. degree from Purdue University. He was with the Department of Digital Communications Research at Bell Labs, Lucent Technologies from 1998 to 2000. In 2000 as a founding member he jointed Flarion Technologies, where he is now Director of Technology. He is a senior member of IEEE. Edwin K.P. Chong received the B.E.(Hons.) degree with First Class Honors from the University of Adelaide, South Australia, in 1987; and the M.A. and Ph.D. degrees in 1989 and 1991, respectively, both from Princeton University, where he held an IBM Fellowship. He joined the School of Electrical and Computer Engineering at Purdue University in 1991, where he was named a University Faculty Scholar in 1999, and was promoted to Professor in 2001. Since August 2001, he has been a Professor of Electrical and Computer Engineering and a Professor of Mathematics at Colorado State University. His current interests are in communication networks and optimization methods. He coauthored the recent book, An Introduction to Optimization, 2nd Edition, Wiley-Interscience, 2001. He was on the editorial board of the IEEE Transactions on Automatic Control, and is currently an editor for Computer Networks. He is an IEEE Control Systems Society Distinguished Lecturer. He received the NSF CAREER Award in 1995 and the ASEE Frederick Emmons Terman Award in 1998. Ness B. Shroff received his Ph.D. degree from Columbia University, NY in 1994. He is currently an Associate Professor in the School of Electrical and Computer Engineering at Purdue University. His research interests span the areas of wireless and wireline communication networks. He is especially interested in fundamental problems in the design, performance, scheduling, capacity, pricing, and control of these networks. His research is funded by various companies such as Intel, Hewlett Packard, Nortel, AT&T, and L. G. Electronics; and government agencies such as the National Science Foundation, Indiana Dept. of Transportation, and the Indiana 21st Century fund. Dr. Shroff is an editor for IEEE/ACM Trans. on Networking and the Computer Networks Journal, and past editor of IEEE Communications Letters. He was the conference chair for the 14th Annual IEEE Computer Communications Workshop (in Estes Park, CO, October 1999) and program co-chair for the symposium on high-speed networks, Globecom 2001 (San Francisco, CA, November 2000). He is also the Technical Program co-chair for IEEE INFOCOM'03 and panel co-chair for ACM Mobicom'02. He received the NSF CAREER award in 1996.     

Design of Optical Content Distribution Networks for Video on Demand Services

This paper presents the design of optical content distribution networks for video on demand (VoD) services. The proposed Ethernet-based WDM network architecture is decentralized and consists of independent regional ring networks with locally deployed video servers. Based on an Integer Linear Programming (ILP) model, a network design tool, minimizing the total installation cost for optical network equipment on the metro and the Hybrid Fiber Coax (HFC) access network, has been developed. Unicast as well as broadcast VoD services are taken into account. The influence of different parameters in our traffic and content models on the network design is studied.     

Comparing Heuristics for Demand Routing and Slot Assignment on Ring Networks

This paper examines various heuristic strategies for solving the demand routing and slotting problem (DRSP) on ring networks. This problem arises in the economic design of survivable networks using SONET (or WDM) technology. To cost-effectively deploy SONET rings, we must determine the minimum capacity required to assure survivability while obeying constraints on how traffic must be assigned. We present several heuristics for sizing rings and compare their solutions. Our results give rise to a heuristic that consistently delivers solutions that are within 5% of the optimal over a wide range of randomly generated test problems.     

Stability for Cellular Neural Networks with Delay

The cellular neural networks with delay (DCNN‘s) are investigated, and some new sufficient conditions on asymptotical stability of DCNN‘s are derived by constructing the Liapunov functional and utilizing M-matrix and the ω-limit set. It is shown that the new conditions are not related to the delayed parameter.     

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.     

Robust Packet Scheduling in Wireless Cellular Networks

This paper addresses the following robust scheduling problem: Given that only coarse-grained channel state information (i.e., bounds on channel errors, but not the fine-grained error pattern) is available, how to design a robust scheduler that ensures worst-case optimal performance? To solve this problem, we consider two coarse-grained channel error models and take a zero-sum game theoretic approach, in which the scheduler and the channel error act as non-cooperative adversaries in the scheduling process. Our results show that in the heavy channel error case, the optimal scheduler adopts a threshold form. It does not schedule a flow if the price (the flow is willing to pay) is too small, in order to maximize the system revenue. Among the scheduled flows, the scheduler schedules a flow with a probability inversely proportional to the flow price such that the risk of being caught by the channel error adversary is minimized. We also show that in the mild channel error model, the robust scheduling policy exhibits a balanced trade-off between a greedy decision and a conservative policy. The scheduler is likely to take a greedy decision if it evaluates the risk of encountering the channel error adversary now to be small. Therefore, robust scheduling does not always imply conservative decision. The scheduler is willing to take “risks” to expect higher gain in some scenarios. Our solution also shows that probabilistic scheduling may lead to higher worst-case performance compared to traditional deterministic policies. Finally, the current efforts show the feasibility to explore a probabilistic approach to cope with dynamic channel error conditions.