เปรียบเทียบวิธี

	Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA)	การแบ่งความถี่แบบออร์โธโกนอล (Orthogonal Frequency Division Multiplexing - OFDM)	ทฤษฎีความจุช่องสัญญาณของแชนนอน
สาขาวิชา	โทรคมนาคม	โทรคมนาคม	โทรคมนาคม
ตระกูล	Process / pipeline	Process / pipeline	Process / pipeline
ปีกำเนิด	1990	1971	1948
ผู้ริเริ่ม	Phil Karn	Weinstein and Ebert	Claude Shannon
ประเภท	random access protocol	multicarrier modulation scheme	fundamental theoretical bound
แหล่งต้นตำรับ	Karn, P. (1990). MACA—a new channel access method for packet radio. In Proceedings of the ARRL/CRRL Amateur Radio 9th Computer Networking Conference, 134-140.	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.
ชื่อเรียกอื่น	medium access control, WiFi MAC	multicarrier modulation	channel capacity, information theory bound
ที่เกี่ยวข้อง	3	5	5
สรุป	CSMA/CA is a random access protocol for wireless medium access control, designed to enable multiple devices to share a wireless channel while minimizing collisions. Introduced by Phil Karn in 1990, it is the foundation of WiFi (IEEE 802.11) and is now the de facto standard for unlicensed spectrum access. CSMA/CA combines carrier sensing (listen before transmit) with collision avoidance (RTS/CTS handshake) to improve channel efficiency and fairness, avoiding the efficiency loss of pure random access (Aloha).	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.