Channel resource management for next-generation wire/wireless communication systems

Abstract

This thesis considers channel management of next-generation communication systems such as WDM network, and IMT-2000 system from the motivation of gaining some underlying schemes and insight into any effects on management of complex systems and effective control over various communication facilities. Specifically, a variety of performance issues concerning with efficiency of the limit bandwidth and receivers including transmission schedule, location management, call admission control and channel utilization are considered and validated by analyzing associated performance exactly and practically. In Chapter 2, a receiver set partitioning and sequencing problem for multicasting transmission in a WDM sing-hop lightwave network is considered to conserve channel and transceiver utilization. This problem can be transformed to an equivalent uncapacitated single batch processing machine scheduling problem. In the problem analysis, several solution properties are characterized with respect to mean flow time measure, based upon which two heuristic algorithms are developed, along with a dynamic programming algorithm. Several numerical experiments show that the heuristic algorithms generate good schedules. The problem is then extended to a problem of considering two measures simultaneously including the mean flow time and the number of transmissions, for which the proposed algorithms also perform well. Chapter 3 considers a paging problem in the optical feeder micro cellular system where group simulcasting and dynamic channel allocation technologies are incorporated. The objective is to propose an effective paging procedure whose performance is measured in terms of paging load, average paging delay and paging success probability. In the paging procedure, paging signals are transmitted via group simulcasting, for which the control channel is allocated dynamically. The performance of the procedure is analyzed in an approximate queueing network model. The proposed procedure is...