Maximizing throughput in wireless networks via gossiping

By Eytan H. Modiano, Devavrat Shah, Gil Zussman. SIGMETRICS '06/Performance '06, 2006

351 citations recorded by the source corpus.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/389227f2fc1aedf402d541eadf929ea4bb34fb24

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. Ness B. Shroff
2. Devavrat Shah
3. Changhee Joo
4. Xiaojun Lin
5. Ravi R. Mazumdar
6. Gaurav Sharma
7. Jean C. Walrand
8. Libin Jiang

Citations in the corpus

• Understanding the Capacity Region of the Greedy Maximal Scheduling Algorithm in Multihop Wireless Networks (2008, background): “Over the last few years there has been significant interest in studying the scheduling problem for multi-hop wireless networks [1]‐[ 9 ].”
• On the Complexity of Scheduling in Wireless Networks (2006, background): “Recently, a class of throughput-optimal scheduling policies, called pick-andcompare, has been proposed [16, 17].”
• Gossip Algorithms (2009, methodology): “[51] exhibited a throughput optimal, extremely simple distributed scheduling algorithm with matching constraints.”
• A Distributed CSMA Algorithm for Throughput and Utility Maximization in Wireless Networks (2010, methodology): “The extensions to more general interference models, as discuss ed in [4] and [5], usually involves extra challenges.”