Channel Management for Multi-Service Traffic in Cellular Wireless Networks

Channel management aims to provide quality of service guarantees for mobile users while efficiently utilize limited radio spectrum. With the increasing demand for diverse services in wireless networks, channel management for multi-service traffic in wireless networks is important. To provide diverse broadband services in limited radio spectrum, previous literature has presented adaptive services which provide mobile users with good quality of services. This study considers channel management for multi-service traffic in wireless networks with adaptive services. A channel management scheme, namely, restricted sharing, is devised to provide multi-class traffic with quality of service guarantees while increase channel utilization as much as possible. An analysis is used to study the performance of the restricted sharing scheme. Three classes are considered in numerical results. Numerical results show that the restricted sharing scheme guarantees quality of service and achieves high channel utilization.     

Optimal Sequential Paging in Cellular Wireless Networks

In a high-capacity cellular network with limited spectral resources, it is desirable to minimize the radio bandwidth costs associated with paging when locating mobile users. Sequential paging, in which cells in the coverage area are partitioned into groups and paged in a non-increasing order of user location probabilities, permits a reduction in the average radio costs of paging at the expense of greater delay in locating the users. We present a polynomial time algorithm for minimizing paging cost under the average delay constraint, a problem that has previously been considered intractable. We show the conditions under which cluster paging, a simple heuristic technique proposed for use with dynamic location update schemes, is optimal. We also present analytical results on the average delay and paging cost obtained with sequential paging, including tight bounds.     

A Novel Optimal Channel Partitioning Algorithm for Integrated Wireless and Mobile Networks

How to efficiently support multi-class services is a very important issue in integrated wireless and mobile networks because each type of services has distinct characteristics and quality of service (QoS) requirements. This paper presents an efficient algorithm for near optimal channel allocation when different types of services are to be provided in the next generation integrated wireless and mobile networks. We specifically propose a preemptive priority scheme for an integrated wireless and mobile network by first dividing channels into three independent groups and classifying traffic into four different types. The proposed system is modeled by a multi-dimension Markov chain model. Then such a model is used to obtain a set of relations that correlate performances with various system parameters. A novel recursive algorithm is developed to determine the minimal number of channels in each channel group that would be necessary to satisfy the QoS requirements. We also investigate the impact of load ratio for different types of traffic on channel assignment. Finally, we discuss some limitations of our approach and indicate possible future work. We believe that the partitioning scheme proposed in this paper can become a starting point for analysis of future integrated wireless and mobile networks.     

Handoff and Optimal Channel Assignment in Wireless Networks

In this paper, a non-preemptive prioritization scheme for access control in cellular networks is analyzed. Two kinds of users are assumed to compete for the access to the limited number of frequency channels available in each cell: the high priority users represent handoff requests, while the low priority users correspond to initial access requests originated within the same cell. Queueing of handoff requests is also considered. The research for the best access policy is carried out by means of a Markov decision model which allows us to study a very wide class of policies which includes some well known pure stationary policies, as well as randomized ones. The cutoff priority policy, consisting in reserving a certain number of channels to the high priority stream of requests, is proved to be optimal within this class while using an objective function in the form of a linear combination of some quality of service parameters, when no queueing device is considered. Numerical results confirm the optimality of the cutoff priority policy when queueing of handoff requests is allowed.     

A Markov-Based Channel Model Algorithm for Wireless Networks

Techniques for modeling and simulating channel conditions play an essential role in understanding network protocol and application behavior. In [11], we demonstrated that inaccurate modeling using a traditional analytical model yielded suboptimal error control protocol parameters choices. In this paper, we demonstrate that time-varying effects on wireless channels result in wireless traces which exhibit non-stationary behavior over small window sizes. We then present an algorithm that extracts stationary components from a collected trace in order to provide analytical channel models that, relative to traditional approaches, more accurately represent characteristics such as burstiness, statistical distribution of errors, and packet loss processes. Our algorithm also generates artificial traces with the same statistical characteristics as actual collected network traces. For validation, we develop a channel model for the circuit-switched data service in GSM and show that it: (1) more closely approximates GSM channel characteristics than traditional Markov models and (2) generates artificial traces that closely match collected traces' statistics. Using these traces in a simulator environment enables future protocol and application testing under different controlled and repeatable conditions.     

一种基于博弈论的无线Mesh网信道分配算法

为解决无线Mesh网络中的信道分配问题,提出了基于博弈论的信道分配(GBCA)算法。该算法将无线Mesh网中各节点的信道分配过程作为一个博弈过程,信道分配策略作为博弈者的策略选择,信噪比函数为博弈的效用函数。基于NS2的仿真结果表明该算法在吞吐量和丢包率方面都有较好的性能。     

