Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

114

Voted

MOBIHOC
2008
ACM

135views Computer Networks» more MOBIHOC 2008»

A local greedy scheduling scheme with provable performance guarantee

16 years 2 months ago

A local greedy scheduling scheme with provable performance guarantee

Download www.ece.osu.edu

Changhee Joo

Real-time Traffic

MOBIHOC 2008 | Provable Performance Guarantee | Wireless Networks |

claim paper

Related Content

» Performance of Random Access Scheduling Schemes in MultiHop Wireless Networks

» Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory

» Landmark Selection and Greedy LandmarkDescent Routing for Sensor Networks

» Fairness and throughput guarantees with maximal scheduling in multihop wireless networks

» Provable algorithms for parallel generalized sweep scheduling

» Provably good and practically efficient algorithms for CMP dummy fill

» A tokenbased scheduling scheme for WLANs supporting voicedata traffic and its performance ...

» Toward a theory of transactional contention managers

» Optimal beam scheduling for multicasting in wireless networks

Post Info
More Details (n/a)

Added	24 Dec 2009
Updated	24 Dec 2009
Type	Conference
Year	2008
Where	MOBIHOC
Authors	Changhee Joo

Comments (0)