Results 1  10
of
283
Cooperative strategies and capacity theorems for relay networks
 IEEE TRANS. INFORM. THEORY
, 2005
"... Coding strategies that exploit node cooperation are developed for relay networks. Two basic schemes are studied: the relays decodeandforward the source message to the destination, or they compressandforward their channel outputs to the destination. The decodeandforward scheme is a variant of ..."
Abstract

Cited by 739 (19 self)
 Add to MetaCart
Coding strategies that exploit node cooperation are developed for relay networks. Two basic schemes are studied: the relays decodeandforward the source message to the destination, or they compressandforward their channel outputs to the destination. The decodeandforward scheme is a variant of multihopping, but in addition to having the relays successively decode the message, the transmitters cooperate and each receiver uses several or all of its past channel output blocks to decode. For the compressandforward scheme, the relays take advantage of the statistical dependence between their channel outputs and the destination’s channel output. The strategies are applied to wireless channels, and it is shown that decodeandforward achieves the ergodic capacity with phase fading if phase information is available only locally, and if the relays are near the source node. The ergodic capacity coincides with the rate of a distributed antenna array with full cooperation even though the transmitting antennas are not colocated. The capacity results generalize broadly, including to multiantenna transmission with Rayleigh fading, singlebounce fading, certain quasistatic fading problems, cases where partial channel knowledge is available at the transmitters, and cases where local user cooperation is permitted. The results further extend to multisource and multidestination networks such as multiaccess and broadcast relay channels.
The impact of imperfect scheduling on crosslayer congestion control in wireless networks
, 2005
"... In this paper, we study crosslayer design for congestion control in multihop wireless networks. In previous work, we have developed an optimal crosslayer congestion control scheme that jointly computes both the rate allocation and the stabilizing schedule that controls the resources at the under ..."
Abstract

Cited by 349 (32 self)
 Add to MetaCart
In this paper, we study crosslayer design for congestion control in multihop wireless networks. In previous work, we have developed an optimal crosslayer congestion control scheme that jointly computes both the rate allocation and the stabilizing schedule that controls the resources at the underlying layers. However, the scheduling component in this optimal crosslayer congestion control scheme has to solve a complex global optimization problem at each time, and is hence too computationally expensive for online implementation. In this paper, we study how the performance of crosslayer congestion control will be impacted if the network can only use an imperfect (and potentially distributed) scheduling component that is easier to implement. We study both the case when the number of users in the system is fixed and the case with dynamic arrivals and departures of the users, and we establish performance bounds of crosslayer congestion control with imperfect scheduling. Compared with a layered approach that does not design congestion control and scheduling together, our crosslayer approach has provably better performance bounds, and substantially outperforms the layered approach. The insights drawn from our analyses also enable us to design a fully distributed crosslayer congestion control and scheduling algorithm for a restrictive interference model.
A tutorial on crosslayer optimization in wireless networks
 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS
, 2006
"... This tutorial paper overviews recent developments in optimization based approaches for resource allocation problems in wireless systems. We begin by overviewing important results in the area of opportunistic (channelaware) scheduling for cellular (singlehop) networks, where easily implementable my ..."
Abstract

Cited by 248 (29 self)
 Add to MetaCart
