Results 1  10
of
89,970
Wireless Connectivity and Capacity
"... Given n wireless transceivers located in a plane, a fundamental problem in wireless communications is to construct a strongly connected digraph on them such that the constituent links can be scheduled in fewest possible time slots, assuming the SINR model of interference. In this paper, we provide a ..."
Abstract

Cited by 10 (5 self)
 Add to MetaCart
Given n wireless transceivers located in a plane, a fundamental problem in wireless communications is to construct a strongly connected digraph on them such that the constituent links can be scheduled in fewest possible time slots, assuming the SINR model of interference. In this paper, we provide
The capacity of wireless networks
 IEEE TRANSACTIONS ON INFORMATION THEORY
, 2000
"... When n identical randomly located nodes, each capable of transmitting at bits per second and using a fixed range, form a wireless network, the throughput @ A obtainable by each node for a randomly chosen destination is 2 bits per second under a noninterference protocol. If the nodes are optimally p ..."
Abstract

Cited by 3191 (42 self)
 Add to MetaCart
When n identical randomly located nodes, each capable of transmitting at bits per second and using a fixed range, form a wireless network, the throughput @ A obtainable by each node for a randomly chosen destination is 2 bits per second under a noninterference protocol. If the nodes are optimally
ExOR: Opportunistic MultiHop Routing for Wireless Networks
 in SIGCOMM
, 2005
"... This paper describes ExOR, an integrated routing and MAC protocol that increases the throughput of large unicast transfers in multihop wireless networks. ExOR chooses each hop of a packet’s route after the transmission for that hop, so that the choice can reflect which intermediate nodes actually r ..."
Abstract

Cited by 447 (0 self)
 Add to MetaCart
received the transmission. This deferred choice gives each transmission multiple opportunities to make progress. As a result ExOR can use long radio links with high loss rates, which would be avoided by traditional routing. ExOR increases a connection’s throughput while using no more network capacity than
Interference alignment and the degrees of freedom for the Kuser interference channel
 IEEE TRANSACTIONS ON INFORMATION THEORY
, 2008
"... For the fully connected K user wireless interference channel where the channel coefficients are timevarying and are drawn from a continuous distribution, the sum capacity is characterized as C(SNR) = K 2 log(SNR) +o(log(SNR)). Thus, the K user timevarying interference channel almost surely has K ..."
Abstract

Cited by 425 (17 self)
 Add to MetaCart
For the fully connected K user wireless interference channel where the channel coefficients are timevarying and are drawn from a continuous distribution, the sum capacity is characterized as C(SNR) = K 2 log(SNR) +o(log(SNR)). Thus, the K user timevarying interference channel almost surely has
On the Capacity of Hybrid Wireless Networks
, 2003
"... We study the throughput capacity of hybrid wireless networks. A hybrid network is formed by placing a sparse network of base stations in an ad hoc network. These base stations are assumed to be connected by a highbandwidth wired network and act as relays for wireless nodes. They are not data source ..."
Abstract

Cited by 212 (4 self)
 Add to MetaCart
We study the throughput capacity of hybrid wireless networks. A hybrid network is formed by placing a sparse network of base stations in an ad hoc network. These base stations are assumed to be connected by a highbandwidth wired network and act as relays for wireless nodes. They are not data
Capacity of MultiChannel Wireless Networks with Random (c, f) Assignment
, 2007
"... With the availability of multiple unlicensed spectral bands, and potential costbased limitations on the capabilities of individual nodes, it is increasingly relevant to study the performance of multichannel wireless networks with channel switching constraints. To this effect, some constraint models ..."
Abstract

Cited by 266 (11 self)
 Add to MetaCart
models have been recently proposed, and connectivity and capacity results have been formulated for networks of randomly deployed singleinterface nodes subject to these constraints. One of these constraint models is termed random (c, f) assignment, wherein each node is preassigned a random subset of f
Topology Control in Wireless Ad Hoc and Sensor Networks
 ACM Computing Surveys
, 2005
"... Topology Control (TC) is one of the most important techniques used in wireless ad hoc and sensor networks to reduce energy consumption (which is essential to extend the network operational time) and radio interference (with a positive effect on the network traffic carrying capacity). The goal of thi ..."
Abstract

Cited by 295 (4 self)
 Add to MetaCart
Topology Control (TC) is one of the most important techniques used in wireless ad hoc and sensor networks to reduce energy consumption (which is essential to extend the network operational time) and radio interference (with a positive effect on the network traffic carrying capacity). The goal
Wireless Network Information Flow: A Deterministic Approach
, 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 293 (43 self)
 Add to MetaCart
the Gaussian model but still captures two key wireless channel properties of broadcast and superposition. We consider a model for a wireless relay network with nodes connected by such deterministic channels, and present an exact characterization of the endtoend capacity when there is a single source and one
Closing the gap in the capacity of wireless networks via percolation theory
 IEEE TRANS. INFORMATION THEORY
, 2007
"... An achievable bit rate per source–destination pair in a wireless network of � randomly located nodes is determined adopting the scaling limit approach of statistical physics. It is shown that randomly scattered nodes can achieve, with high probability, the same Ia � � transmission rate of arbitrari ..."
Abstract

Cited by 235 (8 self)
 Add to MetaCart
An achievable bit rate per source–destination pair in a wireless network of � randomly located nodes is determined adopting the scaling limit approach of statistical physics. It is shown that randomly scattered nodes can achieve, with high probability, the same Ia � � transmission rate
Capacity of Wireless Erasure Networks
 IEEE TRANSACTIONS ON INFORMATION THEORY
, 2006
"... In this paper, a special class of wireless networks, called wireless erasure networks, is considered. In these networks, each node is connected to a set of nodes by possibly correlated erasure channels. The network model incorporates the broadcast nature of the wireless environment by requiring eac ..."
Abstract

Cited by 148 (12 self)
 Add to MetaCart
In this paper, a special class of wireless networks, called wireless erasure networks, is considered. In these networks, each node is connected to a set of nodes by possibly correlated erasure channels. The network model incorporates the broadcast nature of the wireless environment by requiring
Results 1  10
of
89,970