<p>In order to be competitive with emerging mobile systems and to satisfy the ever growing request for higher data rates, the 3G consortium, 3rd Generation Partnership Project (3GPP), is currently developing concepts for a long term evolution (LTE) of the 3G standard. The LTE-concept at Ericsson is based on Orthogonal Frequency Division Multiplexing (OFDM) as downlink air interface. OFDM enables the use of frequency domain link adaptation to select the most appropriate transmission parameters according to current channel conditions, in order to maximize the throughput and maintain the delay at a desired level. The purpose of this thesis work is to study, implement and evaluate different link adaptation algorithms. The main focus is on modulation adaptation, where the differences in performance between time domain and frequency domain adaptation are investigated. The simulations made in this thesis are made with a simulator developed at Ericsson. Simulations show in general that the cell throughput is enhanced by an average of 3% when using frequency domain modulation adaptation. When using the implemented frequency domain power allocation algorithm, a gain of 23-36% in average is seen in the users 5th percentile throughput. It should be noted that the simulations use a realistic web traffic model, which makes the channel quality estimation (CQE) difficult. The CQE has great impact on the performance of frequency domain adaptation. Throughput improvements are expected when using an improved CQE or interference avoidance schemes. The gains with frequency domain adaptation shown in this thesis work may be too small to motivate the extra signalling overhead required. The complexity of the implemented frequency domain power allocation algorithm is also very high compared to the performance enhancement seen.</p>

In recent years, mobile hotspots have been getting much attention of the researchers. They are implemented on moving platforms. Research interests in mobile hotspots are motivated by the demand of seamless mobility. The IEEE 802.16e or mobile WiMAX opens a new door of possibility of mobile broadband. It provides extended mobility support and larger cell coverage. In this thesis we propose a simple link adaptation (LA) algorithm for the mobile hotspots, which are supported by (mobile) WiMAX network. The role of link adaptation (LA) is very important because it controls the physical layer throughput. Therefore, all the higher layers are affected by LA. The main function of an LA algorithm is to select an appropriate burst profile. We consider downlink scenarios of WiMAX supported mobile hotspot. We formulate a discrete value optimization problem for LA, whose objective is throughput maximization. We choose forward error correction block rate (FBER) as constraint. The proposed LA algorithm comes as solution of the optimization problem. The proposed algorithm adapt with MAC layer performance. We develop a downlink channel estimation technique, propose an intra subchannel power allocation strategy, and propose an adaptive automatic repeat request (ARQ) mechanism as part of LA technique. We estimate SNR using channel estimation and intra subchannel power allocation. Then the estimated SNR is adjusted based on velocity of mobile hotspot. Adjusted SNR is used to select optimum burst profile. The performances of the proposed LA algorithm are evaluated through numerical results obtained from link level simulations. According to numerical results, the proposed LA algorithm is able to maintain a certain level quality of service (QoS).

In order to be competitive with emerging mobile systems and to satisfy the ever growing request for higher data rates, the 3G consortium, 3rd Generation Partnership Project (3GPP), is currently developing concepts for a long term evolution (LTE) of the 3G standard. The LTE-concept at Ericsson is based on Orthogonal Frequency Division Multiplexing (OFDM) as downlink air interface. OFDM enables the use of frequency domain link adaptation to select the most appropriate transmission parameters according to current channel conditions, in order to maximize the throughput and maintain the delay at a desired level. The purpose of this thesis work is to study, implement and evaluate different link adaptation algorithms. The main focus is on modulation adaptation, where the differences in performance between time domain and frequency domain adaptation are investigated. The simulations made in this thesis are made with a simulator developed at Ericsson. Simulations show in general that the cell throughput is enhanced by an average of 3% when using frequency domain modulation adaptation. When using the implemented frequency domain power allocation algorithm, a gain of 23-36% in average is seen in the users 5th percentile throughput. It should be noted that the simulations use a realistic web traffic model, which makes the channel quality estimation (CQE) difficult. The CQE has great impact on the performance of frequency domain adaptation. Throughput improvements are expected when using an improved CQE or interference avoidance schemes. The gains with frequency domain adaptation shown in this thesis work may be too small to motivate the extra signalling overhead required. The complexity of the implemented frequency domain power allocation algorithm is also very high compared to the performance enhancement seen.

