Limited Feedback Sensing Algorithms for the Packet Broadcast Channel

IEEE Transactions on Information Theory

Volumn 31, Issue 2, 1985, Pages 280-294

  Georgiadis, Leonidas ^a   Papantoni Kazakos, P ^a  

^a UNIVERSITY OF CONNECTICUT   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA TRANSMISSION - PACKET SWITCHING; DIGITAL COMMUNICATION SYSTEMS; INFORMATION THEORY - COMMUNICATION CHANNELS;

COLLISION RESOLUTION; INFINITE USER POPULATION; LIMITED FEEDBACK SENSING ALGORITHMS; PACKET BROADCAST CHANNEL;

RADIO TRANSMISSION;

EID: 0022034628     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1985.1057018     Document Type: Article

References (14)

1. J. I. Capetanakis, “Tree algorithms for packet broadcast channels,” IEEE Trans. Inform. Theory, vol. IT-25, pp. 505–515, Sept. 1979.
2. R. G. Gallager, “Generalized TDMA: The multi-accessing tree protocol,” in Proc. AFOSR Workshop Commun. Theory Appl. Provincetown, MA, Sept. 17–20, 1978.
3. L. Georgiadis and P. Papantoni-Kazakos, “A collision resolution protocol for random access channels with energy detectors,” IEEE Trans. Comm., vol. COM-30, pp. 2413–2420, Nov. 1982.
4. L. Georgiadis and P. Papantoni-Kazakos, “A high throughput limited sensing protocol,” Univ. of Connecticut, EECS Dept., Tech. Rep. UCT/DEECS/TR-84-1, Feb. 1984. Presented at 1984 Conf. on Information Sciences and Systems, Princeton Univ., Princeton, NJ.
5. M. Georgiopoulo s and P. Papantoni-Kazakos, “Collision resolution protocols utilizing absorptions and collision multiplicities,” Univ. of Connecticut, EECS Dept., Tech. Rep. TR-83-5, Apr. 1983; also, IEEE Trans. Commun. to be published.
6. L. V. Kantorovich and V. I. Krylov, Approximate Methods of Higher Analysis. New York: Interscience, 1958.
7. J. L. Massey, “Collision resolution algorithms and random-access communications,” in Multi-User Communications (CISM Courses and Lectures Series), G. Long, Ed. New York: Springer-Verlag, 1981, pp. 73–137.
8. L. Merakos, “Limited sensing random multiple access using binary feedback,” presented at 1983 Johns Hopkins Conf. on Information Sciences and Systems, Baltimore, MD.
9. B. S. Tsybakov, “Resolution of a conflict of known multiplicity,” Probl. Peredachi Inf., vol. 16, no. 2, pp. 134–144, 1980.
10. B. S. Tsybakov and V. A. Mikhailov, “Slotted multiaccess packet-broadcasting broadcasting feedback channel,” Probl. Peredachi Inf., vol. 14, no. 4, 1978.
11. B. S. Tsybakov and N. D. Vvedenskaya, “Random multiple-access stack algorithm,” Probl. Peredachi Inf., vol. 16, no. 3, pp. 80–94, 1980.
12. N. D. Vvedenskaya and B. S. Tsybakov, “Random multiple access of packets to a channel with errors,” Probl. Peredachi Inf., vol. 19, no. 2, pp. 52–68, 1982.
13. G. Fayo lle, P. Flajolet, M. Hofri, and P. Jacquet, “The evaluation of packet transmission characteristics in a multiaccess collision detection channel with stack collision resolution protocol,” Computer Science Dept., Technion, Israel Institute of Technology, Haifa, Tech. Rep. 293, Oct. 1983.
14. L. Merakos, “Stack algorithm for local area networks using carrier sense multiple access channels,” EECS Dept., Univ. of Connecticut, Storrs, CT, Tech. Rep. TR-84-6, June 1984.