Cellular radio networks systems engineering.

by Kwan Lawrence Yeung.Thesis (Ph.D.)--Chinese University of Hong Kong, 1995.Includes bibliographical references (leaves 115-[118]).Chapter 1 --- Introduction --- p.1Chapter 1.1 --- Cellular Concept --- p.1Chapter 1.2 --- Fixed Channel Assignment --- p.2Chapter 1.3 --- Dynamic Channel Assignment --- p.2Chapter 1.4 --- Performance Evaluation of DC A --- p.3Chapter 1.5 --- Han doff Analysis --- p.3Chapter 1.6 --- Mobile Location Tracking Strategies --- p.3Chapter 1.7 --- QOS Measure --- p.4Chapter 1.8 --- Organization of Thesis --- p.4Chapter 2 --- Optimization of Channel Assignment I --- p.6Chapter 2.1 --- Introduction --- p.6Chapter 2.2 --- Generating Compact Patterns --- p.7Chapter 2.2.1 --- Regular size cells --- p.7Chapter 2.2.2 --- Irregular size cells --- p.7Chapter 2.3 --- Nominal Channel Allocation Methods --- p.10Chapter 2.3.1 --- Compact pattern allocation --- p.10Chapter 2.3.2 --- Greedy allocation --- p.11Chapter 2.3.3 --- Hybrid allocation --- p.11Chapter 2.3.4 --- The K-Optimal variations --- p.11Chapter 2.3.5 --- Backtracking strategies --- p.12Chapter 2.4 --- Performance Comparison --- p.12Chapter 2.5 --- Conclusions --- p.16Chapter 3 --- Optimization of Channel Assignment II --- p.18Chapter 3.1 --- Introduction --- p.18Chapter 3.2 --- Basic Heuristics --- p.20Chapter 3.2.1 --- Two methods for cell ordering --- p.20Chapter 3.2.2 --- Two channel assignment strategies --- p.20Chapter 3.3 --- Channel Assignments with Cell Re-ordering --- p.21Chapter 3.3.1 --- Four channel assignment algorithms --- p.21Chapter 3.3.2 --- Complexity --- p.22Chapter 3.3.3 --- An example --- p.22Chapter 3.4 --- Channel Assignment at Hotspots --- p.23Chapter 3.4.1 --- Strategy F vs strategy R --- p.23Chapter 3.4.2 --- Strategy FR --- p.24Chapter 3.5 --- Numerical Examples --- p.25Chapter 3.5.1 --- "Performance of algorithms F/CR,F/DR,R/CR and R/DR" --- p.26Chapter 3.5.2 --- Effect of X & Y on performance of algorithms FR/CR & FR/DR --- p.26Chapter 3.5.3 --- Performance of algorithms FR/CR & FR/DR --- p.27Chapter 3.6 --- Conclusions --- p.27Chapter 4 --- Compact Pattern Based DCA --- p.29Chapter 4.1 --- Introduction --- p.29Chapter 4.2 --- Compact Pattern Channel Assignment --- p.30Chapter 4.2.1 --- Data structures --- p.30Chapter 4.2.2 --- Two functions --- p.31Chapter 4.2.3 --- Two phases --- p.32Chapter 4.3 --- Performance Evaluation --- p.33Chapter 4.4 --- Conclusions --- p.36Chapter 5 --- Cell Group Decoupling Analysis --- p.37Chapter 5.1 --- Introduction --- p.37Chapter 5.2 --- One-Dimensional Cell Layout --- p.38Chapter 5.2.1 --- Problem formulation --- p.38Chapter 5.2.2 --- Calculation of blocking probability --- p.39Chapter 5.3 --- Two-Dimensional Cell Layout --- p.41Chapter 5.3.1 --- Problem formulation --- p.41Chapter 5.3.2 --- Calculation of blocking probability --- p.42Chapter 5.4 --- Illustrative Examples --- p.42Chapter 5.4.1 --- One-dimensional case --- p.42Chapter 5.4.2 --- Two-dimensional case --- p.45Chapter 5.5 --- Conclusions --- p.45Chapter 6 --- Phantom Cell Analysis --- p.49Chapter 6.1 --- Introduction --- p.49Chapter 6.2 --- Problem Formulation --- p.49Chapter 6.3 --- Arrival Rates in Phantom Cells --- p.50Chapter 6.4 --- Blocking Probability and Channel Occupancy Distribution --- p.51Chapter 6.4.1 --- Derivation of α --- p.51Chapter 6.4.2 --- Derivation of Bside --- p.52Chapter 6.4.3 --- Derivation of Bopp --- p.53Chapter 6.4.4 --- Channel occupancy distribution --- p.54Chapter 6.5 --- Numerical Results --- p.55Chapter 6.6 --- Conclusions --- p.55Chapter 7 --- Performance Analysis of BDCL Strategy --- p.58Chapter 7.1 --- Introduction --- p.58Chapter 7.2 --- Borrowing with Directional Carrier Locking --- p.58Chapter 7.3 --- Cell Group Decoupling Analysis --- p.59Chapter 7.3.1 --- Linear cellular systems --- p.59Chapter 7.3.2 --- Planar cellular systems --- p.61Chapter 7.4 --- Phantom Cell Analysis --- p.61Chapter 7.4.1 --- Call arrival rates in phantom cells --- p.62Chapter 7.4.2 --- Analytical model --- p.62Chapter 7.5 --- Numerical Examples --- p.63Chapter 7.5.1 --- Linear cellular system with CGD analysis --- p.63Chapter 7.5.2 --- Planar cellular system with CGD analysis --- p.65Chapter 7.5.3 --- Planar cellular system with phantom cell analysis --- p.65Chapter 7.6 --- Conclusions --- p.68Chapter 8 --- Performance Analysis of Directed Retry --- p.69Chapter 8.1 --- Introduction --- p.69Chapter 8.2 --- Directed Retry Strategy --- p.69Chapter 8.3 --- Blocking Performance of Directed Retry --- p.70Chapter 8.3.1 --- Analytical model --- p.70Chapter 8.3.2 --- Numerical examples --- p.71Chapter 8.4 --- HandofF Analysis for Directed Retry --- p.73Chapter 8.4.1 --- Analytical model --- p.73Chapter 8.4.2 --- Numerical examples --- p.75Chapter 8.5 --- Conclusions --- p.77Chapter 9 --- Handoff Analysis in a Linear System --- p.79Chapter 9.1 --- Introduction --- p.79Chapter 9.2 --- Traffic Model --- p.80Chapter 9.2.1 --- Call arrival rates --- p.80Chapter 9.2.2 --- Channel holding time distribution --- p.81Chapter 9.3 --- Analytical Model --- p.81Chapter 9.3.1 --- Handoff probability --- p.81Chapter 9.3.2 --- Handoff call arrival rate --- p.81Chapter 9.3.3 --- Derivation of blocking probability --- p.81Chapter 9.3.4 --- Handoff failure probability --- p.82Chapter 9.3.5 --- Finding the optimal number of guard channels --- p.83Chapter 9.4 --- Numerical Results --- p.83Chapter 9.4.1 --- System parameters --- p.83Chapter 9.4.2 --- Justifying the analysis --- p.84Chapter 9.4.3 --- The effect of the number of guard channels --- p.84Chapter 9.5 --- Conclusions --- p.85Chapter 10 --- Mobile Location Tracking Strategy --- p.88Chapter 10.1 --- Introduction --- p.88Chapter 10.2 --- Review of Location Tracking Strategies --- p.89Chapter 10.2.1 --- Fixed location area strategy --- p.89Chapter 10.2.2 --- Fixed reporting center strategy --- p.89Chapter 10.2.3 --- Intelligent paging strategy --- p.89Chapter 10.2.4 --- Time-based location area strategy --- p.89Chapter 10.2.5 --- Movement-based location area strategy --- p.90Chapter 10.2.6 --- Distance-based location area strategy --- p.90Chapter 10.3 --- Optimization of Location Area Size --- p.90Chapter 10.3.1 --- Location updating rates ´ؤ linear systems --- p.90Chapter 10.3.2 --- Location updating rates ´ؤ planar systems --- p.91Chapter 10.3.3 --- Optimal location area size ´ؤ linear systems --- p.92Chapter 10.3.4 --- Optimal location area size ´ؤ planar systems --- p.92Chapter 10.4 --- Comparison of FLA & DBLA Strategies --- p.93Chapter 10.5 --- Adaptive Location Tracking Strategy --- p.94Chapter 10.5.1 --- Mobility tracking --- p.94Chapter 10.5.2 --- Protocols for ALT strategy --- p.94Chapter 10.6 --- Numerical Examples --- p.95Chapter 10.7 --- Conclusions --- p.97Chapter 11 --- A New Quality of Service Measure --- p.99Chapter 11.1 --- Introduction --- p.99Chapter 11.2 --- QOS Measures --- p.99Chapter 11.3 --- An Example --- p.101Chapter 11.4 --- Case Studies --- p.101Chapter 11.5 --- Conclusions --- p.106Chapter 12 --- Discussions & Conclusions --- p.107Chapter 12.1 --- Summary of Results --- p.107Chapter 12.2 --- Topics for Future Research --- p.108Chapter A --- Borrowing with Directional Channel Locking Strategy --- p.110Chapter B --- Derivation of p2 --- p.112Chapter C --- Publications Derived From This Thesis --- p.114Bibliography --- p.11

