網絡定價是一個基于對網絡技術和微觀經濟學深刻理解而產生和發展的交叉學科。其目標在於通過合理分配稀缺的網絡資源以滿足不同用戶的服務質量，同時又兼顧考慮對網絡中各個不同實體的相應激勵，以而實現令人滿意的網絡性能。適宜的定價設計在通訊網絡的運營和管理中都是必不可缺的。在本論文中，我們將網絡定價分為四類:面向優化的靜態定價、面向優化的動態定價、利潤驅動的靜態定價，和利潤驅動的動態定價。第一類定價問題已經在文獻中深入討論，本論文將集中討論後三類定價問題。對于每一類定價問題，我們將通過一個網絡定價設計實例來闡明定價設計中的關鍵挑戰與深刻見解。 / 首先，我們研究了利潤驅動的靜態定價。我們考慮了一個壟斷型的網絡運營商的利潤最大化問題，討論其如何設計激勵相容的價格，主人而使得有限的網絡資源在不同類型用戶間合理地分配。我們通過完全信息和非完全信息下的雙層斯塔伯格博博弈模型來建模刻畫運營商和用戶之間的相互作用。在完全信息下，我們研究了三種定價策略:完全價格分化、部分價格分化，和無價格分化。我們分析了這些不同定價策略在系統性能和複雜度之間的權衡關係。在不完全信息下，我們展示了設計價格分化策略的可能性，並且給出這種激勵相容的定份策略能使運營商獲得完全信息下價格分化定價策略所獲得之相同收益的充分必要條件。 / 接著，我們研究了利潤驅動的動態定價。我們考慮了一個認知網絡虛擬移動網絡運營商的資源分配勻利潤最大化的一般問題。認知網絡的動態性包括動態的用戶需求、不穩定的檢測頻譜資源、動態的頻譜租用價格，以及時變的無線信道條件。另外，為使網絡模型更接近于現實，我們還考慮了多用戶差異性和有缺陷的頻譜檢測技術。我們設計和展了一套低複雜度的在線控制策略，能夠在不知動態網絡參數的統計特性的情況下，確定定價和資源分配。我們證明這套動態定價的算法在適當權衡網絡延時的條件下，可以無限趨近最大利潤。 / 最後，我們研究了面向優化的動態定價。我們考慮一個節點容量受限的拓撲時變的多播網絡。通過運用網絡編碼，我們設計了一套動態定價策略可以分佈式地實現無限趨近最優的網絡性能。另外，我們證明這套算法是激勵相容的. 即無論節點在網絡中充當任何角色，該算法都可以保證該節點獲得非負的收益。這個結果表明，該算法可以給網絡節點提供有效的激勵，使之加入網絡、停留在網絡中，並且即使在沒有自身感興趣內容時，也願意充當其他節點的中繼，這一結果在多用戶的節點容量受限網絡(如P2P 網絡)的構建中有著重要的現實意義。 / 以上本論文推導之結果都展示了網絡定價在通訊網絡中的重要意義。尤其顯示了網絡定價是實現最優網絡性能，同時對各網絡實體提供激勵的有效工具。本論文不僅幫助我們更好地理解網絡定價問題，同時也給出網絡定價設計中的深刻見解。 / Network pricing is a cross-disciplinary research area, which requires deep understanding of both networking technology and microeconomics. The goal of network pricing is to achieve satisfied network performances by allocating the scarce resource to satisfy different users’ qualities of services while keeping in mind the incentives of different network entities. Proper design of pricing schemes is indispensable to the operation and management of communication networks. In this thesis we divide network pricing into four categories: static optimization-oriented pricing, dynamic optimization-oriented pricing, static profit-driven pricing, and dynamic profit-driven pricing. The first one is well studied in the literature, and our focus will be on the latter three categories. For each category, we illustrate the key design challenges and insights through a concrete networking example. / First, we investigate the issue of static profit-driven pricing. We consider a revenue maximization problem for a monopolist service provider, and discuss how to set incentive-compatible prices to induce proper allocation of limited resources among different types of users. We capture the interaction between the service provider and users through a two-stage Stackelberg game with both complete and incomplete information. With complete information, we study three pricing schemes: complete price differentiation, partial price differentiation, and no price differentiation. We characterize the trade-offs between the performance and complexity of different schemes. With incomplete information, we show that it is still possible to realize price differentiation, and provide the sufficient and necessary condition under which an incentive compatible price differentiation scheme can achieve the same revenue as the best scheme with complete information. / Then we investigate the issue of dynamic profit-driven pricing. We consider a general resource allocation and profit maximization problem for a cognitive virtual mobile network operator. Dynamics of the cognitive radio network include dynamic user demands, unstable sensing spectrum resources, dynamic spectrum prices, and time-varying channel conditions. In addition, we also consider multiuser diversity and imperfect sensing technique so that the network model is more realistic. We develop a low-complexity on-line control policy that determines pricing and resource scheduling without knowing the statistics of dynamic network parameters. We show that the proposed algorithm with dynamic pricing can achieve arbitrarily close to the optimal profit with a proper trade-off with the queuing delay. / We later investigate the issue of dynamic optimization-oriented pricing. We consider a node-capacitated multicast network with time-varying topology. By utilizing network coding, we design a dynamic pricing scheme that can achieve arbitrarily close to maximum network utility in a distributed fashion, while maintaining network stability. Moreover, we show that this algorithm is incentivecompatible, i.e., no matter what role a node plays in the network, the algorithm guarantees that the node has a non-negative profit. This result has practical importance for constructions for node-capacitated networks with multiple individual users (e.g., P2P networks), since it provides the proper incentives for individual nodes to join, stay, and contribute as relays in the network even if they have no interested contents. / The results developed in this thesis highlight the importance of pricing in communication networks. Specifically, our results show that pricing can be used as an effective tool to achieve optimal network performances while providing proper incentives for all network entities. This not only helps us better understand network pricing, but also gives us insights on the design of network pricing schemes. / Detailed summary in vernacular field only. / Detailed summary in vernacular field only. / Detailed summary in vernacular field only. / Detailed summary in vernacular field only. / Detailed summary in vernacular field only. / Li, Shuqin. / Thesis (Ph.D.)--Chinese University of Hong Kong, 2012. / Includes bibliographical references (leaves 155-168). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Abstract also in Chinese. / Abstract --- p.i / Acknowledgement --- p.vi / Contents --- p.viii / List of Figures --- p.xii / List of Tables --- p.xv / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Pricing Schemes in Communication Networks --- p.3 / Chapter 1.2 --- Two Main Algorithm Design Techniques --- p.5 / Chapter 1.2.1 --- Network Utility Maximization --- p.5 / Chapter 1.2.2 --- Lyapunov Stochastic Optimization --- p.7 / Chapter 1.3 --- Thesis Outline --- p.10 / Chapter 2 --- Price Differentiation for Communication Networks --- p.13 / Chapter 2.1 --- Usage-based Pricing Schemes --- p.14 / Chapter 2.2 --- System Model --- p.17 / Chapter 2.3 --- Complete Price Differentiation under complete information --- p.20 / Chapter 2.3.1 --- User’s Surplus Maximization Problem in Stage 2 --- p.20 / Chapter 2.3.2 --- Service Provider’s Pricing and Admission Control Problem in Stage 1 --- p.20 / Chapter 2.3.3 --- Properties --- p.25 / Chapter 2.4 --- Single Pricing Scheme --- p.26 / Chapter 2.4.1 --- Problem Formulation and Solution --- p.27 / Chapter 2.4.2 --- Properties --- p.28 / Chapter 2.5 --- Partial Price Differentiation under Complete Information --- p.32 / Chapter 2.5.1 --- Three-level Decomposition --- p.33 / Chapter 2.5.2 --- Solving Level-2 and Level-3 --- p.36 / Chapter 2.5.3 --- Solving Level-1 --- p.39 / Chapter 2.6 --- Price Differentiation under Incomplete Information --- p.43 / Chapter 2.6.1 --- Extensions to Partial Price Differentiation under Incomplete Information --- p.48 / Chapter 2.7 --- Connections with the Classical Price Differentiation Taxonomy --- p.49 / Chapter 2.8 --- Numerical Results --- p.50 / Chapter 2.8.1 --- When is price differentiation most beneficial? --- p.50 / Chapter 2.8.2 --- What is the best tradeoff of Partial Price Differentiation? --- p.56 / Chapter 2.9 --- Summary --- p.58 / Chapter 2.10 --- Appendix of Chapter 2 --- p.59 / Chapter 2.10.1 --- Complete Price Differentiation under complete information with General Utility Functions --- p.59 / Chapter 2.10.2 --- Proof of Proposition 2.1 --- p.64 / Chapter 2.10.3 --- Proof of Lemma 2.2 --- p.65 / Chapter 2.10.4 --- Proof of Theorem 2.4 --- p.66 / Chapter 2.10.5 --- Proof of Theorem 2.6 --- p.72 / Chapter 3 --- Profit Maximization of Cognitive Mobile Virtual Network Operator in A DynamicWireless Network --- p.73 / Chapter 3.1 --- Dynamic Spectrum Access --- p.74 / Chapter 3.2 --- Related Work --- p.77 / Chapter 3.3 --- System Model --- p.79 / Chapter 3.3.1 --- Imperfect Spectrum Sensing --- p.81 / Chapter 3.3.2 --- Collision Constraint --- p.82 / Chapter 3.3.3 --- Spectrum Leasing with Dynamic Market Price --- p.82 / Chapter 3.3.4 --- Power Allocation --- p.83 / Chapter 3.3.5 --- Demand Model --- p.84 / Chapter 3.3.6 --- Queuing dynamics --- p.86 / Chapter 3.4 --- Problem Formulation --- p.87 / Chapter 3.5 --- Profit Maximization Control (PMC) Policy --- p.89 / Chapter 3.5.1 --- Lyapunov stochastic optimization --- p.89 / Chapter 3.5.2 --- Profit Maximization Control (PMC) policy --- p.93 / Chapter 3.5.3 --- Algorithms for Cost Minimization Problem --- p.96 / Chapter 3.5.4 --- Performance of the PMC Policy --- p.101 / Chapter 3.5.5 --- Extension: More General Model of Primary Users’ Activities --- p.102 / Chapter 3.6 --- Heterogeneous Users --- p.104 / Chapter 3.6.1 --- Multi-queue Profit Maximization Control (M-PMC) Policy --- p.106 / Chapter 3.6.2 --- Performance of the M-PMC Policy --- p.111 / Chapter 3.7 --- Simulation --- p.112 / Chapter 3.8 --- Summary --- p.116 / Chapter 3.9 --- Appendix of Chapter 3 --- p.118 / Chapter 3.9.1 --- (Waterfilling) Power Allocation Algorithm --- p.118 / Chapter 3.9.2 --- Threshold Searching Algorithm --- p.118 / Chapter 3.9.3 --- Proof for Theorem 3.2 (a) --- p.119 / Chapter 3.9.4 --- Proof for Theorem 3.2 (b) --- p.121 / Chapter 3.9.5 --- Impact of Queueing on Revenue Maximization --- p.123 / Chapter 4 --- Distributed Resource Allocation for Node-Capacitated Networks with Network Coding --- p.126 / Chapter 4.1 --- Node-Capacitated Networks --- p.126 / Chapter 4.2 --- Network Model --- p.132 / Chapter 4.2.1 --- Time-varying network topology and node upload capacities --- p.132 / Chapter 4.2.2 --- Multicast with intra-session network coding --- p.133 / Chapter 4.3 --- Stochastic Network Utility Maximization Problem --- p.135 / Chapter 4.4 --- Low Complexity Distributed Algorithm --- p.138 / Chapter 4.5 --- Performance Analysis --- p.141 / Chapter 4.5.1 --- Network Stability --- p.141 / Chapter 4.5.2 --- Network Utility Maximization --- p.143 / Chapter 4.5.3 --- The Incentives Issue --- p.146 / Chapter 4.6 --- Summary --- p.150 / Chapter 5 --- Conclusion --- p.151 / Chapter 5.1 --- Extensions on Static Profit-driven Pricing --- p.152 / Chapter 5.2 --- Extensions on Dynamic Profit-driven Pricing --- p.153 / Chapter 5.3 --- Extensions on Dynamic Optimization-oriented Pricing --- p.153 / Bibliography --- p.155