In recent years, mobile hotspots have been getting much attention of the researchers. They are implemented on moving platforms. Research interests in mobile hotspots are motivated by the demand of seamless mobility. The IEEE 802.16e or mobile WiMAX opens a new door of possibility of mobile broadband. It provides extended mobility support and larger cell coverage. In this thesis we propose a simple link adaptation (LA) algorithm for the mobile hotspots, which are supported by (mobile) WiMAX network. The role of link adaptation (LA) is very important because it controls the physical layer throughput. Therefore, all the higher layers are affected by LA. The main function of an LA algorithm is to select an appropriate burst profile. We consider downlink scenarios of WiMAX supported mobile hotspot. We formulate a discrete value optimization problem for LA, whose objective is throughput maximization. We choose forward error correction block rate (FBER) as constraint. The proposed LA algorithm comes as solution of the optimization problem. The proposed algorithm adapt with MAC layer performance. We develop a downlink channel estimation technique, propose an intra subchannel power allocation strategy, and propose an adaptive automatic repeat request (ARQ) mechanism as part of LA technique. We estimate SNR using channel estimation and intra subchannel power allocation. Then the estimated SNR is adjusted based on velocity of mobile hotspot. Adjusted SNR is used to select optimum burst profile. The performances of the proposed LA algorithm are evaluated through numerical results obtained from link level simulations. According to numerical results, the proposed LA algorithm is able to maintain a certain level quality of service (QoS).

A network of n transmitters and n receivers is considered. We assume that transmitter i aims to send data to its designated destination, receiver i. Communications occur in a single-hop fashion and destination nodes are simple linear receivers without multi-user detection. Therefore, in each time slot every source node can only talk to one other destination node. Thus, there is a total of n communication links. An important question now arises. How many links can be active in such a network so that each of them supports a minimum rate Rmin? This dissertation is devoted to this problem and tries to solve it in two di erent settings, dense and extended networks. In both settings our approach is asymptotic, meaning, we only examine the behaviour of the network when the number of nodes tends to in nity. We are also interested in the events that occur asymptotically almost surely (a.a.s.), i.e., events that have probabilities approaching one as the size of the networks gets large. In the rst part of the thesis, we consider a dense network where fading is the dominant factor a ecting the quality of transmissions. Rayliegh channels are used to model the impact of fading. It is shown that a.a.s. log(n)^2 links can simultaneously maintain Rmin and thus be active. In the second part, an extended network is considered where nodes are distant from each other and thus, a more complete model must take internode distances into account. We will show that in this case, almost all of the links can be active while maintaining the minimum rate.

A packet will be dropped when it arrives at a congested node in a routing path. The authors of [22] proposed the CRP protocol that can alleviate the congestion problem by splitting the traffic to the bypass nodes. In this thesis, we propose a new routing protocol, called MIMO-assisted congestion-adaptive routing protocol (MCRP for short), for multi-hop mobile ad hoc networks (MANETs for short). In MCRP, nodes periodically record the information of their rate-link/range-link neighbors. MCRP alleviates the congestion problem by dynamically adjusting the MIMO antenna mode and splitting the traffic to the downstream range-link neighbors. In addition, MCRP can quickly reestablish the routing path when it is broken due to node failure or mobility. Simulation results show that MCRP outperforms the existing protocols in terms of packet delivery ratio and end-to-end throughput.