Quantum Reinforcement Learning for Dynamic Spectrum Access in Cognitive Radio Networks

Abstract This thesis proposes Quantum Reinforcement Learning (QRL) as an improvement to conventional reinforcement learning-based dynamic spectrum access used within cognitive radio networks. The aim is to overcome the slow convergence problem associated with exploration within reinforcement learning schemes. A literature review for the background of the carried out research work is illustrated. Review of research works on learning-based assignment techniques as well as quantum search techniques is provided. Modelling of three traditional dynamic channel assignment techniques is illustrated and the advantage characteristic of each technique is discussed. These techniques have been simulated to provide a comparison with learning based techniques, including QRL. Reinforcement learning techniques are used as a direct comparison with the Quantum Reinforcement Learning approaches. The elements of Quantum computation are then presented as an introduction to quantum search techniques. The Grover search algorithm is introduced. The algorithm is discussed from a theoretical perspective. The Grover algorithm is then used for the first time as a spectrum allocation scheme and compared to conventional schemes. Quantum Reinforcement Learning (QRL) is introduced as a natural evolution of the quantum search. The Grover search algorithm is combined as a decision making mechanism with conventional Reinforcement Learning (RL) algorithms resulting in a more efficient learning engine. Simulation results are provided and discussed. The convergence speed has been significantly increased. The beneficial effects of Quantum Reinforcement Learning (QRL) become more pronounced as the traffic load increases. The thesis shows that both system performance and capacity can be improved. Depending on the traffic load, the system capacity has improved by 9-84% from a number of users supported perspective. It also demonstrated file delay reduction for up to an average of 26% and 2.8% throughput improvement