Lee, Yui-Wah. / "January 2000." / Thesis (Ph.D.)--Chinese University of Hong Kong, 2000. / Includes bibliographical references (p. 180-187). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Mode of access: World Wide Web. / Abstracts in English and Chinese.

by Qin Zhou. / Thesis (Ph.D.)--Chinese University of Hong Kong, 1996. / Includes bibliographical references (p. 196-205). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Mode of access: World Wide Web.

by Lee Ying Kit. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1996. / Includes bibliographical references (leaves 79-[83]). / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Overview of Personal Communication Systems --- p.1 / Chapter 1.2 --- Design issues on PCS --- p.2 / Chapter 1.2.1 --- Channel allocation --- p.2 / Chapter 1.2.2 --- Multiple Access --- p.3 / Chapter 1.2.3 --- Handoffs --- p.4 / Chapter 1.2.4 --- Location management --- p.6 / Chapter 1.3 --- Motivation of this thesis --- p.9 / Chapter 1.4 --- The theme of this thesis --- p.10 / Chapter 1.4.1 --- Methodology --- p.10 / Chapter 1.4.2 --- The system model and assumptions --- p.12 / Chapter 1.4.3 --- Outline of the thesis --- p.13 / Chapter 2 --- Overview of the traditional location update schemes --- p.15 / Chapter 2.1 --- Why do we need location registration? --- p.15 / Chapter 2.2 --- Location registration by Geographic and Time based methods --- p.16 / Chapter 2.2.1 --- Geographic Based Registration Schemes --- p.16 / Chapter 2.2.2 --- Time Based Registration Scheme --- p.20 / Chapter 2.3 --- Peformance Analysis of protocols --- p.20 / Chapter 2.3.1 --- Analytical Results --- p.22 / Chapter 2.3.2 --- A Numerical Study --- p.23 / Chapter 2.4 --- Summary of the results for time and geographic based location update protocol --- p.24 / Chapter 3 --- The Implementation of Bloom filter on location registration --- p.27 / Chapter 3.1 --- Introduction --- p.27 / Chapter 3.2 --- The Implementation of Bloom filter on location registration --- p.29 / Chapter 3.2.1 --- Location Update by Bloom filter --- p.29 / Chapter 3.2.2 --- Paging algorithm --- p.29 / Chapter 3.2.3 --- An example --- p.30 / Chapter 3.3 --- Performance evaluation of the Bloom filter based location update scheme --- p.32 / Chapter 3.4 --- Summary of the results for Bloom filter based scheme --- p.35 / Chapter 4 --- One-Bit-Reply protocol --- p.36 / Chapter 4.1 --- Introduction --- p.36 / Chapter 4.2 --- One-Bit-Reply protocol --- p.37 / Chapter 4.2.1 --- Grouping of MU's --- p.38 / Chapter 4.2.2 --- The Update Procedure --- p.39 / Chapter 4.2.3 --- Paging algorithm --- p.40 / Chapter 4.3 --- Performance evaluation of the OBR protocol --- p.42 / Chapter 4.3.1 --- Analytical Results --- p.42 / Chapter 4.3.2 --- A Simulation Study --- p.43 / Chapter 4.4 --- Comparison of the location registration schemes - A numerical study --- p.45 / Chapter 4.5 --- Summary --- p.46 / Chapter 5 --- A case study - Implementing the OBR protocol on GSM sytems --- p.49 / Chapter 5.1 --- Introduction --- p.49 / Chapter 5.2 --- The Architecture of Global System for Mobile Communicaitons (GSM) --- p.50 / Chapter 5.3 --- Location Update Procedure of GSM --- p.51 / Chapter 5.4 --- Implementing OBR protocol on GSM --- p.52 / Chapter 5.5 --- Influence of the OBR on the VLR's and HLR --- p.55 / Chapter 5.5.1 --- Analysis of traditional method --- p.57 / Chapter 5.5.2 --- Analysis of OBR --- p.58 / Chapter 5.6 --- Summary --- p.59 / Chapter 6 --- Conclusion --- p.61 / Chapter 6.1 --- Summaries of Results --- p.61 / Chapter 6.1.1 --- Cost functions --- p.61 / Chapter 6.1.2 --- Optimization of the cost functions --- p.62 / Chapter 6.1.3 --- Implementation of OBR into GSM --- p.64 / Chapter 6.2 --- Suggestions for further researches --- p.64 / Appendix --- p.65 / Chapter A --- Derivation of cost functions --- p.66 / Chapter A.1 --- Geographic based scheme --- p.66 / Chapter A.2 --- Time based scheme --- p.67 / Chapter A.3 --- Bloom filter based scheme --- p.68 / Chapter B --- On the optimality of the cost functions --- p.71 / Chapter B.1 --- Steepest Descent Algorithm for various protocols --- p.71 / Chapter B.2 --- Bloom filter based scheme --- p.72 / Chapter B.3 --- Time Based Scheme --- p.74 / Chapter B.4 --- One-Bit-Reply scheme --- p.75 / Chapter B.5 --- Geographic Based Scheme --- p.75 / Chapter C --- Simulation of OBR --- p.77 / Bibliography --- p.79