(Show Context)
This tutorial paper overviews recent developments in optimization based approaches for resource allocation problems in wireless systems. We begin by overviewing important results in the area of opportunistic (channelaware) scheduling for cellular (singlehop) networks, where easily implementable myopic policies are shown to optimize system performance. We then describe key lessons learned and the main obstacles in extending the work to general resource allocation problems for multihop wireless networks. Towards this end, we show that a cleanslate optimization based approach to the multihop resource allocation problem naturally results in a “loosely coupled” crosslayer solution. That is, the algorithms obtained map to different layers (transport, network, and MAC/PHY) of the protocol stack are coupled through a limited amount of information being passed back and forth. It turns out that the optimal scheduling component at the MAC layer is very complex and thus needs simpler (potentially imperfect) distributed solutions. We demonstrate how to use imperfect scheduling in the crosslayer framework and describe recently developed distributed algorithms along these lines. We conclude by describing a set of open research problems.
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 194 (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.
the relationship between capacity and distance in an underwater acoustic communication channel
 ACM SIGMOBILE Mobile Computing and Communications Review (MC2R), vol.11, Issue
, 2007
"... Path loss of an underwater acoustic communication channel depends not only on the transmission distance, but also on the signal frequency. As a result, the useful bandwidth depends on the transmission distance, a feature that distinguishes an underwater acoustic system from a terrestrial radio one. ..."
Abstract

Cited by 169 (34 self)
 Add to MetaCart
(Show Context)
Path loss of an underwater acoustic communication channel depends not only on the transmission distance, but also on the signal frequency. As a result, the useful bandwidth depends on the transmission distance, a feature that distinguishes an underwater acoustic system from a terrestrial radio one. This fact influences the design of an acoustic network: a greater information throughput is available if messages are relayed over multiple short hops instead of being transmitted directly over one long hop. We asses the bandwidth dependency on the distance using an analytical method that takes into account physical models of acoustic propagation loss and ambient noise. A simple, singlepath timeinvariant model is considered as a first step. To assess the fundamental bandwidth limitation, we take an informationtheoretic approach and define the bandwidth corresponding to optimal signal energy allocation – one that maximizes the channel capacity subject to the constraint that the transmission power is finite. Numerical evaluation quantifies the bandwidth and the channel capacity, as well as the transmission power needed to achieve a prespecified SNR threshold, as functions of distance. These results lead to closedform approximations, which may become useful tools in the design and analysis of acoustic networks. I.
Joint rate control and scheduling in multihop wireless networks
 IN PROCEEDINGS OF IEEE CONFERENCE ON DECISION AND CONTROL
, 2004
"... We study the joint problem of allocating data rates and finding a stabilizing scheduling policy in a multihop wireless network. We propose a dual optimization based approach through which the rate control problem and the scheduling problem can be decomposed. We demonstrate via both analytical and n ..."
Abstract

Cited by 159 (13 self)
 Add to MetaCart
(Show Context)
We study the joint problem of allocating data rates and finding a stabilizing scheduling policy in a multihop wireless network. We propose a dual optimization based approach through which the rate control problem and the scheduling problem can be decomposed. We demonstrate via both analytical and numerical results that the proposed mechanism can fully utilize the capacity of the network, maintain fairness, and improve the quality of service to the users.
Optimal Energy Management Policies for Energy Harvesting Sensor Nodes
"... We study a sensor node with an energy harvesting source. The generated energy can be stored in a buffer. The sensor node periodically senses a random field and generates a packet. These packets are stored in a queue and transmitted using the energy available at that time. We obtain energy management ..."
Abstract

Cited by 132 (4 self)
 Add to MetaCart
We study a sensor node with an energy harvesting source. The generated energy can be stored in a buffer. The sensor node periodically senses a random field and generates a packet. These packets are stored in a queue and transmitted using the energy available at that time. We obtain energy management policies that are throughput optimal, i.e., the data queue stays stable for the largest possible data rate. Next we obtain energy management policies which minimize the mean delay in the queue. We also compare performance of several easily implementable suboptimal energy management policies. A greedy policy is identified which, in low SNR regime, is throughput optimal and also minimizes mean delay.
Large wireless networks under fading, mobility, and delay constraints
 in Proc. IEEE INFOCOM, Hong Kong
, 2004
"... Abstract — We study wireless ad hoc networks with a large number of nodes, following the line of investigation initiated in [1] and continued in [2]. We first focus on a network of n immobile nodes, each with a destination node chosen in random. We develop a scheme under which, in the absence of fad ..."
Abstract

Cited by 116 (8 self)
 Add to MetaCart
(Show Context)
Abstract — We study wireless ad hoc networks with a large number of nodes, following the line of investigation initiated in [1] and continued in [2]. We first focus on a network of n immobile nodes, each with a destination node chosen in random. We develop a scheme under which, in the absence of fading, the network can provide each node with a traffic rate λ1(n) =K1(n log n) − 1 2. This result was first shown in [1] under a similar setting, however the proof presented here is shorter and uses only basic probability tools. We then proceed to show that, under a general model of fading, each node can send data to its destination with a rate λ2(n) = K2n − 1 2 (log n) − 3 2. Next, we extend our formulation to study the effects of node mobility. We first develop a simple scheme under which each of the n mobile nodes can send data to a randomly chosen destination node with a rate λ3(n) =K3n − 1 2 (log n) − 3 2,andwith a fixed upper bound on the packet delay dmax that does not depend on n. We subsequently develop a scheme under which each of the nodes can send data to its destination with a rate λ4(n) =K4n d−1 2 (log n) − 5 2, provided that nodes are willing to tolerate packet delays smaller than dmax(n) < K5n d, where 0 <d<1. With both schemes, a general model of fading is assumed. In addition, nodes require no global topology or routing information, and only need to coordinate locally. The above results hold for an appropriate choice of values for the constants Ki, and with probability approaching 1 as the number of nodes n approaches infinity.
The effect of fading, channel inversion, and threshold scheduling on ad hoc networks
 IEEE TRANS. INF. THEORY
, 2007
"... This paper addresses three issues in the field of ad hoc network capacity: the impact of i) channel fading, ii) channel inversion power control, and iii) threshold–based scheduling on capacity. Channel inversion and threshold scheduling may be viewed as simple ways to exploit channel state informat ..."
Abstract

Cited by 91 (29 self)
 Add to MetaCart
(Show Context)
This paper addresses three issues in the field of ad hoc network capacity: the impact of i) channel fading, ii) channel inversion power control, and iii) threshold–based scheduling on capacity. Channel inversion and threshold scheduling may be viewed as simple ways to exploit channel state information (CSI) without requiring cooperation across transmitters. We use the transmission capacity (TC) as our metric, defined as the maximum spatial intensity of successful simultaneous transmissions subject to a constraint on the outage probability (OP). By assuming the nodes are located on the infinite plane according to a Poisson process, we are able to employ tools from stochastic geometry to obtain asymptotically tight bounds on the distribution of the signaltointerference (SIR) level, yielding in turn tight bounds on the OP (relative to a given SIR threshold) and the TC. We demonstrate that in the absence of CSI, fading can significantly reduce the TC and somewhat surprisingly, channel inversion only makes matters worse. We develop a thresholdbased transmission rule where transmitters are active only if the channel to their receiver is acceptably strong, obtain expressions for the optimal threshold, and show that this simple, fully distributed scheme can significantly reduce the effect of fading.