Results 1 - 10
of
1,869
Routing in multi-radio, multi-hop wireless mesh networks
- In ACM MobiCom
, 2004
"... ..."
(Show Context)
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.
Performance of Reliable Transport Protocol over IEEE 802.11 Wireless LAN: Analysis And Enhancement
, 2002
"... EEE 802.11 Medium Access Control(MAC) is proposed to support asynchronous and time bounded delivery of radio data packets in infrastructure and ad hoc networks. The basis of the IEEE 802.11 WLAN MAC protocol is Distributed Coordination Function(DCF), which is a Carrier Sense Multiple Access with Col ..."
Abstract
-
Cited by 226 (3 self)
- Add to MetaCart
EEE 802.11 Medium Access Control(MAC) is proposed to support asynchronous and time bounded delivery of radio data packets in infrastructure and ad hoc networks. The basis of the IEEE 802.11 WLAN MAC protocol is Distributed Coordination Function(DCF), which is a Carrier Sense Multiple Access with Collision Avoidance(CSMA/CA) with binary slotted exponential back-off scheme. Since IEEE 802.11 MAC has its own characteristics that are different from other wireless MAC protocols, the performance of reliable transport protocol over 802.11 needs further study.
A Distributed CSMA Algorithm for Throughput and Utility Maximization in Wireless Networks
"... In multi-hop wireless networks, designing distributed scheduling algorithms to achieve the maximal throughput is a challenging problem because of the complex interference constraints among different links. Traditional maximal-weight (MW) scheduling, although throughput-optimal, is difficult to imple ..."
Abstract
-
Cited by 181 (8 self)
- Add to MetaCart
In multi-hop wireless networks, designing distributed scheduling algorithms to achieve the maximal throughput is a challenging problem because of the complex interference constraints among different links. Traditional maximal-weight (MW) scheduling, although throughput-optimal, is difficult to implement in distributed networks; whereas a distributed greedy protocol similar to IEEE 802.11 does not guarantee the maximal throughput. In this paper, we introduce an adaptive CSMA scheduling algorithm that can achieve the maximal throughput distributedly under some assumptions. Major advantages of the algorithm include: (1) It applies to a very general interference model; (2) It is simple, distributed and asynchronous. Furthermore, we combine the algorithm with endto-end flow control to achieve the optimal utility and fairness of competing flows. The effectiveness of the algorithm is verified by simulations. Finally, we consider some implementation issues in the setting of 802.11 networks.
Modeling the 802.11 Distributed Coordination Function in non-saturated conditions
- IEEE Commun. Lett
, 2005
"... Abstract — Analysis of the 802.11 CSMA/CA mechanism has received considerable attention recently. Bianchi [1] presents an analytic model under a saturated traffic assumption. Bianchi’s model is accurate, but typical network conditions are nonsaturated. We present an extension of his model to a nonsa ..."
Abstract
-
Cited by 164 (30 self)
- Add to MetaCart
(Show Context)
Abstract — Analysis of the 802.11 CSMA/CA mechanism has received considerable attention recently. Bianchi [1] presents an analytic model under a saturated traffic assumption. Bianchi’s model is accurate, but typical network conditions are nonsaturated. We present an extension of his model to a nonsaturated environment. Its predictions are validated against simulation and are found to accurately capture many interesting features of non-saturated operation. Index Terms — Wireless LAN, IEEE 802.11 MAC, nonsaturated traffic, performance evaluation.
Modeling per-flow throughput and capturing starvation in CSMA multi-hop wireless networks
- In Proc. of IEEE Infocom
, 2006
"... Abstract — Multi-hop wireless networks employing random access protocols have been shown to incur large discrepancies in the throughputs achieved by the flows sharing the network. Indeed, flow throughputs can span orders of magnitude from near starvation to many times greater than the mean. In this ..."
Abstract
-
Cited by 159 (18 self)
- Add to MetaCart
(Show Context)
Abstract — Multi-hop wireless networks employing random access protocols have been shown to incur large discrepancies in the throughputs achieved by the flows sharing the network. Indeed, flow throughputs can span orders of magnitude from near starvation to many times greater than the mean. In this paper, we address the foundations of this disparity. We show that the fundamental cause is not merely differences in the number of contending neighbors, but a generic coordination problem of CSMA-based random access in a multi-hop environment. We develop a new analytical model that incorporates this lack of coordination, identifies dominating and starving flows and accurately predicts per-flow throughput in a large-scale network. We then propose metrics that quantify throughput imbalances due to the MAC protocol operation. Our model and metrics provide a deeper understanding of the behavior of CSMA protocols in arbitrary topologies and can aid the design of effective protocol solutions to the starvation problem. I.
MMSPEED: Multipath multi-SPEED protocol for QoS guarantee of reliability and timeliness in wireless sensor networks
- IEEE Trans. on Mobile Computing
, 2006
"... Abstract—In this paper, we present a novel packet delivery mechanism called Multi-Path and Multi-SPEED Routing Protocol (MMSPEED) for probabilistic QoS guarantee in wireless sensor networks. The QoS provisioning is performed in two quality domains, namely, timeliness and reliability. Multiple QoS le ..."
Abstract
-
Cited by 140 (0 self)
- Add to MetaCart
(Show Context)
Abstract—In this paper, we present a novel packet delivery mechanism called Multi-Path and Multi-SPEED Routing Protocol (MMSPEED) for probabilistic QoS guarantee in wireless sensor networks. The QoS provisioning is performed in two quality domains, namely, timeliness and reliability. Multiple QoS levels are provided in the timeliness domain by guaranteeing multiple packet delivery speed options. In the reliability domain, various reliability requirements are supported by probabilistic multipath forwarding. These mechanisms for QoS provisioning are realized in a localized way without global network information by employing localized geographic packet forwarding augmented with dynamic compensation, which compensates for local decision inaccuracies as a packet travels towards its destination. This way, MMSPEED can guarantee end-to-end requirements in a localized way, which is desirable for scalability and adaptability to large scale dynamic sensor networks. Simulation results show that MMSPEED provides QoS differentiation in both reliability and timeliness domains and, as a result, significantly improves the effective capacity of a sensor network in terms of number of flows that meet both reliability and timeliness requirements up to 50 percent (12 flows versus 18 flows).
New Insights from a Fixed Point Analysis of Single Cell IEEE 802.11 WLANs
, 2004
"... We study a fixed point formalisation of the well known analysis of Bianchi. We provide a significant simplication and generalisation of the analysis. In this more general framework, the fixed point solution and performance measures resulting from it are studied. Uniqueness of the fixed point is esta ..."
Abstract
-
Cited by 132 (25 self)
- Add to MetaCart
We study a fixed point formalisation of the well known analysis of Bianchi. We provide a significant simplication and generalisation of the analysis. In this more general framework, the fixed point solution and performance measures resulting from it are studied. Uniqueness of the fixed point is established. Simple and general throughput formulas are provided. It is shown that the throughput of any ow will be bounded by the one with the smallest transmission rate. The aggregate throughput is bounded by the reciprocal of the harmonic mean of the transmission rates. In an asymptotic regime with a large number of nodes, explicit formulas for the collision probability, the aggregate attempt rate and the aggregate throughput are provided. The results from the analysis are compared with ns2 simulations, and also with an exact Markov model of the back-off process. It is shown how the saturated network analysis can be used to obtain TCP transfer throughputs in some cases.
End-to-End Performance and Fairness in Multihop Wireless Backhaul Networks
- In Proceedings of ACM MOBICOM
, 2004
"... Wireless IEEE 802.11 networks in residences, small businesses, and public "hot spots" typically encounter the wireline access link (DSL, cable modem, T1, etc.) as the slowest and most expensive part of the end-to-end path. Consequently, network architectures have been proposed that employ ..."
Abstract
-
Cited by 132 (4 self)
- Add to MetaCart
(Show Context)
Wireless IEEE 802.11 networks in residences, small businesses, and public "hot spots" typically encounter the wireline access link (DSL, cable modem, T1, etc.) as the slowest and most expensive part of the end-to-end path. Consequently, network architectures have been proposed that employ multiple wireless hops in route to and from the wired Internet. Unfortunately, use of current media access and transport protocols for such systems can result in severe unfairness and even starvation for flows that are an increasing number of hops away from a wired Internet entry point. Our objective is to study fairness and end-to-end performance in multihop wireless backhaul networks via the following methodology. First, we develop a formal reference model that characterizes objectives such as removing spatial bias (i.e., providing performance that is independent of the number of wireless hops to a wire) and maximizing spatial reuse. Second, we perform an extensive set of simulation experiments to quantify the impact of the key performance factors towards achieving these goals. For example, we study the roles of the MAC protocol, end-to-end congestion control, antenna technology, and traffic types. Next, we develop and study a distributed layer 2 fairness algorithm which targets to achieve the fairness of the reference model without modification to TCP. Finally, we study the critical relationship between fairness and aggregate throughput and in particular study the fairness-constrained system capacity of multihop wireless backhaul networks.
Contention-aware admission control for ad hoc networks
"... An admission control algorithm must coordinate between flows in order to provide guarantees about how the medium is shared. In wired networks, nodes can monitor the medium to see how much bandwidth is being used. However, in ad hoc networks, communication from one node may consume the bandwidth of n ..."
Abstract
-
Cited by 112 (3 self)
- Add to MetaCart
(Show Context)
An admission control algorithm must coordinate between flows in order to provide guarantees about how the medium is shared. In wired networks, nodes can monitor the medium to see how much bandwidth is being used. However, in ad hoc networks, communication from one node may consume the bandwidth of neighboring nodes. Therefore, the bandwidth consumption of flows and the available resources to a node are not local concepts, but related to the neighboring nodes in carriersensing range. Current solutions do not address how to perform admission control in such an environment so that the admitted flows in the network will not exceed network capacity. In this paper, we present a scalable and efficient admission control framework – Contention-aware Admission Control Protocol (CACP)- to support QoS in ad hoc networks. We demonstrate the effectiveness of CACP with both mathematical analysis and simulation results.