by Tam Wing-Lam. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2003. / Includes bibliographical references (leaves 55-57). / Abstracts in English and Chinese. / Acknowledgments --- p.i / Abstract --- p.ii / 哲學碩士論文摘要 --- p.iii / Chapter Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Research Background --- p.2 / Chapter 1.2 --- Contribution of the Thesis --- p.5 / Chapter 1.3 --- Organization of the Thesis --- p.6 / Chapter Chapter 2 --- Content Repurposing System Architecture --- p.7 / Chapter 2.1 --- Introduction to ICAP-based Content Repurposing System --- p.7 / Chapter 2.2 --- Generic Service-enabling Platform --- p.8 / Chapter 2.3 --- Rule Engine --- p.10 / Chapter 2.4 --- ICAP-enabled Application Server --- p.10 / Chapter 2.5 --- Store-and-forward Transcoding and Streamed Transcoding --- p.11 / Chapter Chapter 3 --- Transcoding Techniques --- p.18 / Chapter 3.1 --- Text Transcoding --- p.19 / Chapter 2.2 --- Image Transcoding --- p.20 / Chapter 3.3 --- Audio Transcoding --- p.23 / Chapter 3.4 --- Video Transcoding --- p.25 / Chapter Chapter 4 --- Adaptation Policy --- p.28 / Chapter 4.1 --- Delay Analysis of Content Repurposing System --- p.30 / Chapter 4.2 --- Store-and-forward Transcoding for Image Files --- p.31 / Chapter 4.2.1 --- Distribution of Input Web Images --- p.34 / Chapter 4.2.2 --- Transcoding Web images to WBMP --- p.34 / Chapter 4.2.3 --- Adaptation policy of Transformation to WBMP --- p.36 / Chapter 4.2.4 --- Adaptation policy of JPEG images --- p.36 / Chapter 4.3 --- Streamed Transcoding for Audio/Video Files --- p.39 / Chapter 4.3.1 --- Audio Transcoding --- p.41 / Chapter 4.3.2 --- Video Transcoding --- p.42 / Chapter 4.4 --- Case Study --- p.43 / Chapter 4.4.1 --- Weak Device with Insufficient Bandwidth --- p.43 / Chapter 4.4.2 --- Weak Device with Sufficient Bandwidth --- p.43 / Chapter 4.4.3 --- Strong Device with Insufficient Bandwidth --- p.44 / Chapter Chapter 5 --- Conclusion --- p.54 / Bibliography --- p.55

