Results 1  10
of
453,494
On Minimum Power Connectivity Problems
"... Given a (directed or undirected) graph with edge costs, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of its nodes. Motivated by applications for wireless networks, we present polynomial and improved approximation algorithms, as we ..."
Abstract

Cited by 12 (6 self)
 Add to MetaCart
Given a (directed or undirected) graph with edge costs, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of its nodes. Motivated by applications for wireless networks, we present polynomial and improved approximation algorithms
Topology Control of Multihop Wireless Networks using Transmit Power Adjustment
, 2000
"... We consider the problem of adjusting the transmit powers of nodes in a multihop wireless network (also called an ad hoc network) to create a desired topology. We formulate it as a constrained optimization problem with two constraints connectivity and biconnectivity, and one optimization objective ..."
Abstract

Cited by 688 (3 self)
 Add to MetaCart
minimum power. We analyze the throughput, delay, and power consumption of our algorithms using a prototype software implementation, an emulation of a powercontrollable radio, and a detailed channel model. Our results show that the performance of multihop wireless networks in practice can be substantially
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 651 (18 self)
 Add to MetaCart
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
Approximating minimumpower kconnectivity
 Ad Hoc & Sensor Wireless Networks
, 2010
"... Abstract. The MinimumPower kConnected Subgraph (MPkCS) problem seeks a power (range) assignment to the nodes of a given wireless network such that the resulting communication (sub)network is kconnected and the total power is minimum. We give a new very simple approximation algorithm for this prob ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Abstract. The MinimumPower kConnected Subgraph (MPkCS) problem seeks a power (range) assignment to the nodes of a given wireless network such that the resulting communication (sub)network is kconnected and the total power is minimum. We give a new very simple approximation algorithm
Kinetic MinimumPower Routing and Clustering in
 Proc. Vehicular Tech. Conf
, 2002
"... We have previously developed a distributed routing algorithm which minimizes the number of overhead messages necessary to maintain the minimumpower multihop routes in a mobile adhoc network, assuming a piecewise linear model for the motion of the nodes. In this paper we extend the routing algori ..."
Abstract
 Add to MetaCart
We have previously developed a distributed routing algorithm which minimizes the number of overhead messages necessary to maintain the minimumpower multihop routes in a mobile adhoc network, assuming a piecewise linear model for the motion of the nodes. In this paper we extend the routing
Critical Power for Asymptotic Connectivity in Wireless Networks
, 1998
"... : In wireless data networks each transmitter's power needs to be high enough to reach the intended receivers, while generating minimum interference on other receivers sharing the same channel. In particular, if the nodes in the network are assumed to cooperate in routing each others ' pack ..."
Abstract

Cited by 541 (19 self)
 Add to MetaCart
: In wireless data networks each transmitter's power needs to be high enough to reach the intended receivers, while generating minimum interference on other receivers sharing the same channel. In particular, if the nodes in the network are assumed to cooperate in routing each others &apos
A simple distributed autonomous power control algorithm and its convergence
 IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY
, 1993
"... For wireless cellular communication systems, one seeks a simple effective means of power control of signals associated with randomly dispersed users that are reusing a single channel in different cells. By effecting the lowest interference environment, in meeting a required minimum signaltointerf ..."
Abstract

Cited by 477 (3 self)
 Add to MetaCart
For wireless cellular communication systems, one seeks a simple effective means of power control of signals associated with randomly dispersed users that are reusing a single channel in different cells. By effecting the lowest interference environment, in meeting a required minimum signal
Approximating minimum power edgemulticovers
"... Abstract. Given a graph with edge costs, the power of a node is the maximum cost of an edge incident to it, and the power of a graph is the sum of the powers of its nodes. Motivated by applications in wireless networks, we consider the following fundamental problem in wireless network design. Given ..."
Abstract
 Add to MetaCart
a graph G = (V,E) with edge costs and degree bounds {r(v) : v ∈ V}, the MinimumPower EdgeMultiCover (MPEMC) problem is to find a minimumpower subgraph J of G such that the degree of every node v in J is at least r(v). Let k = maxv∈V r(v). For k = Ω(logn), the previous best approximation ratio
Kinetic Spanning Trees for Minimum Power Routing in MANETS
"... Abstract — A distributed kinetic spanning tree algorithm is proposed for routing in wireless mobile ad hoc networks. Assuming a piecewise linear motion model for the nodes, the sequence of minimum power spanning trees is determined, while minimizing the number of routing messages required. ..."
Abstract
 Add to MetaCart
Abstract — A distributed kinetic spanning tree algorithm is proposed for routing in wireless mobile ad hoc networks. Assuming a piecewise linear motion model for the nodes, the sequence of minimum power spanning trees is determined, while minimizing the number of routing messages required.
Results 1  10
of
453,494