Channel assignment and routing in cooperative and competitive wireless mesh networks

This thesis was submitted for the degree of Docter of Philosophy and awarded by Brunel University.In this thesis, the channel assignment and routing problems have been investigated for both cooperative and competitive Wireless Mesh networks (WMNs). A dynamic and distributed channel assignment scheme has been proposed which generates the network topologies ensuring less interference and better connectivity. The proposed channel assignment scheme is capable of detecting the node failures and mobility in an efficient manner. The channel monitoring module precisely records the quality of bi-directional links in terms of link delays. In addition, a Quality of Service based Multi-Radio Ad-hoc On Demand Distance Vector (QMR-AODV) routing protocol has been devised. QMR-AODV is multi-radio compatible and provides delay guarantees on end-to-end paths. The inherited problem of AODV’s network wide flooding has been solved by selectively forwarding the routing queries on specified interfaces. The QoS based delay routing metric, combined with the selective route request forwarding, reduces the routing overhead from 24% up to 36% and produces 40.4% to 55.89% less network delays for traffic profiles of 10 to 60 flows, respectively. A distributed channel assignment scheme has been proposed for competitive WMNs, where the problem has been investigated by applying the concepts from non-cooperative bargaining Game Theory in two stages. In the first stage of the game, individual nodes of the non-cooperative setup is considered as the unit of analysis, where sufficient and necessary conditions for the existence of Nash Equilibrium (NE) and Negotiation-Proof Nash Equilibrium (N-PNE) have been derived. A distributed algorithm has been presented with perfect information available to the nodes of the network. In the presence of perfect information, each node has the knowledge of interference experience by the channels in its collision domain. The game converges to N-PNE in finite time and the average fairness achieved by all the nodes is greater than 0.79 (79%) as measured through Jain Fairness Index. Since N-PNE and NE are not always a system optimal solutions when considered from the end-nodes prospective, the model is further extended to incorporate non-cooperative end-users bargaining between two end user’s Mesh Access Points (MAPs), where an increase of 10% to 27% in end-to-end throughput is achieved. Furthermore, a non-cooperative game theoretical model is proposed for end-users flow routing in a multi-radio multi-channel WMNs. The end user nodes are selfish and compete for the channel resources across the WMNs backbone, aiming to maximize their own benefit without taking care for the overall system optimization. The end-to-end throughputs achieved by the flows of an end node and interference experienced across the WMNs backbone are considered as the performance parameters in the utility function. Theoretical foundation has been drawn based on the concepts from the Game Theory and necessary conditions for the existence of NE have been extensively derived. A distributed algorithm running on each end node with imperfect information has been implemented to assess the usefulness of the proposed mechanism. The analytical results have proven that a pure strategy Nash Equilibrium exists with the proposed necessary conditions in a game of imperfect information. Based on a distributed algorithm, the game converges to a stable state in finite time. The proposed game theoretical model provides a more reasonable solution with a standard deviation of 2.19Mbps as compared to 3.74Mbps of the random flow routing. Finally, the Price of Anarchy (PoA) of the system is close to one which shows the efficiency of the proposed scheme.The Higher Education Commission of Pakistan and the University of Engineering and Technology, Peshawar

