Search

Reverse link capacity of a direct-sequence code-division multiple-access (DS-CDMA) system in a multicell environment has been studied recently, and significant capacity improvements due to the use of beamforming have been observed. However, system performance with beamforming will be affected by several impairments, such as direction of arrival estimation errors, array perturbations, mutual coupling, and signal spatial spreads. In this paper, reverse link performance of CDMA systems with beamforming under these impairments (imperfect beamforming) is investigated. A simplified beamforming model is developed to evaluate the system performance in terms of user capacity, bit-error rates (BER), and outage probabilities. Both signal-to-interference-ratio-based power control and strength-based power control are considered in this paper. The capacity and BER degradations due to different impairments are shown, and outage probabilities under different power control schemes are examined. [ABSTRACT FROM AUTHOR]

Joint scheduling and power control schemes have previously been proposed to reduce power dissipation in wireless ad hoc networks. However, instead of power consumption, throughput is a more important performance concern for some emerging multihop wireless networks, such as wireless mesh networks. This paper examines joint link scheduling and power control with the objective of throughput improvement. The MAximum THroughput link Scheduling with Power Control (MATH-SPC) problem is first formulated and then a mixed integer linear programming (MILP) formulation is presented to provide optimal solutions. However, simply maximizing the throughput may lead to a severe bias on bandwidth allocation among links. To achieve a good tradeoff between throughput and fairness, a new parameter called the demand satisfaction factor (DSF) to characterize the fairness of bandwidth allocation and formulate the MAximum Throughput fAir link Scheduling with Power Control (MATA-SPC) problem is defined. An MILP formulation and an effective polynomial-time heuristic algorithm, namely, the serial linear programming rounding (SLPR) heuristic, to solve the MATA-SPC problem are also presented. Numerical results show that bandwidth can be fairly allocated among all links/flows by solving the MILP formulation or by using the heuristic algorithm at the cost of a minor reduction of network throughput. In addition, extensions to end-to-end throughput and fairness and multiradio wireless multihop networks are discussed. [ABSTRACT FROM AUTHOR]