Results 1  10
of
406
A Framework for Uplink Power Control in Cellular Radio Systems
 IEEE Journal on Selected Areas in Communications
, 1996
"... In cellular wireless communication systems, transmitted power is regulated to provide each user an acceptable connection by limiting the interference caused by other users. Several models have been considered including: (1) fixed base station assignment where the assignment of users to base stations ..."
Abstract

Cited by 533 (18 self)
 Add to MetaCart
(Show Context)
In cellular wireless communication systems, transmitted power is regulated to provide each user an acceptable connection by limiting the interference caused by other users. Several models have been considered including: (1) fixed base station assignment where the assignment of users to base stations is fixed, (2) minimum power assignment where a user is iteratively assigned to the base station at which its signal to interference ratio is highest, and (3) diversity reception, where a user's signal is combined from several or perhaps all base stations. For the above models, the uplink power control problem can be reduced to finding a vector p of users' transmitter powers satisfying p I(p) where the jth constraint p j I j (p) describes the interference that user j must overcome to achieve an acceptable connection. This work unifies results found for these systems by identifying common properties of the interference constraints. It is also shown that systems in which transmitter powers ...
Joint Scheduling and Power Control for Wireless Adhoc Networks
, 2002
"... In this pape we introduce powe r control as a solution tothe multiple accel proble in conte tionbase wirenb adhocne works.The motivation for this study is two fold, limiting multiuse intej toincre single hop throughput, andrej powe r consumption to increj batte life We focus onne ne bor transmi ..."
Abstract

Cited by 247 (6 self)
 Add to MetaCart
(Show Context)
In this pape we introduce powe r control as a solution tothe multiple accel proble in conte tionbase wirenb adhocne works.The motivation for this study is two fold, limiting multiuse intej toincre single hop throughput, andrej powe r consumption to increj batte life We focus onne ne bor transmissions whes node are rej tose information packe  tothe re e e re e sub jej to a constraint on the signaltointealtoinjj ratio.The multiple acce  proble is solve via twoaltej phase name schej and powe r control.The sche algorithm isej tial to coordinate the transmissions ofinde ede t use inorde toejj strong intej (e.g selfinterference) that can not be ove by powe r control. On the othe hand, powe r control isej in adistribute fashion to dej the admissible powe r ve ifone ene that can be use bythe sche use to satisfy thei singlej transmissionrensmissi ts. This isdone for two type s ofne works, namej TDMA and TDMA/CDMA wire/CD adhocne works.
Optimal Routing, Link Scheduling and Power Control in Multihop Wireless Networks
, 2003
"... In this paper, we study the problem of joint routing, link scheduling and power control to support high data rates for broadband wireless multihop networks. We first address the problem of finding an optimal link scheduling and power control policy that minimizes the total average transmission powe ..."
Abstract

Cited by 182 (0 self)
 Add to MetaCart
In this paper, we study the problem of joint routing, link scheduling and power control to support high data rates for broadband wireless multihop networks. We first address the problem of finding an optimal link scheduling and power control policy that minimizes the total average transmission power in the wireless multihop network, subject to given constraints regarding the minimum average data rate per link, as well as peak transmission power constraints per node. Multiaccess signal interference is explicitly modeled. We use a duality approach whereby, as a byproduct of finding the optimal policy, we find the sensitivity of the minimal total average power with respect to the average data rate for each link. Since the minimal total average power is a convex function of the required minimum average data rates, shortest path algorithms with the link weights set to the link sensitivities can be used to guide the search for a globally optimum routing. We present a few simple examples that show our algorithm can find policies that support data rates that are not possible with conventional approaches. Moreover, we find that optimum allocations do not necessarily route traffic over minimum energy paths.
Energyefficient Transmission over a Wireless Link via Lazy Packet Scheduling
 in Proceedings of IEEE INFOCOM
, 2001
"... The paper considers the problem of m'mimizing the energy used to transmit packets over a wireless link via/azy schedules that judiciously vary packet transmission times. The problem is motivated by the following key observation: In many channel coding schemes, the energy required to transmit a ..."
Abstract