Cost based optimization for strategic mobile radio access network planning using metaheuristics

La evolución experimentada por las comunicaciones móviles a lo largo de las últimas décadas ha sido motivada por dos factores principales: el surgimiento de nuevas aplicaciones y necesidades por parte del usuario, así como los avances tecnológicos. Los servicios ofrecidos para términales móviles han evolucionado desde el clásico servicio de voz y mensajes cortos (SMS), a servicios más atractivos y por lo tanto con una rápida aceptación por parte de usuario final como, video telephony, video streaming, online gaming, and the internet broadband access (MBAS). Todos estos nuevos servicios se han convertido en una realidad gracias a los avances técnologicos, avances tales como nuevas técnicas de acceso al medio compartido, nuevos esquemas de codificiación y modulación de la información intercambiada, sistemas de transmisión y recepción basados en múltiples antenas (MIMO), etc. Un aspecto importante en esta evolución fue la liberación del sector a principios de los años 90, donde la función reguladora llevado a cabo por las autoridades regulatorias nacionales (NRA) se ha antojado fundamental. Uno de los principales problemas tratados por la NRA espcífica de cada nación es la determinación de los costes por servicios mayoristas, esto es los servicios entre operadores de servicios móvilles, entre los que cabe destacar el coste por terminación de llamada o de inteconexión. El servicio de interconexión hace posible la comunicación de usuarios de diferente operadores, así como el acceso a la totalidad de servicios, incluso a aquellos no prestados por un operador en concreto gracias al uso de una red perteneciente a otro operador, por parte de todos los usuarios. El objetivo principal de esta tesis es la minimización de los costes de inversión en equipamiento de red, lo cual repercute en el establecimiento de las tarifas de interconexión como se verá a lo largo de este trabajo. La consecución de dicho objetivo se divide en dos partes: en primer lugar, el desarrollo de un conjunto de algoritmos para el dimesionado óptimo de una red de acceso radio (RAN) para un sistema de comunicaciones móvilles. En segundo lugar, el diseño y aplicación de algoritmos de optimización para la distribución óptima de los servicios sobre el conjunto de tecnologías móviles existentes (OSDP). El modulo de diseño de red proporciona cuatro algoritmos diferenciados encargados del dimensionado y planificación de la red de acceso móvil. Estos algoritmos se aplican en un entorno multi-tecnología, considerando sistemas de segunda (2G), tercera (3G) y cuarta (4G) generación, multi-usuario, teniendo en cuenta diferentes perfiles de usuarios con su respectiva carga de tráfico, y multo-servicio, incluyendo voz, servicios de datos de baja velocidad (64-144 Kbps), y acceso a internet de banda ancha móvil. La segunda parte de la tesis se encarga de distribuir de una manera óptima el conjunto de servicios sobre las tecnologías a desplegar. El objetivo de esta parte es hacer un uso eficiente de las tecnologías existentes reduciendo los costes de inversión en equipamiento de red. Esto es posible gracias a las diferencias tecnológicas existente entre los diferentes sistemas móviles, que hacen que los sistemas de segunda generación sean adecuados para proporcionar el servicio de voz y mensajería corta, mientras que redes de tercera generación muestran un mejor rendimiento en la transmisión de servicios de datos. Por último, el servicio de banda ancha móvil es nativo de redes de última generadón, como High Speed Data Acces (HSPA) y 4G. Ambos módulos han sido aplicados a un extenso conjunto de experimentos para el desarrollo de análisis tecno-económicos tales como el estudio del rendimiento de las tecnologías de HSPA y 4G para la prestación del servicio de banda ancha móvil, así como el análisis de escenarios reales de despliegue para redes 4G que tendrán lugar a partir del próximo año coinicidiendo con la licitación de las frecuencias en la banda de 800 MHz. Así mismo, se ha llevado a cabo un estudio sobre el despliegue de redes de 4G en las bandas de 800 MHz, 1800 MHz y 2600 MHz, comparando los costes de inversión obtenidos tras la optimización. En todos los casos se ha demostrado la mejora, en términos de costes de inversión, obtenida tras la aplicación de ambos módulos, posibilitando una reducción en la determinación de los costes de provisión de servicios. Los estudios realizados en esta tesis se centran en la nación de España, sin embargo todos los algoritmos implementados son aplicables a cualquier otro país europeo, prueba de ello es que los algoritmos de diseño de red han sido utilizados en diversos proyectos de regulación

