Results 1  10
of
130
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 2220 (32 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 placed in a disk of unit area, traffic patterns are optimally assigned, and each transmission’s range is optimally chosen, the bit–distance product that can be transported by the network per second is 2 @ A bitmeters per second. Thus even under optimal circumstances, the throughput is only 2 bits per second for each node for a destination nonvanishingly far away. Similar results also hold under an alternate physical model where a required signaltointerference ratio is specified for successful receptions. Fundamentally, it is the need for every node all over the domain to share whatever portion of the channel it is utilizing with nodes in its local neighborhood that is the reason for the constriction in capacity. Splitting the channel into several subchannels does not change any of the results. Some implications may be worth considering by designers. Since the throughput furnished to each user diminishes to zero as the number of users is increased, perhaps networks connecting smaller numbers of users, or featuring connections mostly with nearby neighbors, may be more likely to be find acceptance.
Dynamic Tuning of the IEEE 802.11 Protocol to Achieve a Theoretical Throughput Limit
 IEEE/ACM Transactions on Networking
, 2000
"... Abstract—In wireless LANs (WLANs), the medium access control (MAC) protocol is the main element that determines the efficiency in sharing the limited communication bandwidth of the wireless channel. In this paper we focus on the efficiency of the IEEE 802.11 standard for WLANs. Specifically, we anal ..."
Abstract

Cited by 290 (10 self)
 Add to MetaCart
Abstract—In wireless LANs (WLANs), the medium access control (MAC) protocol is the main element that determines the efficiency in sharing the limited communication bandwidth of the wireless channel. In this paper we focus on the efficiency of the IEEE 802.11 standard for WLANs. Specifically, we analytically derive the average size of the contention window that maximizes the throughput, hereafter theoretical throughput limit, and we show that: 1) depending on the network configuration, the standard can operate very far from the theoretical throughput limit; and 2) an appropriate tuning of the backoff algorithm can drive the IEEE 802.11 protocol close to the theoretical throughput limit. Hence we propose a distributed algorithm that enables each station to tune its backoff algorithm at runtime. The performances of the IEEE 802.11 protocol, enhanced with our algorithm, are extensively investigated by simulation. Specifically, we investigate the sensitiveness of our algorithm to some network configuration parameters (number of active stations, presence of hidden terminals). Our results indicate that the capacity of the enhanced protocol is very close to the theoretical upper bound in all the configurations analyzed. Index Terms—Multiple access protocol (MAC), performance analysis, protocol capacity, wireless LAN (WLAN). I.
Iterative Waterfilling for Gaussian Vector Multiple Access Channels
 IEEE Transactions on Information Theory
, 2001
"... This paper characterizes the capacity region of a Gaussian multiple access channel with vector inputs and a vector output with or without intersymbol interference. The problem of finding the optimal input distribution is shown to be a convex programming problem, and an efficient numerical algorithm ..."
Abstract

Cited by 190 (11 self)
 Add to MetaCart
This paper characterizes the capacity region of a Gaussian multiple access channel with vector inputs and a vector output with or without intersymbol interference. The problem of finding the optimal input distribution is shown to be a convex programming problem, and an efficient numerical algorithm is developed to evaluate the optimal transmit spectrum under the maximum sum data rate criterion. The numerical algorithm has an it#8 at#8 e wat#8filling int#j pret#4968 . It converges from any starting point and it reaches with in s per output dimension per transmission from the Kuser multiple access sum capacity af t#j just one it#4 at#49 . These results are also applicable to vector multiple access fading channels.
Communication over fading channels with delay constraints
 IEEE Transactions on Information Theory
, 2002
"... We consider a user communicating over a fading channel with perfect channel state information. Data is assumed to arrive from some higher layer application and is stored in a buffer until it is transmitted. We study adapting the user's transmission rate and power based on the channel state informati ..."
Abstract

Cited by 170 (7 self)
 Add to MetaCart
We consider a user communicating over a fading channel with perfect channel state information. Data is assumed to arrive from some higher layer application and is stored in a buffer until it is transmitted. We study adapting the user's transmission rate and power based on the channel state information as well as the buffer occupancy; the objectives are to regulate both the longterm average transmission power and the average buffer delay incurred by the traffic. Two models for this situation are discussed; one corresponding to fixedlength/variablerate codewords and one corresponding to variablelength codewords. The tradeoff between the average delay and the average transmission power required for reliable communication is analyzed. A dynamic programming formulation is given to find all Pareto optimal power/delay operating points. We then quantify the behavior of this tradeoff in the regime of asymptotically large delay. In this regime we characterize simple buffer control policies which exhibit optimal characteristics. Connections to the delaylimited capacity and the expected capacity of fading channels are also discussed.
Multilevel Codes: Theoretical Concepts and Practical Design Rules
, 1999
"... This paper deals with 2 ` ary transmission using multilevel coding (MLC) and multistage decoding (MSD). The known result that MLC and MSD suffice to approach capacity if the rates at each level are appropriately chosen is reviewed. Using multiuser information theory, it is shown that there is a ..."
Abstract

Cited by 128 (24 self)
 Add to MetaCart
