First, we give the first formal study on stream control scheduling in wireless mesh networks with Multi-Input-Multi-Output (MIMO) antennas and study how much it can improve network capacity. We derive the upper bound of the optimal network capacity gain of stream control. We also propose an efficient stream control scheduling algorithm, GreedySC. Simulations show the network capacity of GreedySC is much larger than that of a previously proposed stream control scheduling algorithm, SCMA. / Second, we consider leveraging transmission power to improve the network capacity of wireless mesh networks. It is well-known that power control can improve network capacity significantly. However, recent works show conflicting results: network capacity may increase or decrease with higher transmission power under different scenarios. In this work, we give the first systematic study on this paradox. We prove that the the optimal network capacity is a non-decreasing function of higher transmission power. We also derive the upper bound of the optimal network capacity gain of power control. Finally, we give the reasons why network capacity may increase or decrease with higher transmission power in practice. Simulations verify our arguments. / The next generation wireless networks target at providing better quality of service for ubiquitous network access than nowaday wireless networks. Various technologies from the physical layer to the transport layer are proposed to realize this goal. A fundamental question is how to characterize the impact of a new technology on the performance of wireless networks, e.g., network capacity, backlog and delay. We propose to apply optimization theory for the network capacity characterization and apply stochastic network calculus for the backlog and delay characterization. However, the detailed characterization procedure depends on different problems. In this thesis, we first formally define network capacity, the (optimal) network capacity gain of a new technology, backlog and delay. Then we carry out systematic characterizations on the following three important issues in designing the next generation wireless networks. / Third, we take the first step to apply stochastic network calculus for the backlog and delay analysis of 802.11 wireless local networks. We prove the general stability condition of deriving stable backlog and delay for a wireless node. From this, we derive the specific stability condition of an 802.11 wireless node. Then we derive the stochastic service curve of an 802.11 node. Based on the service curve, we derive the backlog and delay bounds of the node. Simulations verify our analysis. / Wang, Yue. / Adviser: John C. S. Lui. / Source: Dissertation Abstracts International, Volume: 70-09, Section: B, page: . / Thesis (Ph.D.)--Chinese University of Hong Kong, 2009. / Includes bibliographical references (leaves 109-117). / 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. / Abstracts in English and Chinese. / School code: 1307.

Hui, Ka Hung. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2007. / Includes bibliographical references (leaves 123-126). / Abstracts in English and Chinese. / Abstract --- p.i / Acknowledgement --- p.iv / Chapter 1 --- Introduction / Motivation --- p.1 / Chapter 2 --- Literature Review --- p.6 / Chapter 2.1 --- Introduction --- p.6 / Chapter 2.2 --- The Capacity-Finding Problem --- p.6 / Chapter 2.3 --- Interference Models --- p.8 / Chapter 2.4 --- Considering Interference in the Capacity-Finding Problem with Perfect Scheduling --- p.9 / Chapter 2.4.1 --- Conflict Graph --- p.10 / Chapter 2.4.2 --- Independent Set Constraints --- p.11 / Chapter 2.4.3 --- Row Constraints --- p.11 / Chapter 2.4.4 --- Clique Constraints --- p.12 / Chapter 2.4.5 --- Using the physical model --- p.13 / Chapter 2.5 --- Considering Interference in the Capacity-Finding Problem with Random Access --- p.15 / Chapter 2.6 --- Chapter Summary --- p.17 / Chapter 3 --- Partial Interference - Basic Idea --- p.18 / Chapter 3.1 --- Introduction --- p.18 / Chapter 3.2 --- Deficiencies in Previous Models --- p.18 / Chapter 3.2.1 --- Multiple Interferers --- p.19 / Chapter 3.2.2 --- Non-binary Behavior of Interference --- p.19 / Chapter 3.2.3 --- Impractical Perfect Scheduling --- p.21 / Chapter 3.3 --- Refining the Relationship between Interference and Throughput Degradation --- p.21 / Chapter 3.4 --- Capacity Gain by Exploiting Partial Interference . --- p.23 / Chapter 3.5 --- Chapter Summary --- p.28 / Chapter 4 --- Partial Interference in 802.11 --- p.29 / Chapter 4.1 --- Introduction --- p.29 / Chapter 4.2 --- The 802.11 Model --- p.29 / Chapter 4.2.1 --- Assumptions --- p.30 / Chapter 4.2.2 --- Transmission Probability Calculation --- p.31 / Chapter 4.2.3 --- Packet Corruption Probability Calculation --- p.34 / Chapter 4.2.4 --- Loading Calculation --- p.35 / Chapter 4.2.5 --- Summary --- p.36 / Chapter 4.3 --- Some Analytical Results --- p.37 / Chapter 4.4 --- A TDM A/CDMA Analogy --- p.40 / Chapter 4.5 --- Admissible (Stability) Region --- p.42 / Chapter 4.6 --- Chapter Summary --- p.44 / Chapter 5 --- Partial Interference in Slotted ALOHA --- p.45 / Chapter 5.1 --- Introduction --- p.45 / Chapter 5.2 --- The Finite-Link Slotted ALOHA Model --- p.46 / Chapter 5.2.1 --- Assumptions --- p.46 / Chapter 5.2.2 --- Stability of Slotted ALOHA --- p.46 / Chapter 5.3 --- Stability Region of 2-Link Slotted ALOHA under Partial Interference --- p.47 / Chapter 5.4 --- Some Illustrations --- p.50 / Chapter 5.5 --- Generalization to the M-Link Case --- p.53 / Chapter 5.6 --- Chapter Summary --- p.58 / Chapter 6 --- FRASA --- p.59 / Chapter 6.1 --- Introduction --- p.59 / Chapter 6.2 --- The FRASA Model --- p.60 / Chapter 6.3 --- Validation of the FRASA Model --- p.66 / Chapter 6.3.1 --- Simulation Results --- p.66 / Chapter 6.3.2 --- Comparison to Previous Bounds --- p.72 / Chapter 6.4 --- Convex Hull Bound --- p.75 / Chapter 6.5 --- p-Convexity --- p.80 / Chapter 6.6 --- Supporting Hyperplane Bound --- p.86 / Chapter 6.7 --- Extension to Partial Interference --- p.89 / Chapter 6.7.1 --- FRASA under Partial Interference --- p.90 / Chapter 6.7.2 --- Convex Hull Bound --- p.93 / Chapter 6.7.3 --- p-Convexity --- p.97 / Chapter 6.7.4 --- Supporting Hyperplane Bound --- p.101 / Chapter 6.8 --- Chapter Summary --- p.102 / Chapter 7 --- Conclusion and Future Works --- p.110 / Chapter 7.1 --- Conclusion --- p.110 / Chapter 7.2 --- Future Works --- p.111 / Chapter A --- Proof of (4.13) in Chapter 4 --- p.113 / Bibliography --- p.123

