This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Random Multiple Access Algorithms Using a Control Mini-Slot
April 1997 (vol. 46 no. 4)
pp. 473-476

Abstract—The multiple access problem as characterized by infinite user population and a slotted-time channel is examined, and an algorithm that utilizes a control mini-slot is proposed. The stability region of the proposed algorithm is determined and compared to the random access algorithm with the highest known throughput. A break-even point is also given.

[1] D. Bertzekas and R. Gallager, Data Networks, second ed. Prentice-Hall, 1992.
[2] J.I. Capetankis, "Tree Algorithm for Packet Broadcasting Channel," IEEE Trans. Information Theory, vol. 25, pp. 505-515, Sept. 1979.
[3] R.G. Gallager, "Conflict Resolution in Random Access Broadcast Networks," Proc. AFOSR Workshop Comm. Theory and Applications, pp. 74-76,Provincetown, Mass., 1978.
[4] J.F. Hayes, "An Adaptive Technique for Local Distribution," IEEE Trans. Comm., vol. 26, pp. 1,476-1,484, 1978.
[5] J. Mosely, "An Efficient Contention Resolution Algorithm for Multiple Access Channels," Report LIDS-TH-918, Laboratory for Information and Decision Systems, Massachusetts Inst. of Tech nology, 1979.
[6] L. Georgiadis and P. Papantoni-Kazakos, "Collision Resolution Protocol for Random Access Channels with Energy Detectors," IEEE Trans. Comm., vol. 30, pp. 2,413-2,420, 1982.
[7] M. Paterakis, L. Georgiadis, and P. Papantoni-Kazakos, "On the Relation between the Finite and Infinite Population Models for a Class of RAAs," IEEE Trans. Comm., vol. 35, pp. 1,239-1,240, 1987.
[8] M. Paterakis and P. Papantoni-Kazakos, "A Simple Window Random Access Algorithm with Advantageous Properties," IEEE Trans. Information Theory, vol. 35, pp. 1,124-1,130, 1989.
[9] B.S. Tsybakov and V.A. Mikhailov, "Slotted Multiaccess Packet Broadcasting Feedback Channel," Problemi Peredachi Informatsii, vol. 14, 1978.
[10] B.S. Tsybakov and V.A. Mikhailov, "Packet Random Multiple Access: Part-and-Try Algorithm," Problemi Peredachi Informatsii, vol. 16, pp. 65-79, 1980.
[11] V.A. Mikhailov and B.S. Tsybakov, "Upper Bound for the Capacity of a Random Multiple Access System," Problemi Peredachi Informatsii, vol. 17, pp. 90-95, 1981.

Citation:
Dimitri Kazakos, Lazaros F. Merakos, Hakan Deliç, "Random Multiple Access Algorithms Using a Control Mini-Slot," IEEE Transactions on Computers, vol. 46, no. 4, pp. 473-476, April 1997, doi:10.1109/12.588061
Usage of this product signifies your acceptance of the Terms of Use.