Measurement and Modeling of the Origins of Starvation in Congestion Controlled Mesh Networks

Shi, Jingpu; Gurewitz, Omer; Mancuso, Vincenzo; Camp, Joseph; Knightly, Edward W.

doi:10.1109/infocom.2007.224

Cited by 18 publications

(26 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…(Others have studied starvation in multi-hop networks [6,20].) Moreover, we assume the APs do not use RTS/CTS, since studies [9] show that RTS/CTS is unfair in a congested setting, and RTS/CTS is turned off by default in commercial devices.…”

Section: Problem Statementmentioning

confidence: 99%

“…This paper is an attempt at improving the estimate in Eq. Shi et al [20] have studied the starvation problem of congestion-controlled traffic (TCP) in multi-hop wireless networks, where one-hop flows may contend with and starve two-hop flows. Our work differs from theirs in that we investigate the throughput of non-congestion-controlled traffic (UDP) in one-hop wireless networks, where the transmission range of different access points may overlap.…”

Section: Challengesmentioning

confidence: 99%

See 1 more Smart Citation

A model for calculating channel share of 802.11 access points with overlapping wireless cells

Zhao

Tay²

2011

Wireless Netw

View full text Add to dashboard Cite

Consider a collection of 802.11 access points. Each serves as the gateway to the Internet for clients in its WiFi cell. These cells have an arbitrary interference pattern, and reception at a client may be corrupted by transmissions nearby. The popularity of WiFi has made such dense deployment increasingly common. As interference can seriously degrade performance, there is much interest in optimizing the configuration of these cells. One factor to consider in optimization is channel share, defined as the useful fraction of channel bandwidth that an access point gets when there is downlink traffic saturation. Interference affects channel share on the sender side through carrier sensing and transmission deferral, and on the receiver side through collisions, which result in exponential backoff and retransmission. There exists a simple, ''back-of-the-envelope'' (BoE) technique to model the impact of pairwise sender-side interference. This paper tackles the harder task of determining the impact of receiver-side and non-pairwise sender-side interference. It proposes a technique for modeling the channel share of wireless links, and the accuracy is demonstrated with Qualnet simulation.keywords 802.11 Á Overlapping Á Markov chain Á Channel share Á Model

show abstract

Section: Problem Statementmentioning

confidence: 99%

Section: Challengesmentioning

confidence: 99%

A model for calculating channel share of 802.11 access points with overlapping wireless cells

Zhao

Tay²

2011

Wireless Netw

View full text Add to dashboard Cite

show abstract

“…In our work, starting from a different view, we try to fulfil uplink throughput requirement and maximize the downlink throughput by tuning the window size instead of limiting the traffic rate. In [5], [13], the performance of multiple uni-directional TCP flows and their throughput fairness in a linear network is studied.…”

Section: Related Workmentioning

confidence: 99%

Bandwidth Allocation for Bi-Directional End-to-End Paths in a Last-Mile Wireless Mesh Network

Hung

Bensaou

2009

GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference

View full text Add to dashboard Cite

In this paper, we study the bandwidth allocation problem on a bi-directional end-to-end path in a last-mile wireless mesh network. We first propose an analytical model to study the interaction between contending links. Based on this model, we formulate the bandwidth allocation problem as a constrained maximization problem that captures real world complexities such as hidden node collisions, multi-hop flows and maximum packet transmission retry limit. The objective of the optimization problem is to maximize the downlink end-to-end throughput under a predefined uplink end-to-end throughput requirement. The optimal setting of each mesh router's contention windows can be obtained from the solution of the optimization problem. Our approach does not require any hardware modification and application layer rate control. Simulation results show that the proposed methodology works very well, the target uplink bandwidth can be reached and the downlink throughput is increased significantly when compared to the IEEE 802.11 standard.

show abstract

“…In particular, it has been demonstrated that nodes close to the gateway in the wireless backhaul 1 This work is in part supported by National Science Council under grant NSC 98-2221-E-194-030. network can starve those that are more hops away [1], [2], [3], [4], [5]. Eliminating the contention from hidden nodes is the key to providing high performance in the backhaul network.…”

Section: Introductionmentioning

confidence: 99%

Achieving Fair Throughput for TCP Flows in Multi-Hop Wireless Backhaul Networks

Hsu

Hou

2010

2010 IEEE International Conference on Communications

View full text Add to dashboard Cite

The use of multihop wireless networks based on the 802.11 technology has been growing. The primary advantages of this approach are mature technology and ease of deployment. However, the fairness property provided by the 802.11 DCF (distributed coordination function) in a single hop environment has been shown to be non-existent in a multihop environment. For example, in the multihop wireless backhaul network, nodes that are more hops away from the gateway are starved by nodes that are closer to the gateway. This paper focuses on the fairness study when TCP flows are carried over wireless backhaul networks. By not modifying lower layer protocols, this work identifies TCP parameters that impact throughput fairness and proposes adjusting those parameters to reduce frame collisions and improve throughput fairness. With the aid of simple mathematical formulations and ns2 simulations, this study finds that the frame transmissions from each node can be effectively controlled by properly controlling the delayed ACK timer and using a suitable advertised window. For chain topology with long hops, the fairness index of our proposed method outperforms basic 802.11 DCF by over 90 percent. The proposed methods are simple and easy to deploy. 1

show abstract

Measurement and Modeling of the Origins of Starvation in Congestion Controlled Mesh Networks

Cited by 18 publications

References 6 publications

A model for calculating channel share of 802.11 access points with overlapping wireless cells

A model for calculating channel share of 802.11 access points with overlapping wireless cells

Bandwidth Allocation for Bi-Directional End-to-End Paths in a Last-Mile Wireless Mesh Network

Achieving Fair Throughput for TCP Flows in Multi-Hop Wireless Backhaul Networks

Contact Info

Product

Resources

About