Cost based optimization for strategic mobile radio access network planning using metaheuristics

La evolución experimentada por las comunicaciones móviles a lo largo de las últimas décadas ha sido motivada por dos factores principales: el surgimiento de nuevas aplicaciones y necesidades por parte del usuario, así como los avances tecnológicos. Los servicios ofrecidos para términales móviles han evolucionado desde el clásico servicio de voz y mensajes cortos (SMS), a servicios más atractivos y por lo tanto con una rápida aceptación por parte de usuario final como, video telephony, video streaming, online gaming, and the internet broadband access (MBAS). Todos estos nuevos servicios se han convertido en una realidad gracias a los avances técnologicos, avances tales como nuevas técnicas de acceso al medio compartido, nuevos esquemas de codificiación y modulación de la información intercambiada, sistemas de transmisión y recepción basados en múltiples antenas (MIMO), etc. Un aspecto importante en esta evolución fue la liberación del sector a principios de los años 90, donde la función reguladora llevado a cabo por las autoridades regulatorias nacionales (NRA) se ha antojado fundamental. Uno de los principales problemas tratados por la NRA espcífica de cada nación es la determinación de los costes por servicios mayoristas, esto es los servicios entre operadores de servicios móvilles, entre los que cabe destacar el coste por terminación de llamada o de inteconexión. El servicio de interconexión hace posible la comunicación de usuarios de diferente operadores, así como el acceso a la totalidad de servicios, incluso a aquellos no prestados por un operador en concreto gracias al uso de una red perteneciente a otro operador, por parte de todos los usuarios. El objetivo principal de esta tesis es la minimización de los costes de inversión en equipamiento de red, lo cual repercute en el establecimiento de las tarifas de interconexión como se verá a lo largo de este trabajo. La consecución de dicho objetivo se divide en dos partes: en primer lugar, el desarrollo de un conjunto de algoritmos para el dimesionado óptimo de una red de acceso radio (RAN) para un sistema de comunicaciones móvilles. En segundo lugar, el diseño y aplicación de algoritmos de optimización para la distribución óptima de los servicios sobre el conjunto de tecnologías móviles existentes (OSDP). El modulo de diseño de red proporciona cuatro algoritmos diferenciados encargados del dimensionado y planificación de la red de acceso móvil. Estos algoritmos se aplican en un entorno multi-tecnología, considerando sistemas de segunda (2G), tercera (3G) y cuarta (4G) generación, multi-usuario, teniendo en cuenta diferentes perfiles de usuarios con su respectiva carga de tráfico, y multo-servicio, incluyendo voz, servicios de datos de baja velocidad (64-144 Kbps), y acceso a internet de banda ancha móvil. La segunda parte de la tesis se encarga de distribuir de una manera óptima el conjunto de servicios sobre las tecnologías a desplegar. El objetivo de esta parte es hacer un uso eficiente de las tecnologías existentes reduciendo los costes de inversión en equipamiento de red. Esto es posible gracias a las diferencias tecnológicas existente entre los diferentes sistemas móviles, que hacen que los sistemas de segunda generación sean adecuados para proporcionar el servicio de voz y mensajería corta, mientras que redes de tercera generación muestran un mejor rendimiento en la transmisión de servicios de datos. Por último, el servicio de banda ancha móvil es nativo de redes de última generadón, como High Speed Data Acces (HSPA) y 4G. Ambos módulos han sido aplicados a un extenso conjunto de experimentos para el desarrollo de análisis tecno-económicos tales como el estudio del rendimiento de las tecnologías de HSPA y 4G para la prestación del servicio de banda ancha móvil, así como el análisis de escenarios reales de despliegue para redes 4G que tendrán lugar a partir del próximo año coinicidiendo con la licitación de las frecuencias en la banda de 800 MHz. Así mismo, se ha llevado a cabo un estudio sobre el despliegue de redes de 4G en las bandas de 800 MHz, 1800 MHz y 2600 MHz, comparando los costes de inversión obtenidos tras la optimización. En todos los casos se ha demostrado la mejora, en términos de costes de inversión, obtenida tras la aplicación de ambos módulos, posibilitando una reducción en la determinación de los costes de provisión de servicios. Los estudios realizados en esta tesis se centran en la nación de España, sin embargo todos los algoritmos implementados son aplicables a cualquier otro país europeo, prueba de ello es que los algoritmos de diseño de red han sido utilizados en diversos proyectos de regulación