Thesis (M.S.)--State University of New York at Binghamton, Electrical Engineering Dept., 2006. / Includes bibliographical references.

Power is a valuable resource. It is invaluable when for mobile devices. Mobile devices, due to their mobility cannot get a continuous source of power and derive their power from a battery contained in them. The main consumer of power in the mobile is its transmitter. With a limited power capacity of the batteries, it is always desirable that the transmit power of the mobile be minimized. The aim of this thesis is to introduce a new architecture to minimize this problem. It is called as "Stretchable Architectures". The stretched architecture involves an intermediary between the Mobile Station and the Base Station to carry the call between them. This type of connection is called a Stretched connection. We explain the energy efficiency of a Stretched Connection when compared to a Direct connection between the Mobile Station and Base Station. We investigate the factors affecting a Stretched connection and propose different Stretchable Architectures, suitable for different applications. The "Stretched Architecture" is analyzed for the three 3G standards: Multi-carrier Direct Spread CDMA (CDMA2000), Wideband CDMA (WCDMA) and Time Division-CDMA (TD-CDMA). / Graduation date: 2002

Dynamic DC offset is one of the biggest problems preventing the implementation of single chip receivers. This thesis presents a 2.4GHz downconversion mixer designed to work with adaptive DC offset cancellation for a fully integrated direct conversion receiver. Offset can be removed by dynamically changing the PFET load bias in a Gilbert Cell type mixer. A dual-loop algorithm, which was developed in separate work, controls a current-steering DAC that dynamically changes the PFET load bias of the mixer. The mixer has a gain of 8dB, an IIP3 of l7dBm, and a noise figure of 15dB. In addition a CMOS RF Front-End incorporating the offset cancellation mixer is presented that meets the specifications for Bluetooth. / Graduation date: 2001

Thesis (M.S.)--University of Florida, 2000. / Title from first page of PDF file. Document formatted into pages; contains x, 78 p.; also contains graphics. Vita. Includes bibliographical references (p. 76-77).

Thesis (M.S.)--Oregon Graduate Center, 1974.

M.S. / Applied Physics / Not available.

Thesis (M.S.)--University of Florida, 2001. / Title from first page of PDF file. Document formatted into pages; contains viii, 51 p.; also contains graphics. Vita. Includes bibliographical references (p. 49-50).

Thesis (M.S.)--California State University, Chico. / Includes abstract. "Located in the Chico Digital Repository." Includes bibliographical references (p. 48-52).