Joint Optimal Access Point Selection and Channel Assignment in Wireless Networks

In wireless cellular networks or in other networks with single-hop communication, the fundamental access control problem pertains to access point (AP) selection and channel allocation for each user. For users in the coverage area of one AP, this involves only channel allocation. However, users that belong in the intersection of coverage areas of more than one AP can select the appropriate AP to establish connection and implicitly affect the channel assignment procedure. We address the joint problem of AP selection and channel assignment with the objective to satisfy a given user load vector with the minimum number of channels. Our major finding is that the joint problem reduces to plain channel allocation in a cellular network that emerges from the original one after executing an iterative and provably convergent clique load balancing algorithm. For linear cellular networks, our approach leads to minimum number of required channels to serve a given load vector. For 2D cellular networks, the same approach leads to a heuristic algorithm with a suboptimal solution due to the fact that clique loads cannot be balanced. Numerical results demonstrate the performance benefits of our approach in terms of blocking probability in a dynamic scenario with time-varying number of connection requests. The presented approach constitutes the basis for addressing more composite resource allocation problems in different context.     

Slot-Splitting TDD-CDMA for Cellular Wireless Networks

This paper proposes an improved version of time-division duplex (TDD) mode called slot-splitting TDD (SS-TDD), which increases the average achievable capacity of a TDD cellular network by splitting a slot. The improvement results from partial relaxation of the restriction in the former versions of TDD, which requires an integer number of downlink slots. The proposed method can be implemented with no significant increase in computational complexity. In addition, with a few minor modifications, the proposed SS-TDD can be applied to two out of three burst types in UTRA TDD with a single-switching-point configuration. In a multi-cell environment with mixed traffic, our analysis shows that the proposed SS-TDD increases the average cell capacity (in Mbps) by up to 18.5-10.0%, and the Erlang capacity by up to 20.5-44.3%, for targeted SIRs in the range of 5-7dB.     

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.     

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.     

Backhaul and Routing Assignments with End-to-End QoS Constraints for Wireless Mesh Networks

In scalable last-mile broadband networks such as wireless mesh networks (WMNs), quality-of-service (QoS) concerns are vital to multimedia applications such as video-conferencing and voice over IP (VoIP). Crucial decisions involve the number of backhauls that are to be deployed as well as the optimal assignment of paths and bandwidths. We focus on cost effectiveness and QoS requirements to develop a solution based on Lagrangean Relaxation and the subgradient method. Our approach satisfies QoS demands and minimizes costs more effectively than general algorithms, as demonstrated by our experimental results.     

A Channel Borrowing Approach for Cluster-based Hierarchical Wireless Sensor Networks

Mobile Networks and Applications - In Wireless Sensor Networks (WSNs), energy-efficient routing is required to conserve the scarce resources of these networks. Various energy-efficient routing...     

A Path-Centric Channel Assignment Framework for Cognitive Radio Wireless Networks

Today’s static spectrum allocation policy results in a situation where the available spectrum is being exhausted while many licensed spectrum bands are under-utilized. To resolve the spectrum exhaustion problem, the cognitive radio wireless network, termed CogNet in this paper, has recently been proposed to enable unlicensed users to dynamically access the licensed spectrum bands that are unused in either temporal or spatial domain, through spectrum-agile cognitive radios. The CogNet plays the role of secondary user in this shared spectrum access framework, and the spectrum bands accessible by CogNets are inherently heterogeneous and dynamic. To establish the communication infrastructure for a CogNet, the cognitive radio of each CogNet node detects the accessible spectrum bands and chooses one as its operating frequency, a process termed channel assignment. In this paper we propose a graph-based path-centric channel assignment framework to model multi-hop ad hoc CogNets and perform channel assignment from a network perspective. Simulation results show that the path-centric channel assignment framework outperforms traditional link-centric approach.

Scalable Multiple Channel Scheduling with Optimal Utility in Wireless Local Area Networks

