Future wireless networks will be required to support multimedia traffic in addition to traditional best-effort network services. Supporting multimedia traffic on wired networks presents a large number of design problems, particularly for networks that run connectionless data transport protocols such as the TCP/IP protocol suite. These problems are magnified for wireless links, as the quality of such links varies widely and uncontrollably. This dissertation presents new tools developed for the design and realization of wireless networks including, for the first time, analytical channel models for predicting the efficacy of error control codes, interleaving schemes, and signalling protocols, and several novel algorithms for matching and adapting system parameters (such as error control and frame length) to time-varying channels and Quality of Service (QoS) requirements.

Wireless communication is witnessing tremendous growth with the proliferation of various standards covering wide, local, and personal area networks, which operate at different frequency bands. Future wireless terminals will not only need to support multiple standards, but also need to be multi-functional to keep pace with the demands of the consumers. For such an implementation, the local oscillator (LO) turns out to be the bottleneck, which must exhibit frequency agility by generating a very wide range of carrier frequencies in order to access all the specified communication standards. This dissertation presents various design techniques to realize compact low-cost low-power and broadband oscillators in silicon-based technologies. The two most suitable techniques for broadband signal generation: (1) Use of widely tunable active inductor, and (2) Use of switched resonator have been thoroughly evaluated. A fully reconfigurable active inductor with a widely tunable feedback resistor has been proposed. Using the proposed tunable active inductor in a VCO generates frequency tuning ranges higher than 100%, and helps achieve the highest PFTN Figure-of-Merit among Si-based active inductor VCOs reported in literature till date. The large-signal non-linearity of the active inductor has been utilized to develop the first reported broadband harmonic active inductor-based VCO. The degradation of phase noise due to active inductors is partially solved by a noise optimization guideline for active inductors. Utilizing the low saturation voltage of HBT technologies and high-Q short line inductors seems to be very useful to reduce power consumption of cross-coupled VCOs while achieving low phase noise performance simultaneously.

In this thesis, we investigate cooperation by applying OFDM signals to cooperative relay networks. We consider the single path relay network and the multiple path relay network. Using the amplify-and-forward relay algorithm, we derive the input-output relations and mutual informations of both networks. Using a power constraint at each relay, we consider two relay power allocation schemes. The first is constant gain allocation, where the amplifying gain used in the amplify-and-forward algorithm is constant for all subcarriers. The second is equal power allocation, where each subcarrier transmits the same power. The former scheme does not require CSI (channel state information), while the latter one does. We simulate the mutual informations using the two relay power allocation schemes. Results indicate that equal power allocation gives a slightly higher mutual information for the single path relay network. For the multiple path network, the mutual information is practically the same for both schemes. Using the decode-and-forward relay algorithm, we derive the input-output relations for both networks. The transmitter and each relay are assumed to have uniform power distributions in this case. We simulate the BER (bit error rate) and WER (word error rate) performance for the two networks using both the amplify-and-forward and decode-and-forward relay algorithms. For the single path relay network, amplify-and-forward gives very poor performance, because as we increase the distance between the transmitter and receiver (and thus, add more relays), more noise and channel distortion enter the system. Decode-and-forward gives significantly better performance because noise and channel distortion are eliminated at each relay. For the multiple path relay network, decode-and-forward again gives better performance than amplify-and-forward. However, the performance gains are small compared to the single path relay network case. Therefore, amplify-and-forward may be a more attractive choice due to its lower complexity.

Next generation wireless systems have an IP-based infrastructure with the support of heterogeneous access technologies. One research challenge for next generation all-IP based wireless systems is to design intelligent mobility management techniques that take advantage of IP-based technologies to achieve global roaming between various access networks. To support global roaming, next generation wireless systems require the integration and interoperation of heterogeneous mobility management techniques. Mobility in a hierarchical structure or multilayered environment should be supported. The objective of this study is to develop new mobility management techniques for global roaming support in next generation all-IP based wireless systems. More specifically, new schemes for location management and paging in Mobile IP for network layer mobility support, and new schemes for location management and handoff management in heterogeneous overlay networks for link layer mobility support are proposed and evaluated. For network layer mobility support, a distributed and dynamic regional location management mechanism for Mobile IP is proposed. Under the proposed scheme, the signaling burden is evenly distributed and the regional network boundary is dynamically adjusted according to the up-to-date mobility and traffic load for each terminal. Next, a user independent paging scheme based on last-known location and mobility rate information for Mobile IP is proposed. The proposed scheme takes the aggregated behavior of all mobile users as the basis for paging. For link layer mobility support, an IP-based system architecture for the integration of heterogeneous mobility management techniques is proposed. Three location management schemes under this IP-based architecture are proposed. All the three schemes support user preference call delivery which is a very important feature of next generation wireless communications. A threshold-based enhancement method is also proposed to further improve the system performance. Finally, a hybrid resource allocation scheme for handoff management in wireless overlay networks is proposed. Under this scheme, the overall system resources can be optimally allocated when mobile users are covered by multiple overlay networks.

