Results 1 - 10
of
484
Routing in multi-radio, multi-hop wireless mesh networks
- In ACM MobiCom
, 2004
"... ..."
(Show Context)
ExOR: Opportunistic Multi-Hop 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 multi-hop 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 457 (0 self)
- Add to MetaCart
(Show Context)
This paper describes ExOR, an integrated routing and MAC protocol that increases the throughput of large unicast transfers in multi-hop 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 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 traditional routing. ExOR’s design faces the following challenges. The nodes that receive each packet must agree on their identities and choose one forwarder. The agreement protocol must have low overhead, but must also be robust enough that it rarely forwards a packet zero times or more than once. Finally, ExOR must choose the forwarder with the lowest remaining cost to the ultimate destination. Measurements of an implementation on a 38-node 802.11b test-bed show that ExOR increases throughput for most node pairs when compared with traditional routing. For pairs between which traditional routing uses one or two hops, ExOR’s robust acknowledgments prevent unnecessary retransmissions, increasing throughput by nearly 35%. For more distant pairs, ExOR takes advantage of the choice of forwarders to provide throughput gains of a factor of two to four.
Opportunistic Media Access for Multirate Ad Hoc Networks
, 2002
"... The IEEE 802.11 wireless media access standard supports multiple data rates at the physical layer. Moreover, various auto rate adaptation mechanisms at the medium access layer have been proposed to utilize this multi-rate capability by automatically adapting the transmission rate to best match the c ..."
Abstract
-
Cited by 332 (12 self)
- Add to MetaCart
The IEEE 802.11 wireless media access standard supports multiple data rates at the physical layer. Moreover, various auto rate adaptation mechanisms at the medium access layer have been proposed to utilize this multi-rate capability by automatically adapting the transmission rate to best match the channel conditions. In this paper, we introduce the Opportunistic Auto Rate (OAR) protocol to better exploit durations of high-quality channels conditions. The key mechanism of the OAR protocol is to opportunistically send multiple back-to-back data packets whenever the channel quality is good. As channel coherence times typically exceed multiple packet transmission times for both mobile and nonmobile users, OAR achieves significant throughput gains as compared to state-of-the-art auto-rate adaptation mechanisms. Moreover, over longer time scales, OAR ensures that all nodes are granted channel access for the same time-shares as achieved by single-rate IEEE 802.11. We describe mechanisms to implement OAR on top of any existing auto-rate adaptation scheme in a nearly IEEE 802.11 compliant manner. We also analytically study OAR and characterize the gains in throughput as a function of the channel conditions. Finally, we perform an extensive set of ns-2 simulations to study the impact of such factors as node velocity, channel conditions, and topology on the throughput of OAR.
Joint Scheduling and Power Control for Wireless Ad-hoc Networks
, 2002
"... In this pape we introduce powe r control as a solution tothe multiple accel proble in conte tion-base wiren-b ad-hocne works.The motivation for this study is two fold, limiting multi-use intej- toincre single hop throughput, andrej powe r consumption to increj batte life We focus onne ne bor transmi ..."
Abstract
-
Cited by 283 (6 self)
- Add to MetaCart
(Show Context)
In this pape we introduce powe r control as a solution tothe multiple accel proble in conte tion-base wiren-b ad-hocne works.The motivation for this study is two fold, limiting multi-use intej- toincre single hop throughput, andrej powe r consumption to increj batte life We focus onne ne bor transmissions whes node are rej tose information packe - tothe re e e re e sub jej to a constraint on the signal-to-inteal-to-injj- ratio.The multiple acce - proble is solve via twoaltej- phase name schej and powe r control.The sche algorithm isej tial to coordinate the transmissions ofinde ede t use inorde toejj strong intej- (e.g selfinterference) that can not be ove by powe r control. On the othe hand, powe r control isej in adistribute fashion to dej- the admissible powe r ve ifone ene that can be use bythe sche use to satisfy thei singlej transmissionrensmissi ts. This isdone for two type s ofne works, namej TDMA and TDMA/CDMA wire/CD ad-hocne works.
Robust rate adaptation for 802.11 wireless networks
- in ACM Mobicom
, 2006
"... Rate adaptation is a mechanism unspecified by the 802.11 standards, yet critical to the system performance by exploiting the multi-rate capability at the physical layer. In this paper, we conduct a systematic and experimental study on rate adaptation over 802.11 wireless networks. Our main contribut ..."
Abstract
-
Cited by 191 (3 self)
- Add to MetaCart
(Show Context)
Rate adaptation is a mechanism unspecified by the 802.11 standards, yet critical to the system performance by exploiting the multi-rate capability at the physical layer. In this paper, we conduct a systematic and experimental study on rate adaptation over 802.11 wireless networks. Our main contributions are two-fold. First, we critique five design guidelines adopted by most existing algorithms. Our study reveals that these seemingly correct guidelines can be misleading in practice, thus incur significant performance penalty in certain scenarios. The fundamental challenge is that rate adaptation must accurately estimate the channel condition despite the presence of various dynamics caused by fading, mobility and hidden terminals. Second, we design and implement a new Robust Rate Adaptation Algorithm (RRAA) that addresses the above challenge. RRAA uses short-term loss ratio to opportunistically guide its rate change decisions, and an adaptive RTS filter to prevent collision losses from triggering rate decrease. Our extensive experiments have shown that RRAA outperforms three well-known rate adaptation solutions (ARF, AARF, and SampleRate) in all tested scenarios, with throughput improvement up to 143%.
Idle sense: An optimal access method for high throughput and fairness in rate diverse wireless LANs
- In ACM SIGCOMM
, 2005
"... We consider wireless LANs such as IEEE 802.11 operating in the unlicensed radio spectrum. While their nominal bit rates have increased considerably, the MAC layer remains practically unchanged despite much research effort spent on improving its performance. We observe that most proposals for tuning ..."
Abstract
-
Cited by 175 (12 self)
- Add to MetaCart
(Show Context)
We consider wireless LANs such as IEEE 802.11 operating in the unlicensed radio spectrum. While their nominal bit rates have increased considerably, the MAC layer remains practically unchanged despite much research effort spent on improving its performance. We observe that most proposals for tuning the access method focus on a single aspect and disregard others. Our objective is to define an access method optimized for throughput and fairness, able to dynamically adapt to physical channel conditions, to operate near optimum for a wide range of error rates, and to provide equal time shares when hosts use different bit rates. We propose a novel access method derived from 802.11 DCF [2] (Distributed Coordination Function) in which all hosts use similar values of the contention window CW to benefit from good short-term access fairness. We call our method Idle Sense, because each host observes the mean number of idle slots between transmission attempts to dynamically control its contention window. Unlike other proposals, Idle Sense enables each host to estimate its frame error rate, which can be used for switching to the right bit rate. We present simulations showing how the method leads to high throughput, low collision overhead, and low delay. The method also features fast reactivity and time-fair channel allocation. Categories and Subject Descriptors
IEEE 802.11 Rate Adaptation: A Practical Approach
"... Today, three di#erent physical (PHY) layers for the IEEE 802.11 WLAN are available (802.11a/b/g); they all provide multi-rate capabilities. To achieve high performance under varying conditions, these devices need to adapt their transmission rate dynamically. While this rate adaptation algorithm is a ..."
Abstract
-
Cited by 146 (2 self)
- Add to MetaCart
(Show Context)
Today, three di#erent physical (PHY) layers for the IEEE 802.11 WLAN are available (802.11a/b/g); they all provide multi-rate capabilities. To achieve high performance under varying conditions, these devices need to adapt their transmission rate dynamically. While this rate adaptation algorithm is a critical component of their performance, only very few algorithms such as Auto Rate Fallback (ARF) or Receiver Based Auto Rate (RBAR) have been published and the implementation challenges associated with these mechanisms have never been publicly discussed. In this paper, we first present the important characteristics of the 802.11 systems that must be taken into account when such algorithms are designed. Specifically, we emphasize the contrast between low latency and high latency systems, and we give examples of actual chipsets that fall in either of the different categories. We propose an Adaptive ARF (AARF) algorithm for low latency systems that improves upon ARF to provide both short-term and long-term adaptation. The new algorithm has very low complexity while obtaining a performance similar to RBAR, which requires incompatible changes to the 802.11 MAC and PHY protocol. Finally, we present a new rate adaptation algorithm designed for high latency systems that has been implemented and evaluated on an AR5212-based device. Experimentation results show a clear performance improvement over the algorithm previously implemented in the AR5212 driver we used.
Goodput Analysis and Link Adaptation for IEEE 802.11a Wireless LANs
- IEEE Trans. on Mobile Computing
, 2002
"... Abstract—Link adaptation to dynamically select the data transmission rate at a given time has been recognized as an effective way to improve the goodput performance of the IEEE 802.11 wireless local-area networks (WLANs). Recently, with the introduction of the new high-speed 802.11a physical layer ( ..."
Abstract
-
Cited by 145 (11 self)
- Add to MetaCart
Abstract—Link adaptation to dynamically select the data transmission rate at a given time has been recognized as an effective way to improve the goodput performance of the IEEE 802.11 wireless local-area networks (WLANs). Recently, with the introduction of the new high-speed 802.11a physical layer (PHY), it is even more important to have a well-designed link adaptation scheme work with the 802.11a PHY such that its fast transmission rates can be exploited. In this paper, we first present a generic method to analyze the goodput performance of an 802.11a system under the Distributed Coordination Function (DCF), and express the expected effective goodput as a closed-form function of the data payload length, the frame retry count, the wireless channel condition, and the selected data transmission rate. Then, based on the theoretical analysis, we propose a novel MPDU (MAC Protocol Data Unit)based link adaptation scheme for the 802.11a systems. It is a simple table-driven approach, and the basic idea is to pre-establish a best PHY mode table by applying the dynamic programming technique. The best PHY mode table is indexed by the system status triplet that consists of the data payload length, the wireless channel condition, and the frame retry count. At run-time, a wireless station determines the most appropriate PHY mode for the next transmission attempt by a simple table lookup, using the most upto-date system status as the index. Our in-depth simulation shows that the proposed MPDU-based link adaptation scheme outperforms the single-mode schemes and the AutoRate Fallback (ARF) scheme — which is used in Lucent Technologies ’ WaveLAN-II networking devices — significantly in terms of the average goodput, the frame drop rate, and the average number of transmission attempts per data frame delivery.
Self-Management in Chaotic Wireless Deployments
- In ACM MobiCom
, 2005
"... ABSTRACT Over the past few years, wireless networking technologies have made vast forays into our daily lives. Today, one can find 802.11 hardware and other personal wireless technology employed at homes, shopping malls, coffee shops and airports. Present-day wireless network deployments bear two im ..."
Abstract
-
Cited by 137 (9 self)
- Add to MetaCart
(Show Context)
ABSTRACT Over the past few years, wireless networking technologies have made vast forays into our daily lives. Today, one can find 802.11 hardware and other personal wireless technology employed at homes, shopping malls, coffee shops and airports. Present-day wireless network deployments bear two important properties: they are unplanned, with most access points (APs) deployed by users in a spontaneous manner, resulting in highly variable AP densities; and they are unmanaged, since manually configuring and managing a wireless network is very complicated. We refer to such wireless deployments as being chaotic.