This paper studies scheduling algorithms for an infra-structure based wireless local area network with multiple simultaneous transmission channels. A reservation-based medium access control protocol is assumed where the base station (BS) allocates transmission slots to the system mobile stations based on their requests. Each station is assumed to have a tunable transmitter and tunable receiver. For this network architecture, the scheduling algorithms can be classified into two categories: contiguous and non-contiguous, depending on whether slots are allocated contiguously to the mobile stations. The main objective of the scheduling algorithms is to achieve high channel utility while having low time complexity. In this paper, we propose three scheduling algorithms termed contiguous sorted sequential allocation (CSSA), non-contiguous round robin allocation (NCRRA) and non-contiguous sorted round robin allocation (NCSRRA). Among these, CSSA schedules each station in contiguous mode, while other two algorithms, NCRRA and NCSRRA, schedule stations in non-contiguous mode. Through extensive analysis and simulation, the results demonstrate that the CSSA with only slightly increased complexity can achieve much higher channel utility when compared to the existing contiguous scheduling algorithms. The NCRRA and NCSRRA on the other hand, results in significantly lower complexity, while still achieving the optimal channel utility compared to existing non-contiguous scheduling algorithms. Chonggang Wang received a B.Sc. (honors) degree from Northwestern Polytechnic University, Xi'an, China, in 1996, and M.S. and Ph. D. degrees in communication and information system from University of Electrical Science and Technology in China, Chengdu, China, and Beijing University of Posts and Telecommunications, Beijing, China, in 1999 and 2002, respectively. From September 2002 to November 2003 he has been with the Hong Kong University of Science and Technology, Hong Kong, where he is an associate researcher in the Department of Computer Science. He is now a post-doctoral research fellow in University of Arkansas, Arkansas. His current research interests are in wireless networks with QoS guarantee, sensor networks, peer-to-peer and overlay networks. Bo Li received the B.S. (summa cum laude) and M.S. degrees in the Computer Science from Tsinghua University, Beijing, P. R. China, in 1987 and 1989, respectively, and the Ph.D. degree in the Electrical and Computer Engineering from University of Massachusetts at Amherst in 1993. Between 1994 and 1996, he worked on high performance routers and ATM switches in IBM Networking System Division, Research Triangle Park, North Carolina. Since January 1996, he has been with Computer Science Department, the Hong Kong University of Science and Technology, where he is an associated professor and co-director for the ATM/IP cooperate research center, a government sponsored research center. Since 1999, he has also held an adjunct researcher position at the Microsoft Research Asia (MSRA), Beijing, China. His current research interests include wireless mobile networking supporting multimedia, video multicast and all optical networks using WDM, in which he has published over 150 technical papers in referred journals and conference proceedings. He has been an editor or a guest editor for 16 journals, and involved in the organization of about 40 conferences. He was the Co-TPC Chair for IEEE Infocom'2004. He is a member of ACM and a senior member of IEEE. Krishna M. Sivalingam (ACM ‘93) is an Associate Professor in the Dept. of CSEE at University of Maryland, Baltimore County. Previously, he was with the School of EECS at Washington State University, Pullman from 1997 until 2002; and with the University of North Carolina Greensboro from 1994 until 1997. He has also conducted research at Lucent Technologies' Bell Labs in Murray Hill, NJ, and at AT&T Labs in Whippany, NJ. He received his M.S. and Ph.D. degrees in Computer Science from State University of New York at Buffalo in 1990 and 1994 respectively; and his B.E. degree in Computer Science and Engineering in 1988 from Anna University, Chennai (Madras), India. While at SUNY Buffalo, he was a Presidential Fellow from 1988 to 1991. His research interests include wireless networks, optical wavelength division multiplexed networks, and performance evaluation. He holds three patents in wireless networks and has published several research articles including more than twenty-five journal publications. He has published an edited book on Wireless Sensor Networks in 2004 and on optical networks in 2000 and in 2004. He is a member of the Editorial Board for ACM Wireless Networks Journal, IEEE Transactions on Mobile Computing, and KICS Journal of Computer Networks. He has served as a Guest Co-Editor for special issues of ACM MONET on “Wireless Sensor Networks” in 2003 and 2004 and an issue of IEEE Journal on Selected Areas in Communications on optical WDM networks (2000). He is co-recipient of the Best Paper Award at the IEEE International Conference on Networks 2000 held in Singapore. His work has been supported by several sources including AFOSR, NSF, Cisco, Intel and Laboratory for Telecommunication Sciences. He is a member of the Editorial Board for ACM Wireless Networks Journal, IEEE Transactions on Mobile Computing, and KICS Journal of Computer Networks. He is serving as Technical Program Co-Chair for the First IEEE Conference on Sensor Communications and Networking to be held in Santa Clara, CA in 2004. He has served as General Co-Chair for SPIE Opticomm 2003 (Dallas, TX) and for ACM Intl. Workshop on Wireless Sensor Networks and Applications (WSNA) 2003 held on conjunction with ACM MobiCom 2003 at San Diego, CA. He served as Technical Program Co-Chair of SPIE/IEEE/ACM OptiComm conference at Boston, MA in July 2002; and as Workshop Co-Chair for WSNA 2002 held in conjunction with ACM MobiCom 2002 at Atlanta, GA in Sep 2002. He is a Senior Member of IEEE and a member of ACM. Kazem Sohraby received the BS, MS and PhD degrees in electrical engineering and the MBA from the Wharton School, University of Pennsylvania, Philadephia. He is a Professor of the Electrical Engineering Department, College of Engineering, University of Arkansas, Fayetteville. Prior to that, he was with Bell Laboratories, Holmdel, NJ. His areas of interest include computer networking, signaling, switching, performance analysis, and traffic theory. He has over 20 applications and granted patents on computer protocols, wireless and optical systems, circuit and packet switching, and on optical Internet. He has several publications, including a book on The Performance and Control of Computer Communications Networks (Boston, MA: 1995). Dr Sohraby is a Distinguished Lecturer of the IEEE Communications Society, and serves as its President's representative on the Committee on Communications and Information Policy (CCIP). He served on the Education Committee of the IEEE Communications Society, is on the Editorial Boards of several publications, and served as Reviewer and Panelist with the National Science Foundation, the US Army and the Natural Sciences and Engineering Research Council of Canada.     