Application of genetic algorithm to wireless communications

Wireless communication is one of the most active areas of technology development of our time. Like all engineering endeavours, the subject of the wireless communication also brings with it a whole host of complex design issues, concerning network design, signal detection, interference cancellation, and resource allocation, to name a few. Many of these problems have little knowledge of the solution space or have very large search space, which are known as non-deterministic polynomial (NP) -hard or - complete and therefore intractable to solution using analytical approaches. Consequently, varied heuristic methods attempts have been made to solve them ranging from simple deterministic algorithms to complicated random-search methods. Genetic alcyorithm (GA) is an adaptive heuristic search algorithm premised on the evolutionary ideas of evolution and natural selection, which has been successfully applied to a variety of complicated problems arising from physics, engineering, biology, economy or sociology. Due to its outstanding search strength and high designable components, GA has attracted great interests even in the wireless domain. This dissertation is devoted to the application of GA to solve various difficult problems spotlighted from the wireless systems. These problems have been mathematically formulated in the constrained optimisation context, and the main work has been focused on developing the problem-specific GA approaches, which incorporate many modifications to the traditional GA in order to obtain enhanced performance. Comparative results lead to the conclusion that the proposed GA approaches are generally able to obtain the optimal or near-optimal solutions to the considered optimisation problems provided that the appropriate representation, suitable fitness function, and problem-specific operators are utilised. As a whole, the present work is largely original and should be of great interest to the design of practical GA approaches to solve realistic problems in the wireless communications systems.EThOS - Electronic Theses Online ServiceBritish Council (ORS) : Newcastle UniversityGBUnited Kingdo