This paper deals with 2 ` ary transmission using multilevel coding (MLC) and multistage decoding (MSD). The known result that MLC and MSD suffice to approach capacity if the rates at each level are appropriately chosen is reviewed. Using multiuser information theory, it is shown that there is a large space of rate combinations such that MLC and full maximumlikelihood decoding (MLD) can approach capacity. It is noted that multilevel codes designed according to the traditional balanced distance rule tend to fall in the latter category and therefore require the huge complexity of MLD. The capacity rule, the balanced distances rules, and two other rules based on the random coding exponent and cutoff rate are compared and contrasted for practical design. Simulation results using multilevel binary turbo codes show that capacity can in fact be closely approached at high bandwidth efficiencies. Moreover, topics relevant in practical applications such as signal set labeling, dimensional...
Diversitymultiplexing tradeoff in multipleaccess channels
 IEEE Trans. Inform. Theory
, 2004
"... In a pointtopoint wireless fading channel, multiple transmit and receive antennas can be used to improve the reliability of reception (diversity gain) or increase the rate of communication for a fixed reliability level (multiplexing gain). In a multiple access situation, multiple receive antennas ..."
Abstract

Cited by 124 (4 self)
 Add to MetaCart
In a pointtopoint wireless fading channel, multiple transmit and receive antennas can be used to improve the reliability of reception (diversity gain) or increase the rate of communication for a fixed reliability level (multiplexing gain). In a multiple access situation, multiple receive antennas can also be used to spatially separate signals from different users (multiple access gain). Recent work has characterized the fundamental tradeoff between diversity and multiplexing gains in the pointtopoint scenario. In this paper, we extend the results to a multiple access fading channel. Our results characterize the fundamental tradeoff between the three types of gain and provide insights on the capabilities of multiple antennas in a network context. 1
An Ω(D log(N/D)) Lower Bound for Broadcast in Radio Networks
 SIAM Journal on Computing
, 1998
"... Abstract. We show that for any randomized broadcast protocol for radio networks, there exists a network in which the expected time to broadcast a message is Ω(D log(N/D)), where D is the diameter of the network and N is the number of nodes. This implies a tight lower bound of Ω(D log N) for any D ≤ ..."
Abstract

Cited by 112 (4 self)
 Add to MetaCart
Abstract. We show that for any randomized broadcast protocol for radio networks, there exists a network in which the expected time to broadcast a message is Ω(D log(N/D)), where D is the diameter of the network and N is the number of nodes. This implies a tight lower bound of Ω(D log N) for any D ≤ N 1−ε, where ε>0 is any constant.
Broadcasting algorithms in radio networks with unknown topology
 In Proc. of FOCS
, 2003
"... In this paper we present new randomized and deterministic algorithms for the classical problem of broadcasting in radio networks with unknown topology. We consider directed nnode radio networks with specified eccentricity D (maximum distance from the source node to any other node). In a seminal wor ..."
Abstract

Cited by 102 (1 self)
 Add to MetaCart
In this paper we present new randomized and deterministic algorithms for the classical problem of broadcasting in radio networks with unknown topology. We consider directed nnode radio networks with specified eccentricity D (maximum distance from the source node to any other node). In a seminal work on randomized broadcasting, BarYehuda et al. presented an algorithm that for any nnode radio network with eccentricity D completes the broadcasting in O(D log n + log 2 n) time, with high probability. This result is almost optimal, since as it has been shown by Kushilevitz and Mansour and Alon et al., every randomized algorithm requires Ω(D log(n/D)+log 2 n) expected time to complete broadcasting. Our first main result closes the gap between the lower
IEEE 802.11 Protocol: Design and Performance Evaluation of an Adaptive Backoff Mechanism
, 2000
"... in WLANs, the medium access control (MAC) protocol is the main element that determines the efficiency of sharing the limited communication bandwidth of the wireless channel. The fraction of channel bandwidth used by successfully transmitted messages gives a good indication of the protocol efficiency ..."
Abstract

Cited by 81 (2 self)
 Add to MetaCart
in WLANs, the medium access control (MAC) protocol is the main element that determines the efficiency of sharing the limited communication bandwidth of the wireless channel. The fraction of channel bandwidth used by successfully transmitted messages gives a good indication of the protocol efficiency, and its maximum value is referred to as protocol capacity. In a previous paper we have derived the theoretical limit of the IEEE 802.11 MAC protocol capacity. In addition, we showed that if a station has an exact knowledge of the network status, it is possible to tune its backoff algorithm to achieve a protocol capacity very close to its theoretical bound. Unfortunately, in a real case, a station does not have an exact knowledge of the network and load configurations (i.e., number of active stations and length of the message transmitted on the channel) but it can only estimate it. In this work we analytically study the performance of the IEEE 802.11 protocol with a dynamically tuned backoff based on the estimation of the network status. Results obtained indicate that under stationary traffic and network configurations (i.e., constant average message length and fixed number of active stations), the capacity of the enhanced protocol approaches the theoretical limits in all the configurations analyzed. In addition, by exploiting the analytical model, we investigate the protocol performance in transient conditions (i.e., when the number of active stations sharply changes).