Cited by 131 (2 self)
 Add to MetaCart
(Show Context)
The paper considers the problem of m'mimizing the energy used to transmit packets over a wireless link via/azy schedules that judiciously vary packet transmission times. The problem is motivated by the following key observation: In many channel coding schemes, the energy required to transmit a packet can be significantly reduced by lowering transmission power and transmitting the packet over a longer period of time. However, information is often timecritical or delaysensitive and transmission times cannot be made arbitrarily long. We therefore consider packet transmission schedules that minimize energy subject to a deadline or a delay constraint. Specifically, we obtain an optimal offiine schedule for a node operating under a deadline constraint. An inspection of the form of this schedule naturally leads us to an online schedule which is shown, through simulations, to be energyefficient. Finally, we relax the deadline constraint and provide an exact probabilistic analysis of our oilline scheduling algoritlun. We then devise a lazy online algoritlun that varies transmission times according to backlog and show that it is more energy efficient than a deterministic schedule that guarantees stability for the same range of arrival rates.
A Tutorial on Decomposition Methods for Network Utility Maximization
 IEEE J. Sel. Areas Commun
, 2006
"... Abstract—A systematic understanding of the decomposability structures in network utility maximization is key to both resource allocation and functionality allocation. It helps us obtain the most appropriate distributed algorithm for a given network resource allocation problem, and quantifies the com ..."
Abstract

Cited by 130 (4 self)
 Add to MetaCart
(Show Context)
Abstract—A systematic understanding of the decomposability structures in network utility maximization is key to both resource allocation and functionality allocation. It helps us obtain the most appropriate distributed algorithm for a given network resource allocation problem, and quantifies the comparison across architectural alternatives of modularized network design. Decomposition theory naturally provides the mathematical language to build an analytic foundation for the design of modularized and distributed control of networks. In this tutorial paper, we first review the basics of convexity, Lagrange duality, distributed subgradient method, Jacobi and Gauss–Seidel iterations, and implication of different time scales of variable updates. Then, we introduce primal, dual, indirect, partial, and hierarchical decompositions, focusing on network utility maximization problem formulations and the meanings of primal and dual decompositions in terms of network architectures. Finally, we present recent examples on: systematic search for alternative decompositions; decoupling techniques for coupled objective functions; and decoupling techniques for coupled constraint sets that are not readily decomposable. Index Terms—Congestion control, crosslayer design, decomposition, distributed algorithm, network architecture, network control by pricing, network utility maximization, optimization, power control, resource allocation. I.
Multihop diversity in wireless relaying channels
 IEEE Trans. on Communications
"... Abstract—This paper presents theoretical characterizations and analysis for the physical layer of multihop wireless communications channels. Four channel models are considered and developed: the decoded relaying multihop channel; the amplified relaying multihop channel; the decoded relaying multihop ..."
Abstract

Cited by 129 (22 self)
 Add to MetaCart
Abstract—This paper presents theoretical characterizations and analysis for the physical layer of multihop wireless communications channels. Four channel models are considered and developed: the decoded relaying multihop channel; the amplified relaying multihop channel; the decoded relaying multihop diversity channel; and the amplified relaying multihop diversity channel. Two classifications are discussed: decoded relaying versus amplified relaying, and multihop channels versus multihop diversity channels. The channel models are compared, through analysis and simulations, with the “singlehop ” (direct transmission) reference channel on the basis of signaltonoise ratio, probability of outage, probability of error, and optimal power allocation. Each of the four channel models is shown to outperform the singlehop reference channel under the condition that the set of intermediate relaying terminals is selected intelligently. Multihop diversity channels are shown to outperform multihop channels. Amplified relaying is shown to outperform decoded relaying despite noise propagation. This is attributed to the fact that amplified relaying does not suffer from the error propagation which limits the performance of decoded relaying channels to that of their weakest link. Index Terms—Adhoc networks, cooperative diversity, diversity techniques, mesh networks, multihop channels, multihop diversity, wireless relaying. I.
Gamal, “Energyefficient packet transmission over a wireless link
 IEEE/ACM Trans. Networking