Variable frequency drives typically have employed dc voltage or current links for power distribution between the input and output converters and as a means to temporarily store energy. The dc link based power conversion systems have several inherent limitations. One of the important limitations is the high switching loss and high device stress which occur during switching intervals. This severely reduces the practical switching frequencies. Additionally, while the cost, size, and weight of the basic voltage sourced PWM drive is attractive, difficulties with input harmonics, output dV/dt and over-voltage, EMI/RFI, tripping with voltage sags, and other problems significantly diminish the economic competiveness of these drives. Add-ons are available to mitigate these problems, but may result in doubling or tripling the total costs and losses, with accompanying large increases in volume and weight. This research investigates the design, control, operation and efficiency calculation of a new power converter topology for medium and high power ac-ac, ac-dc and dc-ac applications. An ac-link formed by an inductor-capacitor pair replaces the conventional dc-link. Each leg of the converter is formed by two bidirectional switches. Power transfer from input to output is accomplished via a link inductor which is first charged from the input phases, then discharged to the output phases with a precisely controllable current PWM technique. Capacitance in parallel with the link inductor produces low turn-off losses. Turn-on is always at zero voltage as each switch swings from reverse to forward bias. Reverse recovery is with low dI/dt and also is buffered due to the link capacitance.

Multi-Protocol Label Switching (MPLS), a label swapping and forwarding technology proposed by IETF, is very suitable for the backbone of the next-generation Internet. MPLS has the advantages in improving the performance of network-layer routing and increasing network scalability as well. To provide more reliable delivery in MPLS networks, it is necessary for every label switch router (LSR) to perform a fast recovery mechanism after link failures. It is also required for an LSR to support the functions of failure detection, failure notification, and protection mechanisms in each label switched path (LSP). Therefore, different kinds of recovery schemes in previous literatures have been proposed to enhance the reliability of MPLS networks when a link failure occurs in the primary LSP. In this thesis, we focus on the comparisons of three famous recovery mechanisms, Makam, Haskin, and Hundessa approach. By investigating different locations of link failure, the influences of the three approaches individually on the TCP performance are our major concerns, especially under different TCP versions. Finally, we use the MPLS Network Simulator (MNS) to verify our observations. Four different TCP versions, including TCP-Tahoe, TCP-Reno, TCP-NewReno, and TCP-SACK, are employed in our simulator. From the simulation results, the characteristics of congestion control when using different TCP versions are discussed. Without applying fast retransmission and fast recovery, the average throughput of TCP-Tahoe is the smallest, as compared to that of other TCP versions. In addition, multiple packet losses in the period of link failures would largely downgrade the performance of average throughput, no matter which TCP version (TCP-NewReno or TCP-Reno) is employed. Using Makam approach, we found out that the average throughput becomes better when the location of link failures is close to the ingress node.

Kinematical indeterminate linkages are ones whose complete set of instant centers cannot be obtained graphically by the Kennedy¡¦s theorem. This article aims to graphically obtained the solutions for some of such linkages, using a concept of introducing a imaginary link, while not altering the degree of freedom, called imaginary link method. It is also possible to combine this scheme with Pennock¡¦s method to achieve greater applicability.

A growing number of IEEE 802.11-based wireless LANs have been set up in many public places in the recent years. These wireless LANs provide convenient network connectivity to users. Although mobile nodes allowed roaming across wireless LANs, handoff latency becomes an obstacle when mobile nodes migrate between different IP networks. Advanced, the link-layer handoff process disrupts the association when a mobile node moves from one access point to another. Even without discussing the latency of Mobility Protocols, this link-layer handoff latency already made many real time applications can not meet their requirements. In this dissertation, it is proposed three schemes to solve the problems occurred in the different network layers. These schemes not only reduce the latency of whole handoff procedure but also have no violation to the existing specifications in the IEEE 802.11 standard and compatible with existing devices. L2-Optimize and AIL used to minimize the duration of link-layer handoff. With LASP, Mobility handoff can be reduced to an acceptable situation. Therefore, even real time applications can meet their requirements when users are roaming across wireless LANs.