Throughput of random access without message passing

We develop distributed scheduling schemes that are based on simple random access algorithms and that have no message passing. In spite of their simplicity, these schemes are shown to provide high throughput performance: they achieve the same performance as that of some maximal scheduling algorithms, e.g. Maximum Size scheduling algorithms.

[1]  R. Srikant,et al.  Distributed Link Scheduling With Constant Overhead , 2006, IEEE/ACM Transactions on Networking.

[2]  Jaikumar Radhakrishnan,et al.  Greed is good: Approximating independent sets in sparse and bounded-degree graphs , 1997, Algorithmica.

[3]  Xiaojun Lin,et al.  Constant-Time Distributed Scheduling Policies for Ad Hoc Wireless Networks , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

[4]  Rayadurgam Srikant,et al.  Queue Length Stability of Maximal Greedy Schedules in Wireless Networks , 2006 .

[5]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1992 .

[6]  Alexandre Proutière,et al.  Complexity in wireless scheduling: impact and tradeoffs , 2008, MobiHoc '08.

[7]  Alexandre Proutière,et al.  Performance of random medium access control, an asymptotic approach , 2008, SIGMETRICS '08.

[8]  Ness B. Shroff,et al.  Performance of Random Access Scheduling Schemes in Multi-Hop Wireless Networks , 2006, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[9]  Nick McKeown,et al.  Maximum size matching is unstable for any packet switch , 2003, IEEE Communications Letters.

[10]  F. Kelly.  One-Dimensional Circuit-Switched Networks , 1987 .

[11]  Eytan Modiano,et al.  Maximizing throughput in wireless networks via gossiping , 2006, SIGMETRICS '06/Performance '06.

[12]  Patrick Thiran,et al.  A Packing Approach to Compare Slotted and Non-Slotted Medium Access Control , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.