, 2002
"... Abstract—The paper considers the problem of minimizing the energy used to transmit packets over a wireless link via lazy schedules that judiciously vary packet transmission times. The problem is motivated by the following observation. With many channel coding schemes, the energy required to transmit ..."
Abstract

Cited by 125 (2 self)
 Add to MetaCart
(Show Context)
Abstract—The paper considers the problem of minimizing the energy used to transmit packets over a wireless link via lazy schedules that judiciously vary packet transmission times. The problem is motivated by the following observation. With many channel coding schemes, the energy required to transmit a packet can be significantly reduced by lowering transmission power and code rate, and therefore transmitting the packet over a longer period of time. However, information is often timecritical or delaysensitive and transmission times cannot be made arbitrarily long. We therefore consider packet transmission schedules that minimize energy subject to a deadline or a delay constraint. Specifically, we obtain an optimal offline schedule for a node operating under a deadline constraint. An inspection of the form of this schedule naturally leads us to an online schedule which is shown, through simulations, to perform closely to the optimal offline schedule. Taking the deadline to infinity, we provide an exact probabilistic analysis of our offline scheduling algorithm. The results of this analysis enable us to devise a lazy online algorithm that varies transmission times according to backlog. We show that this lazy schedule is significantly more energyefficient compared to a deterministic (fixed transmission time) schedule that guarantees queue stability for the same range of arrival rates. Index Terms—Minimum energy transmission, optimal schedules, power control, wireless LAN. I.
Integrated Power Control and Base Station Assignment
 IEEE Transactions on Vehicular Technology
, 1995
"... In cellular wireless communication systems, transmitted power is regulated to provide each user an acceptable connection while limiting the interference seen by other users. Previous work has focused on maximizing the minimum carrier to interference ratio (CIR) or attaining a common CIR over all rad ..."
Abstract

Cited by 118 (12 self)
 Add to MetaCart
(Show Context)
In cellular wireless communication systems, transmitted power is regulated to provide each user an acceptable connection while limiting the interference seen by other users. Previous work has focused on maximizing the minimum carrier to interference ratio (CIR) or attaining a common CIR over all radio links. However, previous work has assumed the assignment of mobiles to base stations is known and fixed. In this work, we integrate power control and base station assignment. In the context of a CDMA system, we consider the minimization of the total transmitted uplink power subject to maintaining an individual target CIR for each mobile. This minimization occurs over the set of power vectors and base station assignments. We show that this problem has special structure and identify synchronous and asynchronous distributed algorithms that find the optimal power vector and base station assignment. Keywords Power control, Cellular radio, CDMA, Handoff, Base station assignment I. Introduct...
Joint optimal power control and beamforming for wireless networks with antenna arrays
 in Proc. IEEE Global Telecommunications Conf. (GLOBECOM’96
, 1996
"... Abstract — The interference reduction capability of antenna arrays and the power control algorithms have been considered separately as means to increase the capacity in wireless communication networks. The minimum variance distortionless response beamformer maximizes the signaltointerferenceandn ..."
Abstract

Cited by 116 (22 self)
 Add to MetaCart
Abstract — The interference reduction capability of antenna arrays and the power control algorithms have been considered separately as means to increase the capacity in wireless communication networks. The minimum variance distortionless response beamformer maximizes the signaltointerferenceandnoise ratio (SINR) when it is employed in the receiver of a wireless link. In a system with omnidirectional antennas, power control algorithms are used to maximize SINR as well. In this paper, we consider a system with beamforming capabilities in the receiver, and power control. An iterative algorithm is proposed to jointly update the transmission powers and the beamformer weights so that it converges to the jointly optimal beamforming and transmission power vector. The algorithm is distributed and uses only local interference measurements. In an uplink transmission scenario, it is shown how base assignment can be incorporated in addition to beamforming and power control, such that a globally optimum solution is obtained. The network capacity and the saving in mobile power are evaluated through numerical study. Index Terms — Adaptive beamforming, power control, spacedivision multiple access.
Stochastic power control for cellular radio systems
 IEEE Transactions on Communications
, 1998
"... ..."