Vertaile menetelmiä
Tarkastele valitsemiasi menetelmiä rinnakkain; eroavat rivit korostetaan.
| Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA)× | Shannonin kanavakapasiteettiteoreema× | |
|---|---|---|
| Tieteenala | Tietoliikennetekniikka | Tietoliikennetekniikka |
| Menetelmäperhe | Process / pipeline | Process / pipeline |
| Syntyvuosi≠ | 1990 | 1948 |
| Kehittäjä≠ | Phil Karn | Claude Shannon |
| Tyyppi≠ | random access protocol | fundamental theoretical bound |
| Alkuperäislähde≠ | 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. link ↗ | Shannon, C. E. (1948). A mathematical theory of communication. Bell System Technical Journal, 27(3), 379-423. DOI ↗ |
| Rinnakkaisnimet | medium access control, WiFi MAC | channel capacity, information theory bound |
| Liittyvät≠ | 3 | 5 |
| Tiivistelmä≠ | 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). | 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. |
| ScholarGateAineisto ↗ |
|
|