Multipath fading is one of the major practical concerns in wireless communications. A multipath transmission takes place when a transmitted signal arrives at a receiver by two or more paths of different delay. Such multiple paths may be due to atmospheric reflection or refraction, or reflections from buildings or other objects. A multipath fading channel is usually modeled as a time-variant tapped delay system. RAKE receiver can be used to detect the signal from the multipath fading channel. However, the number of delay taps, the time delay of each path, and the tap weight for each delay path need to be determined. The objective of this thesis is to explore the possibility of using the advance signal processing algorithms to estimate the number of delays, the time delay of each path, and the tap weight for each delay path in multipath channels and to investigate the performance of the RAKE receiver based on chip rate channel estimates in a realistic mobile environment. Simulations show that the new approach outperforms the existing approaches.

Due to the enormous capacity and performance gains associated with the use of antenna arrays in wireless multi-input multi-output (MIMO) communication links, it is inevitable that these technologies will become an integral part of future systems. In order to assess the potential of such beam-oriented technologies, direct representation of the dispersion of multipath fading channel in angular and temporal domains is required. This representation can only be achieved with the use of spatial channel models. This thesis thus focuses on the issue of spatial channel modeling for cellular systems and on its use in the characteri- zation of multipath fading channels. The results of this thesis are presented mainly in five parts: a) modeling of scattering mechanisms, b) derivation of the closed-form expressions for the spatio-temporal characteristics, c) generalization of the quantitative measure of angular spread, d) investigation of the effect of mobile motion on the spatio-temporal characteris- tics, and e) characterization of fast fading channel and its use in the signature sequence adaptation for direct sequence code division multiple access (DS-CDMA) system. The thesis begins with an overview of the fundamentals of spatial channel modeling with regards to the specifics of cellular environments. Previous modeling approaches are dis- cussed intensively and a generalized spatial channel model, the 'Eccentro-Scattering Model' is proposed. Using this model, closed-form mathematical expressions for the distributions of angle and time of multipath arrival are derived. These theoretical results for the picocell, microcell and macrocell environments, when compared with previous models and available measurements, are found to be realistic and generic. In macrocell environment, the model incorporates the effect of distant scattering structures in addition to the local ones. Since the angular spread is a key factor of the second order statistics of fading processes in wireless communications, the thesis proposes a novel generalized method of quantifying the angular spread of the multipath power distribution. The proposed method provides almost all parameters about the angular spread, which can be further used for calculating more accurate spatial correlations and other statistics of multipath fading channels. The degree of accuracy in such correlation calculations can lead to the computation of exact separation distances among array elements required for maximizing capacity in MIMO systems or diversity antennas. The proposed method is also helpful in finding the exact standard deviation of the truncated angular distributions and angular data acquired in measurement campaigns. This thesis also indicates the significance of the effects of angular distribution truncation on the angular spread. Due to the importance of angular spread in the fading statistics, it is proposed as the goodness-of-fit measure in measurement campaigns. In this regard, comparisons of some notable azimuthal models with the measurement results are shown. The effect of mobile motion on the spatial and temporal characteristics of the channel is also discussed. Three mobile motion scenarios are presented, which can be considered to be responsible for the variations of the spatio-temporal statistical parameters of the multipath signals. Two different cases are also identified, when the terrain and clutter of the mobile surroundings have an additional effect on the temporal spread of the channel during mobile motion. The effect of increasing mobile-base separation on the angular and temporal spreads is elaborated in detail. The proposed theoretical results in spatial characteristics can be extended to characterizing and tracking transient behavior of Doppler spread in time-varying fast fading channels; likewise the proposed theoretical results in temporal characteristics can be utilized in designing efficient equalizers for combating inter-symbol interference (ISI) in time-varying frequency-selective fading channels. In the last part of the thesis, a linear state-space model is developed for signature sequence adaptation over time-varying fast fading channels in DS-CDMA systems. A decision directed adaptive algorithm, based on the proposed state-space model and Kalman filter, is presented. The algorithm outperforms the gradient-based algorithms in tracking the received distorted signature sequence over time-varying fast fading channels. Simulation results are presented which show that the performance of a linear adaptive receiver can be improved significantly with signature tracking on high Doppler spreads in DS-CDMA systems.

