|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| I. Chlamtac, A. Farago, "An Optimal Channel Access Protocol with Multiple Reception Capacity," IEEE Transactions on Computers, vol. 43, no. 4, pp. 480-484, April, 1994. | |||
| BibTex | x | ||
| @article{ 10.1109/TC.1994.10000, author = {I. Chlamtac and A. Farago}, title = {An Optimal Channel Access Protocol with Multiple Reception Capacity}, journal ={IEEE Transactions on Computers}, volume = {43}, number = {4}, issn = {0018-9340}, year = {1994}, pages = {480-484}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1994.10000}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - An Optimal Channel Access Protocol with Multiple Reception Capacity IS - 4 SN - 0018-9340 SP480 EP484 EPD - 480-484 A1 - I. Chlamtac, A1 - A. Farago, PY - 1994 KW - protocols; code division multiple access; storage management; packet radio networks; packet switching; optimal channel access protocol; multiple reception capacity; packet communication model; multiple access; channel access protocol; homogeneous load; maximum achievable throughput; packet radio networks; FDMA; CDMA. VL - 43 JA - IEEE Transactions on Computers ER - | |||
A multiple access packet communication model is analyzed in which the users can receive packets on more than one common channel. For this type of system, a new channel access protocol is presented. The authors prove that under heavy homogeneous load the protocol guarantees the maximum achievable throughput among all possible protocols. The general model can be applied to different systems, according to various realizations of the logical channels. For example, in packet radio networks the channels can be realized by different carrier frequencies (FDMA) or by different codes (CDMA). The simplicity and optimality of the protocol make it attractive for practical applications.
[1] D. Bertsekas and R. Gallager,Data Networks. 2nd ed. Englewood Cliffs, NJ: Prentice Hall, 1992.
[2] M. B. Pursley and S. T. Sandberg, "Delay and throughput for three transmission schemes in packet radio networks,"IEEE Trans. Commun., vol. 37, pp. 1264-1274, 1989.
[3] A. Kershenbaum and M. J. Post, "Distributed scheduling of CDMA networks with minimal information,"IEEE Trans. Commun., vol. 39, pp. 17-20, 1991.
[4] I. Chlamtac and S. S. Pinter, "Distributed nodes organization algorithm for channel access in a multihop dynamic radio network,"IEEE Trans. Comput., vol. C-36, no. 6, June 1987.
[5] E. S. Sousa and J. A. Silvester, "Spreading code protocols for distributed spread-spectrum packet ratio networks,"IEEE Trans. Commun., pp. 272-281, Mar. 1988.
[6] J. E. Wieselthier and A. Ephremides, "A distributed reservation scheme for spread spectrum multiple access channels,"Proc. GLOBECOM'83, pp. 659-665.
[7] M. B. Pursley, "Throughput of frequency hopped spread spectrum communications for packet radio networks,"Proc. 1983 Conf. Inform. Sci. Syst., Mar. 1983.
[8] A. M. Chou and V. O. K. Li, "Slot allocation strategies for TDMA protocols in multihop packet radio networks,"Proc. INFOCOM'92, Florence, Italy, May 1992, pp. 5C.4.1.-5C.4.6.
[9] A. Faragó, I. Chlamtac and H. Y. Ahn, "A nearly optimum slot allocation algorithm for TDMA protocols in case of multiple reception capacity,"MILCOM, pp. 769-773, Oct. 1992.