Throughput of random access without message passing

CISS 2008, The 42nd Annual Conference on Information Sciences and Systems

Volumn , Issue , 2008, Pages 509-514

  Proutière, Alexandra ^a   Yi, Yung ^b   Chiang, Mung ^b  

^a MICROSOFT RESEARCH   (United Kingdom)

^b Princeton University

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION; CYBERNETICS; ELECTRON BEAM LITHOGRAPHY; INFORMATION MANAGEMENT; INFORMATION SCIENCE; MESSAGE PASSING; SCHEDULING; TELECOMMUNICATION NETWORKS; THROUGHPUT;

ANNUAL CONFERENCE; DISTRIBUTED SCHEDULING; HIGH THROUGHPUTS; RANDOM ACCESS; RANDOM ACCESS ALGORITHMS;

SCHEDULING ALGORITHMS;

EID: 51849167395     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CISS.2008.4558579     Document Type: Conference Paper

References (14)

1. E. Modiano, D. Shah, and G. Zussman. "Maximizing throughput in wireless networks via gossiping," in Proceedings of ACM Sigmetrics, 2006.
2. S. Sanghavi, L. Bui, and R. Srikant, "Distributed link scheduling with constant overhead," in Proceedings of ACM Sigmetrics, 2007.
3. Y. Yi and M. Chiang, "Wireless scheduling with o(1) complexity for mhop interference model," in Proceedings of IEEE ICC, 2008, to appear.
4. Y Yi, A. Proutiere, and M. Chiang, "Complexity in wireless scheduling: Impact and tradeoffs," in Proceedings of ACM Mobihoc, 2008, to appear.
5. L. Tassiulas and A. Ephremides, "Stability properties of constrained queueing systems and scheduling for maximum throughput in multihop radio networks," IEEE Transactions on Automatic Contrl. vol. 37. no. 12, pp. 1936-1949. December 1992.
6. X. Lin and S. Rasool. "Constant-time distributed scheduling policies for ad-hoc wireless networks," in Proceedings of IEEE Conf. on Decision and, Control. 2006.
7. C. Joo and N. B. Shroff. "Performance of random access scheduling schemes in multi-hop wireless networks," in Proceedings of IEEE Infocom, 2007.
8. M. Durvy and P. Thiran, "Packing approach to compare slotted and non-slotted medium access control," in Proceedings of IEEE Infocom, 2006.
9. F. Kelly, "One-dimensional circuit-switched networks," Annals of Probability, vol. 15, pp. 1166-1179, 1987.
10. P. Chaporkar, K. Kar, and S. Sarkar, "Throughput guarantees in maximal matching in wireless networks," in Proceedings of the 43rd Annual Allerton Conference on Communication, Control, and Computing, 2005.
11. X. Wu, R. Srikant, and J. R. Perkins, "Queue-length stability of maximal greedy schedules in wireless networks," IEEE Transactions on Mobile Computing, vol. June. pp. 595-605, 2007.
12. C. Bordenave, D. McDonald, and A. Proutiere, "Performance of random multi-access algorithms, an asymptotic approach," Proceedings of ACM Sigmetrics, 2008.
13. M. M. Halldorsson and J. Radhakrishnan, "Greedy is good: Approximating independent sets in sparse and bounded-degree graphs," Algorithmica, vol. 18, no. 1, pp. 145-163, 1997.
14. R. Zhang-Shen, I. Keslassy, and N. McKeown, "Maximum size matching is unstable in any packet switch," Technical report, Stanford Univ., TR03-HPNG-030I00, 2003.