Results 1  10
of
795
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
; packets, as is the case in ad hoc wireless networks, each node should transmit with just enough power to guarantee connectivity in the network. Towards this end, we derive the critical power a node in the network needs to transmit in order to ensure that the network is connected with probability one
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
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
Approximating the Minimum Number of Maximum Power Users
 in Ad hoc Networks”, Mobile Networks and Applications
, 2006
"... Abstract. Topology control is the problem of assigning transmission power values to the nodes of an ad hoc network so that the induced graph satisfies some specified property. The most fundamental such property is that the network/graph be connected. For connectivity, prior work on topology control ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
/3 (exactly) approximation ratio. In addition, we present experimental results on randomly generated networks. Finally, based on the reduction to minimizing the total power problem, we outline some additional results for minimizing the number of maximum power users, both for graph properties other than
A Power Control MAC Protocol for Ad Hoc Networks
, 2002
"... This paper presents a power control MAC protocol that allows nodes to vary transmit power level on a perpacket basis. Several researchers have proposed simple modifications of IEEE 802.11 to incorporate power control. The main idea of these power control schemes is to use different power levels for ..."
Abstract

Cited by 210 (1 self)
 Add to MetaCart
for RTSCTS and DATAACK. Specifically, maximum transmit power is used for RTSCTS, and the minimum required transmit power is used for DATAACK transmissions in order to save energy. However, we show that these schemes can degrade network throughput and can result in higher energy consumption than when
Minimumenergy broadcast routing in static ad hoc wireless networks
, 2001
"... Abstract  Energy conservation is a critical issue in ad hoc wireless networks for node and network life, as the nodes are powered by batteries only. One major approach for energy conservation is to route a communication session along the routes which requires the lowest total energy consumption. Th ..."
Abstract

Cited by 138 (9 self)
 Add to MetaCart
Abstract  Energy conservation is a critical issue in ad hoc wireless networks for node and network life, as the nodes are powered by batteries only. One major approach for energy conservation is to route a communication session along the routes which requires the lowest total energy consumption
Constructing minimumenergy broadcast trees in wireless ad hoc networks
 In Proc. Int’l Symp. Mobile Ad hoc Networking and Computing
, 2002
"... In this paper we assume that a multihop wireless network (also called a wireless ad hoc network) consists of nodes whose transmitting powers are finitely adjustable. We consider two fundamental problems related to power consumption in this kind of network. One is the minimumenergy broadcast tree ..."
Abstract

Cited by 120 (7 self)
 Add to MetaCart
In this paper we assume that a multihop wireless network (also called a wireless ad hoc network) consists of nodes whose transmitting powers are finitely adjustable. We consider two fundamental problems related to power consumption in this kind of network. One is the minimumenergy broadcast tree
An analysis of the optimum node density for ad hoc mobile networks
 IN PROCEEDINGS OF THE IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS
, 2001
"... An ad hoc mobile network is a collection of nodes, each of which communicates over wireless channels and is capable of movement. Wireless nodes have the unique capability of transmission at different power levels. As the transmission power is varied, a tradeoff exists between the number of hops from ..."
Abstract

Cited by 203 (0 self)
 Add to MetaCart
An ad hoc mobile network is a collection of nodes, each of which communicates over wireless channels and is capable of movement. Wireless nodes have the unique capability of transmission at different power levels. As the transmission power is varied, a tradeoff exists between the number of hops
On Reducing Broadcast Redundancy in Ad Hoc Wireless Networks
, 2003
"... Unlike in a wired network, a packet transmitted by a node in an ad hoc wireless network can reach all neighbors. Therefore, the total number of transmissions (forward nodes) is generally used as the cost criterion for broadcasting. The problem of finding the minimum number of forward nodes is NPcomp ..."
Abstract

Cited by 158 (23 self)
 Add to MetaCart
Unlike in a wired network, a packet transmitted by a node in an ad hoc wireless network can reach all neighbors. Therefore, the total number of transmissions (forward nodes) is generally used as the cost criterion for broadcasting. The problem of finding the minimum number of forward nodes
Signal Stability based Adaptive Routing (SSA) for AdHoc Mobile Networks
 IEEE Personal Communications
, 1997
"... Unlike static networks, adhoc networks have no spatial hierarchy and suffer from frequent link failures which prevent mobile hosts from using traditional routing schemes. Under these conditions, mobile hosts must find routes to destinations without the use of designated routers and also must dynami ..."
Abstract

Cited by 165 (0 self)
 Add to MetaCart
Unlike static networks, adhoc networks have no spatial hierarchy and suffer from frequent link failures which prevent mobile hosts from using traditional routing schemes. Under these conditions, mobile hosts must find routes to destinations without the use of designated routers and also must
Local approximation schemes for ad hoc and sensor networks
 In Proc. 3rd Joint Workshop on Foundations of Mobile Computing (DialMPOMC
, 2005
"... We present two local approaches that yield polynomialtime approximation schemes (PTAS) for the Maximum Independent Set and Minimum Dominating Set problem in unit disk graphs. The algorithms run locally in each node and compute a (1 + ε)approximation to the problems at hand for any given ε> 0. ..."
Abstract

Cited by 40 (9 self)
 Add to MetaCart
We present two local approaches that yield polynomialtime approximation schemes (PTAS) for the Maximum Independent Set and Minimum Dominating Set problem in unit disk graphs. The algorithms run locally in each node and compute a (1 + ε)approximation to the problems at hand for any given ε> 0
Results 1  10
of
795