一种网络编码和信道编码的联合设计

网络编码技术可以大幅度提高网络的吞吐量和鲁棒性,因此已成为近年来的研究热点。在研究无线网络中物理层网络编码技术的基础上,提出了多址信道中一种联合网络编码和信道编码的设计方案。该设计利用LDPC码和网络编码的线性特性以及软输入软输出模块设计,不仅减少了编译码的复杂度,而且在高的信噪比情况下可以获得良好的性能。仿真结果表明,该设计方案不仅容易实现,而且性能接近网络信道容量的上限,相比传统的设计技术至少能够提高1．6倍的增益。     

面向CDMA蜂窝网的无线定位技术

蜂窝通信系统中移动台定位问题作为研究的热点之一,受到了广泛的关注.实现蜂窝通信系统中移动台定位,需要解决定位算法与定位参数估计问题.本文以定位算法与定位参数估计为主线,综述了蜂窝通信系统中移动台定位的发展过程、现状、取得的进展以及面临的挑战,特别是对减轻非视距传播影响的定位算法进行了详细讨论.     

Channel and Error Modeling for Wireless Body Area Networks

Wireless Body Area Networks (WBANs) have been developed as the human-body monitoring systems to predict, diagnose, and treat diseases. Since the signal transmission in WBANs takes place in or around the human body the channel fading significantly affects packet error rate and overal network performance. In this work, we discuss the channel models and error performance formalization for WBANs. In the first phase of this work, we study channel fading models for WBANs. In the second phase, we survey the models which calculate the error performance metrics in WBANs. We select most appropriate error models to design and develop the error performance evaluation models for IEEE 802.15.6-based WBANs and show how to integrate them with the error model in Medium Access Control (MAC). We then discuss integrated PHY and MAC error performance in WBANs.     

Channel Selection for Spectrum Sharing in Wireless Networks

In this paper, we study a spectrum sharing network (SSN) where a spectrum sharing device (SSD) coexists with multiple wireless communication systems (WCSs) in the same channel. The SSD can operate with either a duty cycle (DC) channel access mechanism or a listen‐before‐talk (LBT) channel access mechanism, whereas WCSs operate with an LBT mechanism. An opportunistic channel selection scheme for the SSD in the SSN is first proposed to minimize the outage probability. The optimal data transmission time for the DC‐based SSD is derived to further improve the outage probability. We also derive the exact and closed‐form outage probability of the proposed channel selection in the SSN by assuming that the number of WCSs operating in each channel is uniformly distributed. The simulation results show that the proposed channel selection scheme outperforms other channel selection schemes. It was also observed that a DC‐based SSD with an optimal data transmission time provides a better outage performance than an LBT‐based SSD. As the number of available channels increases, the channel selection scheme plays an important role in minimizing the outage probability of the SSNs.     

Optimising Channel Assignments for Private Mobile Radio Networks in the UHF 2 Band

Private mobile radio (PMR) services are widely used in business and emergency applications. Typically, these services use the UHF 2 band (450–470 MHz). In order to comply with continental practice, the provision of these services in the UK is to be realigned and a new operational assignment will be generated in 2005. However, this can only be achieved with an appropriate model and the ability to make assignments for large regional networks. The purpose of this paper is to bring our experiences of this problem to the wireless arena. We explain the model used when making assignments for UK PMR networks and identify existing techniques and theory which are appropriate for this problem. We demonstrate that improved assignments and estimates of spectral requirements for large operational services can be found.