At the 2008 IEEE Conference on Computer Communications (INFOCOM), the best paper award was given to Drs. Changhee Joo (OSU-CSE Post-Doctoral Researcher), Xiaojun Lin (Purdue University) and Ness Shroff (OSU CSE/ECE) for their work, "Understanding the Capacity Region of the Greedy Maximal Scheduling Algorithm in Multi-hop Wireless Networks." This work analyzes the performance of Greedy Maximal Scheduling (GMS), an important class of scheduling scheme. From the abstract: "While a lower bound on the throughput performance of GMS is relatively well-known in the simple node-exclusive interference model it has not been thoroughly explored in the more realistic interference models. Moreover, empirical observations suggest that the known bounds on GMS are quite loose, and that the performance of GMS is often close to optimal. In this paper, a number of new analytic results based on characterizing the performance of GMS via a topological property are provided. It is shown that GMS achieves the full capacity region for certain networks under the general K-hop interference model, and new sharper bounds on its performance are provided for general network configurations."
The INFOCOM annual meeting, sponsored by IEEE Communications Society, focuses on traffic management and protocols though also addresses key topics and issues across computer communications. Attendees participate in technical sessions, tutorials, panel discussions, workshops and many networking opportunities.