Estimating the carrier frequency from a modulated waveform is one of the most important functions of a coherent signal receiver. Good performance and low bit error rates are obtained by coherent demodulation. Therefore, exact knowledge of the received signal carrier frequency is critical for communication systems. Also due to the spectral crowding, a high probability of channel interference can be observed. Under moderate carrier frequency offsets, data-aided estimators have been developed which have a high accuracy of estimation. However, for high frequency offsets the frequency estimator does not have the information of data or timing. In this thesis we propose a parametric based carrier frequency estimation of GMSK, which has improved performance over ad-hoc methods (delay and multiply) and has high resolution capability. In this thesis three methods are implemented over GMSK data to improve the performance and their results compared with the standard delay and multiply method. Two of these methods are parametric based estimators and one is a fast frequency estimator. Parametric based estimators were chosen partly due to their high resolution capabilities and mainly for their proven performance. Parametric based estimators were seen to have high computational load, and hence an alternate fast frequency estimator was implemented. The tradeoffs involved with respect to computational load and performance were shown. The contributions of this thesis include the verification of the validity of applying a parametric based approach on GMSK data, and compare the performances of parametric methods and fast frequency estimator. It is showii that such an approach has a better performance compared to non-data aided ad-hoc delay. and multiply methods. A closed loop configuration of the open loop parametric methods is suggested in the end. / Graduation date: 2004 / Best scan available. Figures are light on the original.

