方法对比

	Slotted ALOHA 随机接入协议	正交频分复用 (OFDM)	香农信道容量定理
领域	电信	电信	电信
方法族	Process / pipeline	Process / pipeline	Process / pipeline
起源年份	1970	1971	1948
提出者	Norman Abramson and Lawrence Roberts	Weinstein and Ebert	Claude Shannon
类型	random access protocol	multicarrier modulation scheme	fundamental theoretical bound
开创性文献	Roberts, L. G. (1975). ALOHA packet system with and without slots and capture. ACM SIGCOMM Computer Communication Review, 5(2), 28-42.	Weinstein, S. B., & Ebert, P. M. (1971). Data transmission by frequency-division multiplexing using the discrete Fourier transform. IEEE Transactions on Communication Technology, 19(5), 628-634.	Shannon, C. E. (1948). A mathematical theory of communication. Bell System Technical Journal, 27(3), 379-423.
别名	random access, medium access	multicarrier modulation	channel capacity, information theory bound
相关	3	5	5
摘要	Slotted ALOHA is a fundamental random access protocol enabling multiple devices to share a wireless channel without centralized coordination. Introduced by Abramson (1970) and refined by Roberts (1975), it divides time into fixed slots and allows devices to transmit at the beginning of a slot with a fixed probability. While simple and elegant, Slotted ALOHA achieves only 37% channel utilization under saturation (optimal traffic load), a fundamental limit discovered by Abramson. Despite this limitation, Slotted ALOHA remains a teaching tool and appears in modern systems like satellite and IoT networks.	OFDM is a multicarrier modulation technique that divides a wideband channel into many narrowband orthogonal subcarriers. Introduced by Weinstein and Ebert in 1971, it exploits the duality between time and frequency domains to efficiently use spectrum while mitigating intersymbol interference in frequency-selective channels. OFDM is now the standard for high-speed wireless systems including WiFi, cellular LTE, and digital broadcasting.	Shannon's channel capacity theorem, published in 1948, establishes the maximum rate at which information can be reliably transmitted over a noisy channel. Expressed as C = B log2(1 + S/N) for additive white Gaussian noise (AWGN), it is a fundamental bound in information theory and communications engineering. Shannon proved that reliable communication is possible at any rate below capacity, and impossible above it. This theorem underpins the design of all modern communication systems and motivates coding theory, modulation, and signal processing techniques.