High-throughput random access using successive interference cancellation in a tree algorithm

IEEE Transactions on Information Theory

Volumn 53, Issue 12, 2007, Pages 4628-4639

  Yu, Yingqun ^a   Giannakis, Georgios B ^a  

^a University of Minnesota   (United States)

Author keywords

Collision resolution; Markov chain; Maximum stable throughput; Random access; Tree protocol

Indexed keywords

COLLISION RESOLUTION; MARKOV CHAIN; MAXIMUM STABLE THROUGHPUT; RANDOM ACCESS; TREE PROTOCOL;

DECODING; INTERNET; MARKOV PROCESSES; RADIO INTERFERENCE; SECURITY OF DATA; TREES (MATHEMATICS);

THROUGHPUT;

EID: 64649085106     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2007.909080     Document Type: Article

References (36)

1. N. Abramson, "The Aloha system - Another alternative for computer communications," in Proc. Fall Joint Comput. Conf., Apr. 1970, vol. 37, pp. 281-285.
2. D. Bertsekas and R. Gallager, Data Networks, 2nd ed. Englewood Cliffs, NJ: Prentice-Hall, 1992.
3. B. Bing, Broadband Wireless Access. Amsterdam, The Netherlands: Kluwer Academic, 2000.
4. J. I. Capetanakis, "Tree algorithms for packet broadcast channels," IEEE Trans. Inf. Theory, vol. IT-25, no. 5, pp. 505-515, Sep. 1979.
5. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
6. G. Dimic, N. D. Sidiropoulos, and L. Tassiulas, "Wireless networks with retransmission diversity access mechanisms: Stable throughput and delay properties," IEEE Trans. Signal Process., vol. 51, no. 8, pp. 2019-2030, Aug. 2003.
7. ETSI, Digital Video Broadcasting (DVB); DVB Interaction Channel for Cable-TV Distribution Systems (CATV), 1998, prETS 300 800.
8. G. J. Foschini, "Layered space-time architecture for wireless communications in a fading environment when using multiple antennas," AT &T Bell Labs Tech. J., vol. 1, no. 2, pp. 41-59, 1996.
9. R. Gallager, "A perspective on multiaccess channels," IEEE Trans. Inf. Theory, vol. IT-27, no. 2, pp. 124-142, Mar. 1985.
10. L. Georgiades, L. F. Merakos, and P. Papantoni-Kazakos, "A method for the delay analysis of random multiple-access algorithms whose delay process is regenerative," IEEE J. Select. Areas Commun., vol. 5, no. 6, pp. 1051-1062, Jul. 1987.
11. G. D. Golden, G. J. Foschini, R. A. Valenzuela, and P. W. Wolniansky, "Detection algorithm and initial laboratory results using the V-BLAST space-time communications architecture," Electron. Lett., vol. 35, no. 7, pp. 14-19, Jan. 1999.
12. N. Golmie, Y. Saintillan, and D. H. Su, "A review of contention resolution algorithms for IEEE 802.14 networks," IEEE Commun. Surve. First Quarter, 1999.
13. Cable-TV Access Method and Physical Layer Specification, Draft 3, Revison 3, IEEE 802.14 WG, IEEE, 1998.
14. L. Kleinrock and F. Tobagi, "Packet switching in radio channels: Part I - Carrier sense multiple-access modes and their throughput delay characteristics," IEEE Trans. Commun., vol. COM-23, no. 9, pp. 1400-1416, Sep. 1975.
15. R. Loynes, "The stability of a queue with nonindependent inter-arrival and service times," Proc. Camb. Philos. Soc., pp. 497-520, 1962.
16. J. L. Massey, "Collision Resolution Algorithm and Random Access Communications," in Multiuser Communication Systems (CISM Course and Lecture Notes), G. Longo, Ed. New York: Spriger-Verlag, 1981, vol. 265.
17. P. Mathys and P. Flajolet, "Q-ary collision resolution algorithms in random-access systems with free or blocked channel access," IEEE Trans. Inf. Theory, vol. IT-31, no. 2, pp. 217-243, Mar. 1985.
18. MCNS, Data-Over-Cable Service Interface Specifications, Radio Frequency Interface Specification, Ref. SP-RFIv1.1-PI01-990226 1999.
19. M. L. Molle and G. C. Polyzos, Conflict Resolution Algorithms and Their Performance Analysis Dept. Computer Sci. Eng., University of California, San Diego, La Jolla, CA, 1993, Tech. Rep. CS93-300.
20. M. L. Molle and A. C. Shih, Computation of the Packet Delay in Massey's Standard and Modified Tree Conflict Resolution Algorithms With Gated Access Computer Syst. Res. Inst., Univ. Toronto, Toronto, ON, Canada, 1992, Tech. Rep. CSRI-264.
21. J. Mosely and P. A. Humblet, "A class of efficient contention resolution algorithms for multiple access," IEEE Trans. Commun., vol. COM-33, no. 2, pp. 145-151, Feb. 1985.
22. A. G. Pakes, "Some conditions for ergodicity and recurrence of Markov chains," Oper. Res., vol. 17, pp. 1058-1061, 1969.
23. G. C. Polyzos, A Queueing Theoretic Approach to the Delay Analysis for a Class of Conflict Resolution Algorithms Computer Syst. Res. Inst., Univ. Toronto, Toronto, ON, Canada, 1989, Tech. Rep. CSRI224.
24. J. G. Proakis, Digital Communications, 4th ed. New York: McGrawHill, 2000.
25. R. Rom and M. Sidi, Multiple Access Protocols: Performance and Analysis. New York: Springer-Verlag, 1990.
26. G. Ruget, "Some Tools for the Study of Channel Sharing Algorithms," in Multiuser Communication Systems (CISM Course and Lecture Notes), G. Longo, Ed. New York: Spriger-Verlag, 1981, vol. 265.
27. Y. E. Sagduyu and A. Ephremides, "Energy-efficient collision resolution in wireless ad-hoc networks," in Proc. INFOCOM Conf., San Francisco, CA, Mar./Apr. 2003, vol. 1, pp. 492-502.
28. A. S. Tanenbaum, Computer Networks, 4th ed. Upper Saddle River, NJ: Prentice-Hall, 2003.
29. M. K. Tsatsanis, R. Zhang, and S. Banerjee, "Network-assisted diversity for random access wireless networks," IEEE Trans. Signal Process. vol. 48, no. 3, pp. 702-711, Mar. 2000.
30. B. S. Tsybakov and N. Likhanov, "Upper bound on the capacity of a random multiple access system," (in Russian) Probl. Pered. Inform. vol. 23, no. 3, pp. 246-236, Jul./Sep. 1987.
31. B. S. Tsybakov and V. A. Mikhailov, "Free synchronous packet access in a broadcast channel with feedback," (in Russian) Probl. Pered. Inform., vol. 14, no. 4, pp. 32-59, Oct./Dec. 1978.
32. B. S. Tsybakov and V. A. Mikhailov, "Random multiple packet access: Part-and-try algorithm," (in Russian) Probl. Pered. Inform., vol. 16, no. 4, pp. 65-79, Oct./Dec. 1980.
33. M. X. van den Broek, I. B. J. F. Adan, N. S. Shankar, and S. C. Borst, "A novel mechanism for contention resolution in HFC networks," in Proc. INFOCOM Conf., San Francisco, CA, Mar./Apr. 2003, vol. 2, pp. 979-989.
34. S. Verdú, Multiuser Detection. Cambridge, U.K.: Cambridge Univ. Press, 1998.
35. Y. Yu and G. B. Giannakis, "SICTA: A 0.693 contention tree algorithm using successive interference cancellation," in Proc. INFOCOM Conf. Miami, FL, Mar. 2005, vol. 3, pp. 1908-1916.
36. R. Zhang, N. D. Sidiropoulos, and M. K. Tsatsanis, "Collision resolution in packet radio networks using rotational invariance techniques," IEEE Trans. Commun., vol. 50, no. 1, pp. 146-155, Jan. 2002