Design and analysis of scheduling algorithms for next generation broadband wireless access systems

Efficient utilization of network resources is a key goal for emerging Broadband Wireless Access Systems (BWAS). This is a complex goal to achieve due to the heterogeneous service nature and diverse Quality of Service (QoS) requirements of various applications that BWAS support. Packet scheduling is an important activity that affects BWAS QoS outcomes. This thesis proposes a new packet scheduling mechanism that improves QoS in mobile wireless networks which exploit IP as a transport technology for data transfer between BWAS base stations and mobile users at the radio transmission layer. In order to improve BWAS QoS the new packet algorithm makes changes at both the IP and the radio layers. The new packet scheduling algorithm exploits handoff priority scheduling principles and takes into account buffer occupancy and channel conditions. The packet scheduling mechanism also incorporates the concept of fairness. The algorithm also offers an opportunity to maximize the carriers’ revenue at various traffic situations. Performance results were obtained by computer simulation and compared to the well-known algorithms. Results show that by exploiting the new packet scheduling algorithm, the transport system is able to provide a low handoff packet drop rate, low packet forwarding rate, low packet delay, ensure fairness amongst the users of different services and generates higher revenue for the telecom carriers. Furthermore this research proposes a new and novel measure named “satisfaction factor to measure the efficacy of various scheduling schemes and finally this s research also proposes four performance measurements metric for NodeB’s of Next Generation Wireless Network

Resource allocation in digital mobile systems.