Due to the rapid growth of wireless technology, there has been a growing interest in the capabilities of ad hoc networks connecting mobile phones, PDAs and laptop computers. The distributed and self-configurable capabilities of ad hoc networks make them very attractive for some applications such as tactical communication for military, search and rescue mission, disaster recovery, conferences, lectures, etc. In this thesis, we describe several new time scheduling algorithms for multihop packet radio networks; MaxThrou, MinDelay, ECTS (Energy Conserving Transmission Scheduling) and LA-TSMA (Location-Aided Time-Spread Multiple-Access). The MaxThrou and MinDelay algorithms focus on maximizing the system throughput and minimizing the delay bound by using constant weight codes. In these algorithms, each mobile host is assigned a word from an appropriate constant weight code of length n, distance d and weight w. The host can send a message at the j[superscript th] slot provided the assigned code has a 1 in this j[superscript th] bit. The MaxThrou and MinDelay scheduling algorithms are better than the previously known algorithms in terms of the minimum throughput per node and/or the delay bound. Since most of mobile hosts are operated using the scarce battery, and the battery life is not expected to increase significantly in the near future, energy efficiency is a critical issue in ad hoc networks. The ECTS algorithm conserves the power using strategies that allow the network interface to use the low power sleep mode instead of the idle mode, and also eliminates data collisions by introducing Request-To-Send (RTS) and Clear-To-Send (CTS) control slots. Simulation study shows that the ECTS algorithm outperforms previously known protocols. Due to the increasing popularity of mobile networking systems, the scalability becomes a significant new challenge for ad hoc network protocols. To provide a scalable solution for mobile ad hoc networks, we introduce the LA-TSMA algorithm. Instead of assigning a globally unique TSV to each host as done in previous topology-transparent scheduling algorithms, the proposed algorithm assigns a locally unique TSV to each host. In LA-TSMA, a territory is divided into zones, and the mobile hosts located in different zones can be assigned the same TSV. / Graduation date: 2003

Thesis (MCIS - Computer and Information Sciences) -- AUT University, 2008. / Includes bibliographical references. Also held in print ( xi, 105 leaves : ill. ; 30 cm.) in the Archive at the City Campus (T 621.382 LOL)