Results 1 - 10 of 2,213

Dynamic Power Allocation and Routing for Time Varying Wireless Networks

by Michael J. Neely, Eytan Modiano, Charles E. Rohrs - IEEE Journal on Selected Areas in Communications , 2003
"... We consider dynamic routing and power allocation for a wireless network with time varying channels. The network consists of power constrained nodes which transmit over wireless links with adaptive transmission rates. Packets randomly enter the system at each node and wait in output queues to be tran ..."
Abstract - Cited by 358 (73 self) - Add to MetaCart
-hoc wireless network where channel variations are due to user mobility, and compare its performance with the Grossglauser-Tse relay model developed in [13].

Geographic random forwarding (GeRaF) for ad hoc and sensor networks: Energy and latency performance

by Michele Zorzi, Ramesh R. Rao - IEEE TRANSACTIONS ON MOBILE COMPUTING , 2003
"... In this paper, we study a novel forwarding technique based on geographical location of the nodes involved and random selection of the relaying node via contention among receivers. We provide a detailed description of a MAC scheme based on these concepts and on collision avoidance and report on its e ..."
Abstract - Cited by 368 (15 self) - Add to MetaCart
In this paper, we study a novel forwarding technique based on geographical location of the nodes involved and random selection of the relaying node via contention among receivers. We provide a detailed description of a MAC scheme based on these concepts and on collision avoidance and report on its

Throughput-Delay Trade-off in Wireless Networks

by Abbas El Gamal, James Mammen, Balaji Prabhakar, Devavrat Shah - IEEE TRANS. ON INFORM. TH , 2006
"... ...network model for studying the way throughput scales in a wireless network when the nodes are fixed, and showed that the throughput per source-destination pair is... Grossglauser and Tse (2001) showed that when nodes are mobile it is possible to have a constant or throughput scaling per source-de ..."
Abstract - Cited by 242 (12 self) - Add to MetaCart
respectively. For the Grossglauser-Tse mobile network model, we show that the delay scales as, where,.# is the velocity of the mobile nodes. We then describe a scheme that achieves the optimal order of delay for any given throughput. The scheme varies (i) the number of hops, (ii) the transmission range

On The Capacity Of Wireless Networks: The Relay Case

by Michael Gastpar, Martin Vetterli - in Proc. IEEE INFOCOM , 2002
"... In [1], Gupta and Kumar determined the capacity of wireless networks under certain assumptions, among them point-to-point coding, which excludes for example multi-access and broadcast codes. In this paper, we consider essentially the same physical model of a wireless network under a different traffi ..."
Abstract - Cited by 233 (11 self) - Add to MetaCart
traffic pattern, namely the relay traffic pattern, but we allow for arbitrarily complex network coding. In our model, there is only one active source/destination pair, while all other nodes assist this transmission. We show code constructions leading to achievable rates and derive upper bounds from

Wireless Network Information Flow: A Deterministic Approach

by A. Salman Avestimehr, et al. , 2009
"... In contrast to wireline networks, not much is known about the flow of information over wireless networks. The main barrier is the complexity of the signal interaction in wireless channels in addition to the noise in the channel. A widely accepted model is the the additive Gaussian channel model, and ..."
Abstract - Cited by 296 (42 self) - Add to MetaCart
, and for this model, the capacity of even a network with a single relay node is open for 30 years. In this paper, we present a deterministic approach to this problem by focusing on the signal interaction rather than the noise. To this end, we propose a deterministic channel model which is analytically simpler than

Capacity and delay tradeoffs for ad-hoc mobile networks

by Michael J. Neely, Eytan Modiano - IEEE TRANSACTIONS ON INFORMATION THEORY , 2005
"... We consider the throughput/delay tradeoffs for scheduling data transmissions in a mobile ad-hoc network. To reduce delays in the network, each user sends redundant packets along multiple paths to the destination. Assuming the network has a cell partitioned structure and users move according to a s ..."
Abstract - Cited by 190 (12 self) - Add to MetaCart
simplified independent and identically distributed (i.i.d.) mobility model, we compute the exact network capacity and the exact endto-end queueing delay when no redundancy is used. The capacity achieving algorithm is a modified version of the Grossglauser-Tse 2-hop relay algorithm and provides O(N) delay

Efficient routing in intermittently connected mobile networks: The multiple-copy case

by Thrasyvoulos Spyropoulos, Konstantinos Psounis, Cauligi S. Raghavendra , 2008
"... Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are many real networks that follow this model, for example, wildlife tracking sensor networks, military networks, vehicular ad hoc net ..."
Abstract - Cited by 303 (18 self) - Add to MetaCart
Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are many real networks that follow this model, for example, wildlife tracking sensor networks, military networks, vehicular ad hoc

A Caching Relay for the World Wide Web

by Steven Glassman - Computer Networks and ISDN Systems , 1994
"... We describe the design and performance of a caching relay for the World Wide Web. We model the distribution of requests for pages from the web and see how this distribution affects the performance of a cache. We use the data gathered from the relay to make some general characterizations about the we ..."
Abstract - Cited by 184 (0 self) - Add to MetaCart
We describe the design and performance of a caching relay for the World Wide Web. We model the distribution of requests for pages from the web and see how this distribution affects the performance of a cache. We use the data gathered from the relay to make some general characterizations about

Multihop diversity in wireless relaying channels

by John Boyer, Student Member, David D. Falconer, Halim Yanikomeroglu - 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 149 (23 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

On the capacity of large Gaussian relay networks

by Michael Gastpar, Martin Vetterli - IEEE TRANS. INF. THEORY , 2005
"... The capacity of a particular large Gaussian relay network is determined in the limit as the number of relays tends to infinity. Upper bounds are derived from cut-set arguments, and lower bounds follow from an argument involving uncoded transmission. It is shown that in cases of interest, upper and ..."
Abstract - Cited by 146 (6 self) - Add to MetaCart
The capacity of a particular large Gaussian relay network is determined in the limit as the number of relays tends to infinity. Upper bounds are derived from cut-set arguments, and lower bounds follow from an argument involving uncoded transmission. It is shown that in cases of interest, upper
Results 1 - 10 of 2,213