Software radios (SWR) have been proposed for wireless communication systems to enable them to operate according to incompatible wireless communication standards by implementing most analog functions in the digital section on software-reprogrammable hardware. However, this significantly increases the required computations for SWR functionality, mainly because of the digital front-end computationally intensive filtering functions, such as sample rate conversion (SRC), channelization, and equalization. For increasing the computational efficiency of SWR systems, two new SRC methods with better performance than conventional SRC methods are presented. In the first SRC method, we modify the conventional CIC filters to enable them to perform SRC on slightly oversampled signals efficiently. We also describe a SRC method with high efficiency for SRC by factors greater than unity at which SRC in SWR systems may be computationally demanding. This SRC method efficiently increases the sample rate of wideband signals, especially in SWR base station transmitters, by applying Lagrange interpolation for evaluating output samples hierarchically using a low-rate signal that is computed with low cost from the input signal. A new channelizer/synthesizer is also developed for extracting/combining frequency multiplexed channels in SWR transceivers. The efficiency of this channelizer/synthesizer, which uses modulated perfect reconstruction (PR) filter banks, is higher than polyphase filter banks (when applicable) for processing few channels, and significantly higher than discrete filter banks for processing any number of variable-bandwidth channels where polyphase filter banks are inapplicable. Because the available methods for designing modulated PR filter banks are inapplicable due to the required number of subchannels and stopband attenuation of the prototype filters, a new design method for these filter banks is introduced. This method is reliable and significantly faster than the existing methods. Modulated PR filter banks are also considered for implementing a frequency-domain block blind equalizer capable of equalizing SWR signals transmitted though channels with long impulse responses and severe intersymbol interference (ISI). This blind equalizer adapts by using separate sets of weights to correct for the magnitude and phase distortion of the channel. The adaptation of this blind equalizer is significantly more reliable and its computational requirements increase at a lower rate compared to conventional time-domain equalizers making it efficient for equalizing long channels that exhibit severe ISI.

Peer-to-peer networks and mobile ad hoc networks are emerging distributed networks that share several similarities. Fundamental among these similarities is the decentralized role of each participating node to route messages on behalf of other nodes, and thereby, collectively realizing communication between any pair of nodes. Messages are routed on a topology graph that is determined by the peer relationship between nodes. Although routing is fairly straightforward when the topology graph is static, dynamic variations in the peer relationship that often occur in peer-to-peer and mobile ad hoc networks present challenges to routing. In this thesis, we examine the interplay between routing messages and network topology design in two classes of these networks -- unstructured peer-to-peer networks and sparsely-connected mobile ad hoc networks. In unstructured peer-to-peer networks, we add structure to overlay topologies to support file sharing. Specifically, we investigate the advantages of designing overlay topologies with small-world properties to improve (a) search protocol performance and (b) network utilization. We show, using simulation, that "small-world-like" overlay topologies where every node has many close neighbors and few random neighbors exhibit high chances of locating files close to the source of file search query. This improvement in search protocol performance is achieved while decreasing the traffic load on the links in the underlying network. In the context of sparsely-connected mobile ad hoc networks where nodes provide connectivity via mobility, we present a protocol for routing in space and time where the message forwarding decision involves not only where to forward (space), but also when to forward (time). We introduce space-time routing tables and develop methods to compute these routing tables for those instances of ad hoc networks where node mobility is predictable over either a finite horizon or indefinitely due to periodicity in node motion. Furthermore, when the node mobility is unpredictable, we investigate several forwarding heuristics to address the scarcity in transmission opportunities in these sparsely-connected ad hoc networks. In particular, we present the advantages of fragmenting messages and augmenting them with erasure codes to improve the end-to-end message delivery performance.