Access scheduling is essentially power control with only on-off options. The second part is dealing with situations where user transmissions can exist simultaneously. Here, a problem of distributed power control for time varying systems is investigated in order to coordinate transmit power among users for their respective quality-of-service (QoS). We deal with a class of power control problems where the system link gains are assumed to be time varying and SIR estimates are allowed to be corrupted with bounded noises. A simple control algorithm is devised by applying a distributed, fixed-step approach. The feedback algorithm requires only local information. By modifying the fixed-step power control algorithm proposed by Sung and Wong, here we obtain a more robust version that can handle time varying link gains and measurement noises. The result extends the Foschini and Miljanic model to allow fading and measurement errors. Convergence property of the new algorithm is established. Simulation studies have been conducted and results show that it is effective. / In integrated wireless multimedia service, isochronous traffic of different connections can be scheduled by using a most regular binary sequence (MRBS). Such a sequence can schedule traffic in an evenly spaced manner to achieve any arbitrary rate asymptotically while avoiding excessive delay and buffering requirement. Flexible time slot assignment that can match requests exactly improves the bandwidth utilization efficiency in supporting multi-rate operations for traffics of various classes. The most regular binary sequence provides such a distributed solution for multi-access control that only requires a limited information exchange. Generally, the idea can be developed to support flexible resource allocation in various communication systems such as hybrid TD-CDMA and MC-CDMA systems. It results in an overall capacity gain. More interestingly, the MRBS transmission scheduling is applicable in a network sense. Deterministic end-to-end performance guarantees such as packet delay and buffering requirement can be investigated in a systematic way. Discussions of periodic binary sequences with interesting characteristics are presented in succession. / Chen Chung Shue. / "September 2005." / Adviser: Wing Shing Wong. / Source: Dissertation Abstracts International, Volume: 67-07, Section: B, page: 3984. / Thesis (Ph.D.)--Chinese University of Hong Kong, 2005. / Includes bibliographical references (p. 154-167). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Electronic reproduction. [Ann Arbor, MI] : ProQuest Information and Learning, [200-] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Abstract in English and Chinese. / School code: 1307.
Identifer | oai:union.ndltd.org:cuhk.edu.hk/oai:cuhk-dr:cuhk_343661 |
Date | January 2005 |
Contributors | Chen, Chung Shue., Chinese University of Hong Kong Graduate School. Division of Information Engineering. |
Source Sets | The Chinese University of Hong Kong |
Language | English, Chinese |
Detected Language | English |
Type | Text, theses |
Format | electronic resource, microform, microfiche, 1 online resource (xvi, 167 p. : ill.) |
Rights | Use of this resource is governed by the terms and conditions of the Creative Commons “Attribution-NonCommercial-NoDerivatives 4.0 International” License (http://creativecommons.org/licenses/by-nc-nd/4.0/) |
Page generated in 0.0015 seconds