Modeling Per-Flow Throughput and Capturing Starvation in CSMA Multi-Hop Wireless Networks

By Michele Garetto, Theodoros Salonidis, Edward W. Knightly. Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications, 2006

400 citations recorded by the source corpus.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/ee9d2f431a2ba77eb7907b0261b3647e51f7155e

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

1. Anmol Sheth
2. L. Subramanian
3. Eric A. Brewer
4. M. Benaim
5. Sonesh Surana
6. Rabin K. Patra
7. J. L. Boudec
8. Jean-Pierre Hubaux

Citations in the corpus

• WiLDNet: Design and Implementation of High Performance WiFi Based Long Distance Networks (2007, background): “[11] show that CSMA performs very badly in multihop wireless networks, and that this is not due to any particular implementation of a CSMA protocol, but is indeed a general coordination problem in multihop wireless networks.”
• A class of mean field interaction models for computer and communication systems (2008, methodology): “The mean field independence is often used in the analysis of interacting objects, sometimes with the name of “decoupling assumption”, in conjunction with a “fixed point” method [17–19].”