#### DMCA

## Achievable Rate Region and Optimality of Multi-hop Wireless 802.11-Scheduled Networks

### Cached

### Download Links

Citations: | 7 - 3 self |

### Citations

1869 | Performance analysis of the IEEE 802.11 distributed co ordination function,"
- Bianchi
- 2000
(Show Context)
Citation Context .... In order to decouple the MCs and reduce the state space, we average these probabilities over all states and work with the average value, following common practice in the analysis of both single hop =-=[8]-=- and multi-hop 802.11 networks [9], [10]. Note that the dependence among neighborhood MCs is captured via these average probabilities. Section III-B describes how to find the value of the collision pr... |

565 | Impact of interference on multi-hop wireless network performance,” Wireless networks
- Jain, Padhye, et al.
- 2005
(Show Context)
Citation Context ...nd a collection of source-destination pairs, what is the achievable rate region of this arbitrary multi-hop network. Researchers have formulated a multi-commodity flow problem to answer this question =-=[1]-=-, [2]. These papers assume optimal TDMA scheduling with different interference models at the MAC layer in their formulations. However, the MAC protocol used in all the multi-hop networks being deploye... |

332 | Architecture and Evaluation of an Unplanned 802.11b Mesh Network. In
- Bicket, Aguayo, et al.
- 2005
(Show Context)
Citation Context ...rs assume optimal TDMA scheduling with different interference models at the MAC layer in their formulations. However, the MAC protocol used in all the multi-hop networks being deployed is IEEE 802.11 =-=[3]-=-–[6]. Characterizing the achievable rate region of an arbitrary multi-hop network with 802.11 scheduling is still an open problem. This characterization will have several applications. For example, it... |

159 | Modeling per-flow throughput and capturing starvation in CSMA multi-hop wireless networks.
- Garetto, Salonidis, et al.
- 2008
(Show Context)
Citation Context ... reduce the state space, we average these probabilities over all states and work with the average value, following common practice in the analysis of both single hop [8] and multi-hop 802.11 networks =-=[9]-=-, [10]. Note that the dependence among neighborhood MCs is captured via these average probabilities. Section III-B describes how to find the value of the collision probabilities, here we just focus on... |

118 | Measurement Driven Deployment of a Two-Tier Urban Mesh Access Network. In
- Camp, Robinson, et al.
- 2006
(Show Context)
Citation Context ...ssume optimal TDMA scheduling with different interference models at the MAC layer in their formulations. However, the MAC protocol used in all the multi-hop networks being deployed is IEEE 802.11 [3]–=-=[6]-=-. Characterizing the achievable rate region of an arbitrary multi-hop network with 802.11 scheduling is still an open problem. This characterization will have several applications. For example, it wil... |

94 |
Algorithmic aspects of capacity in wireless networks,”
- Kumar, Marathe, et al.
- 2005
(Show Context)
Citation Context ...collection of source-destination pairs, what is the achievable rate region of this arbitrary multi-hop network. Researchers have formulated a multi-commodity flow problem to answer this question [1], =-=[2]-=-. These papers assume optimal TDMA scheduling with different interference models at the MAC layer in their formulations. However, the MAC protocol used in all the multi-hop networks being deployed is ... |

81 |
Draft Supplement to Part 11: Wireless Medium Access Control (MAC) and physical layer (PHY) specifications: Medium Access Control (MAC) Enhancements for Quality of Service (QoS),
- 0
- 2004
(Show Context)
Citation Context ...uccessful/unsuccessful RTS/CTS exchange (see next paragraph for details). The transition probabilities of the MC of e depend 1 We do not provide a description of IEEE 802.11 protocol. Please refer to =-=[7]-=- for a detailed description of the protocol. on the collision probabilities at the receiver of e, which, in turn, depend on the edge-rates at the edges in the neighborhood of e. Hence, these probabili... |

80 |
Throughput modeling and fairness issues in CSMA/CA based ad-hoc networks.
- Wang, Kar
- 2005
(Show Context)
Citation Context ...2. 2 Different papers have used this topology or a similar topology to demonstrate the unfairness of the 802.11 protocol towards flow 2 (which is competing with two flows) under backlogged conditions =-=[13]-=- or with TCP [14]. Since flows 1 and 3 are symmetric, we assume that rf1 = rf3 and plot the achievable rate region for 802.11 and capacity region for optimal scheduling for this equal rate against rf2... |

73 | Modeling media access in embedded two-flow topologies of multi-hop wireless networks,”
- Garetto, Shi, et al.
- 2005
(Show Context)
Citation Context ...ese probabilities by appropriately combining the individual probabilities from each two-edge topology. We first define all possible categories of two-edge topologies which can exist in a network [9], =-=[11]-=-. We use the following notation in the definition of these categories: let e1 and e2 denote the two edges under consideration and let Tej and Rej , j = 1,2, denote the transmitter and the receiver of ... |

58 |
Towards performance modeling of IEEE 802.11 based wireless networks: A unified framework and its applications,” in
- Medepalli, Tobagi
- 2006
(Show Context)
Citation Context ...ce the state space, we average these probabilities over all states and work with the average value, following common practice in the analysis of both single hop [8] and multi-hop 802.11 networks [9], =-=[10]-=-. Note that the dependence among neighborhood MCs is captured via these average probabilities. Section III-B describes how to find the value of the collision probabilities, here we just focus on findi... |

42 | Feasibility study of mesh networks for all-wireless offices, - Eriksson, Agarwal, et al. - 2006 |

40 | TCP over multihop 802.11 networks: issues and performance enhancement.
- Nahm, Helmy, et al.
- 2005
(Show Context)
Citation Context ...o the best achievable rates without specifying the protocols used to achieve it, and they are by no means contradictory to the well-known fact that TCP over 802.11 may have very bad performance [14], =-=[15]-=-. VII. CONCLUSIONS This paper characterizes the achievable rate region of an arbitrary multi-hop wireless network with 802.11 scheduling by deriving a methodology to characterize the achievable edge-r... |

20 | An experimental study of multimedia traffic performance in mesh networks,” in - Sun, Sheriff, et al. - 2005 |

16 | TCP unfairness in ad-hoc wireless networks and neighborhood RED solution
- Xu, Gerla, et al.
- 2003
(Show Context)
Citation Context ...pers have used this topology or a similar topology to demonstrate the unfairness of the 802.11 protocol towards flow 2 (which is competing with two flows) under backlogged conditions [13] or with TCP =-=[14]-=-. Since flows 1 and 3 are symmetric, we assume that rf1 = rf3 and plot the achievable rate region for 802.11 and capacity region for optimal scheduling for this equal rate against rf2 in Figure 3(b). ... |

1 |
Characterizing the achievable rate region for multi-hop wireless networks with
- Jindal, Psounis
- 2007
(Show Context)
Citation Context ...tate, and (vi) N e 6 : edges which form a far hidden edge with e. We only state the value of p e,T c,i , pe,T l and p e,T idle in the following lemmas and skip the proofs for brevity. Please refer to =-=[12]-=- for details. The underlying idea behind all the proofs is to first derive these probabilities for each two-edge topology e is a part of, and then appropriately combine them. The first lemma states th... |