by Wan Wai Leung.Thesis (M.Phil.)--Chinese University of Hong Kong, 1998.Includes bibliographical references (leaves 77-[80]).Abstract also in Chinese.Chapter 1 --- Introduction --- p.1Chapter 1.1 --- Wireless Multimedia System --- p.1Chapter 1.2 --- Motivation of this thesis --- p.2Chapter 1.3 --- The theme of this thesis --- p.4Chapter 1.3.1 --- System Model and Assumptions --- p.4Chapter 1.3.2 --- Outline of the thesis --- p.5Chapter 2 --- Overview of TDMA/FDMA Digital Cellular Systems --- p.7Chapter 2.1 --- The Cellular Concept --- p.7Chapter 2.2 --- Channel Assignment Strategies --- p.9Chapter 2.2.1 --- Fixed Channel Assignment --- p.9Chapter 2.2.2 --- Dynamic Channel Assignment --- p.9Chapter 2.3 --- Multiple Access Techniques --- p.10Chapter 2.3.1 --- Introduction to Multiple Access --- p.10Chapter 2.3.2 --- Frequency Division Multiple Access - FDMA --- p.11Chapter 2.3.3 --- Time Division Multiple Access - TDMA --- p.12Chapter 2.4 --- A TDMA/FDMA System - GSM --- p.13Chapter 2.4.1 --- Global System for Mobile --- p.13Chapter 2.4.2 --- GSM radio subsystem --- p.13Chapter 3 --- Multi-rate Data in TDMA/FDMA Digital Cellular Systems --- p.17Chapter 3.1 --- Incorporation of Multimedia Data --- p.17Chapter 3.2 --- A Global Optimal Strategy --- p.19Chapter 3.2.1 --- Channel Rearrangement --- p.19Chapter 3.2.2 --- Analytical Performance Analysis of a Special Case --- p.21Chapter 3.2.3 --- Numerical Results --- p.24Chapter 3.2.4 --- Issues in Channel Rearrangement --- p.25Chapter 4 --- Multiple Slots Allocations --- p.26Chapter 4.1 --- Introduction --- p.26Chapter 4.2 --- No-Split Algorithm --- p.27Chapter 4.2.1 --- No-Split Algorithm --- p.27Chapter 4.2.2 --- Pros and Cons --- p.28Chapter 4.3 --- Best Fit Algorithm --- p.29Chapter 4.3.1 --- Best Fit Algorithm --- p.29Chapter 4.3.2 --- Optimization --- p.31Chapter 4.3.3 --- Pros and Cons --- p.32Chapter 4.4 --- Comparison of the two algorithms --- p.32Chapter 5 --- Buddy Algorithm --- p.37Chapter 5.1 --- Introduction --- p.37Chapter 5.2 --- Buddy System in Memory Management --- p.38Chapter 5.3 --- Buddy Algorithm --- p.40Chapter 5.3.1 --- Adaptation in slot allocation --- p.40Chapter 5.3.2 --- Data structure --- p.40Chapter 5.3.3 --- Slot allocation --- p.40Chapter 5.3.4 --- Slot deallocation --- p.44Chapter 5.4 --- Inference Property --- p.45Chapter 5.4.1 --- Proof of the Inference Property --- p.47Chapter 5.5 --- Pros and Cons --- p.49Chapter 6 --- Performance Study --- p.51Chapter 6.1 --- Introduction --- p.51Chapter 6.2 --- Fixed Channel Assignment --- p.52Chapter 6.2.1 --- System Parameters --- p.52Chapter 6.2.2 --- Simulation Results --- p.53Chapter 6.3 --- Dynmaic Channel Assignment --- p.55Chapter 6.3.1 --- System Parameters --- p.55Chapter 6.3.2 --- Simulation Results --- p.56Chapter 7 --- A Case Study - H.263 Video Coding --- p.59Chapter 7.1 --- CCITT H.263 Image Compression --- p.59Chapter 7.2 --- On a GSM Network --- p.60Chapter 8 --- Conclusion --- p.63Chapter A --- A General Data + Voice System with Channel Rearrangement --- p.65Chapter A.1 --- System Model --- p.65Chapter A.2 --- Markovian Analysis --- p.66Chapter B --- NP-Completeness Proof of the Best Fit Algorithm --- p.69Chapter B.1 --- CONSTRAINT SUBSET-SUM Problem --- p.69Chapter B.2 --- BEST-FIT Problem --- p.72Chapter C --- Proof of Proposition 5.2 --- p.74Chapter C.1 --- Upper Bound on Demand Advancement --- p.74Chapter C.2 --- Proof of Proposition 5.2 --- p.75Bibliography --- p.7

Mobile Ad Hoc Networks

Guiding readers through the basics of these rapidly emerging networks to more advanced concepts and future expectations, Mobile Ad hoc Networks: Current Status and Future Trends identifies and examines the most pressing research issues in Mobile Ad hoc Networks (MANETs). Containing the contributions of leading researchers, industry professionals, and academics, this forward-looking reference provides an authoritative perspective of the state of the art in MANETs. The book includes surveys of recent publications that investigate key areas of interest such as limited resources and the mobility of mobile nodes. It considers routing, multicast, energy, security, channel assignment, and ensuring quality of service. Also suitable as a text for graduate students, the book is organized into three sections: Fundamentals of MANET Modeling and Simulation—Describes how MANETs operate and perform through simulations and models Communication Protocols of MANETs—Presents cutting-edge research on key issues, including MAC layer issues and routing in high mobility Future Networks Inspired By MANETs—Tackles open research issues and emerging trends Illustrating the role MANETs are likely to play in future networks, this book supplies the foundation and insight you will need to make your own contributions to the field. It includes coverage of routing protocols, modeling and simulations tools, intelligent optimization techniques to multicriteria routing, security issues in FHAMIPv6, connecting moving smart objects to the Internet, underwater sensor networks, wireless mesh network architecture and protocols, adaptive routing provision using Bayesian inference, and adaptive flow control in transport layer using genetic algorithms