Carrier-sense multiple access

Last updated

Carrier-sense multiple access (CSMA) is a medium access control (MAC) protocol in which a node verifies the absence of other traffic before transmitting on a shared transmission medium, such as an electrical bus or a band of the electromagnetic spectrum.

Contents

Under CSMA, a transmitter uses a carrier-sense mechanism to determine whether another transmission is in progress before initiating a transmission. That is, it tries to detect the presence of a carrier signal from another node before attempting to transmit. If a carrier is sensed, the node waits for the transmission in progress to end before initiating its own transmission. Using CSMA, multiple nodes may, in turn, send and receive on the same medium. Transmissions by one node are generally received by all other nodes connected to the medium.

Variations on basic CSMA include addition of collision-avoidance (CSMA/CA), collision-detection (CSMA/CD) and collision-resolution techniques.

Access modes

Variations of CSMA use different algorithms to determine when to initiate transmission onto the shared medium. A key distinguishing feature of these algorithms is how aggressive or persistent they are in initiating transmission. A more aggressive algorithm may begin transmission more quickly and utilize a greater percentage of the available bandwidth of the medium. This is typically at the expense of an increased likelihood of collision with other transmitters.

1-persistent
1-persistent CSMA is an aggressive transmission algorithm. When the transmitting node is ready to transmit, it senses the transmission medium for idle or busy. If idle, then it transmits immediately. If busy, then it senses the transmission medium continuously until it becomes idle, then transmits the message (a frame) unconditionally (i.e. with probability=1). In case of a collision, the sender waits for a random period of time and attempts the same procedure again. 1-persistent CSMA is used in CSMA/CD systems including Ethernet.
Non-persistent
Non persistent CSMA is a non-aggressive transmission algorithm. When the transmitting node is ready to transmit data, it senses the transmission medium for idle or busy. If idle, then it transmits immediately. If busy, it jumps to the final random waiting step of 1-persistent CSMA directly before repeating the whole logic cycle again: it does not persist in checking the busy channel trying to get its transmission through, hence the name. This approach reduces the chance of collision and results in overall higher medium throughput but with a penalty of longer initial delay compared to 1–persistent.
P-persistent
This approach lies between the 1-persistent and non-persistent CSMA access modes. [1] When the transmitting node is ready to transmit data, it senses the transmission medium for idle or busy. If idle, then it transmits immediately. If busy, then it senses the transmission medium continuously until it becomes idle, then transmits with probability p. If the node does not transmit (the probability of this event is 1-p), it waits for a random period of time before re-attempting the same procedure, using the same probability p [2] . If the transmission medium is not busy, it transmits again with the same probability p. This probabilistic hold-off repeats until the frame is finally transmitted or when the medium is found to become busy again (i.e. some other node has already started transmitting). In the latter case the node repeats the whole logic cycle (which started with sensing the transmission medium for idle or busy) again. p-persistent CSMA is used in CSMA/CA systems including Wi-Fi and other packet radio systems. Note that p = 0-persistent CSMA is different from non-persistent CSMA. Both can only transmit at the start of the procedure (if the channel is idle), but their behaviour on a busy channel differs: non-persistent CSMA doesn't attempt to sense the channel and restarts its logical cycle, whilst p = 0 necessarily gets stuck in an infinite loop of waiting (since it has zero probability of transmission even if the channel goes back to being idle).
O-persistent
Each node is assigned a transmission order by a supervisory node. When the transmission medium goes idle, nodes wait for their time slot in accordance with their assigned transmission order. The node assigned to transmit first transmits immediately. The node assigned to transmit second waits one time slot (but by that time the first node has already started transmitting). Nodes monitor the medium for transmissions from other nodes and update their assigned order with each detected transmission (i.e. they move one position closer to the front of the queue). [3] O-persistent CSMA is used by CobraNet, LonWorks and the controller area network.

Protocol modifications

When broadcasting over vehicular ad hoc networks, the original 1-persistence and p-persistence strategies often cause the broadcast storm problem.[ citation needed ] To improve performance, engineers developed three modified techniques: weighted p-persistence, slotted 1-persistence, and slotted p-persistence. [4] [5]

Carrier-sense multiple access with collision detection
CSMA/CD is used to improve CSMA performance by terminating transmission as soon as a collision is detected, thus shortening the time required before a retry can be attempted. CSMA/CD is used by Ethernet.
Carrier-sense multiple access with collision avoidance
In CSMA/CA collision avoidance is used to improve the performance of CSMA. If the transmission medium is sensed busy before transmission, then the transmission is deferred for a random interval. This random interval reduces the likelihood that two or more nodes waiting to transmit will simultaneously begin transmission upon termination of the detected transmission, thus reducing the incidence of collision. CSMA/CA is used by Wi-Fi.
CSMA with Collision Resolution
CSMA/CR uses priorities in the frame header to avoid collisions. It is used in the Controller Area Network.
Virtual time CSMA
VTCSMA is designed to avoid collision generated by nodes transmitting signals simultaneously, used mostly in hard real-time systems. It uses two clocks to prioritize messages based on their deadline. [6]

See also

Related Research Articles

<span class="mw-page-title-main">Carrier-sense multiple access with collision avoidance</span> Computer network multiple access method

Carrier-sense multiple access with collision avoidance (CSMA/CA) in computer networking, is a network multiple access method in which carrier sensing is used, but nodes attempt to avoid collisions by beginning transmission only after the channel is sensed to be "idle". When they do transmit, nodes transmit their packet data in its entirety.

Carrier-sense multiple access with collision detection (CSMA/CD) is a medium access control (MAC) method used most notably in early Ethernet technology for local area networking. It uses carrier-sensing to defer transmissions until no other stations are transmitting. This is used in combination with collision detection in which a transmitting station detects collisions by sensing transmissions from other stations while it is transmitting a frame. When this collision condition is detected, the station stops transmitting that frame, transmits a jam signal, and then waits for a random time interval before trying to resend the frame.

In telecommunications and computer networks, a channel access method or multiple access method allows more than two terminals connected to the same transmission medium to transmit over it and to share its capacity. Examples of shared physical media are wireless networks, bus networks, ring networks and point-to-point links operating in half-duplex mode.

ALOHAnet, also known as the ALOHA System, or simply ALOHA, was a pioneering computer networking system developed at the University of Hawaii.

A collision domain is a network segment connected by a shared medium or through repeaters where simultaneous data transmissions collide with one another. The collision domain applies particularly in wireless networks, but also affected early versions of Ethernet. A network collision occurs when more than one device attempts to send a packet on a network segment at the same time. Members of a collision domain may be involved in collisions with one another. Devices outside the collision domain do not have collisions with those inside.

Distributed coordination function (DCF) is the fundamental medium access control (MAC) technique of the IEEE 802.11-based WLAN standard. DCF employs a carrier-sense multiple access with collision avoidance (CSMA/CA) with the binary exponential backoff algorithm.

<span class="mw-page-title-main">Hidden node problem</span> Problem in wireless networking

In wireless networking, the hidden node problem or hidden terminal problem occurs when a node can communicate with a wireless access point (AP), but cannot directly communicate with other nodes that are communicating with that AP. This leads to difficulties in medium access control sublayer since multiple nodes can send data packets to the AP simultaneously, which creates interference at the AP resulting in no packet getting through.

<span class="mw-page-title-main">Bus network</span> Network topology in which nodes are connected to a common communications medium

A bus network is a network topology in which nodes are directly connected to a common half-duplex link called a bus.

RTS/CTS is the optional mechanism used by the 802.11 wireless networking protocol to reduce frame collisions introduced by the hidden node problem. Originally the protocol fixed the exposed node problem as well, but modern RTS/CTS includes ACKs and does not solve the exposed node problem.

A random-access channel (RACH) is a shared channel used by wireless terminals to access the mobile network for call set-up and bursty data transmission. Whenever mobile wants to make an MO call it schedules the RACH. RACH is transport-layer channel; the corresponding physical-layer channel is PRACH.

Exponential backoff is an algorithm that uses feedback to multiplicatively decrease the rate of some process, in order to gradually find an acceptable rate. These algorithms find usage in a wide range of systems and processes, with radio networks and computer networks being particularly notable.

<span class="mw-page-title-main">Beacon frame</span>

A beacon frame is a type of management frame in IEEE 802.11 WLANs. It contains information about the network. Beacon frames are transmitted periodically; they serve to announce the presence of a wireless LAN and to provide a timing signal to synchronise communications with the devices using the network. In an infrastructurebasic service set (BSS), beacon frames are transmitted by the access point (AP). In ad hoc (IBSS) networks, beacon generation is distributed among the stations. For the 2.4 GHz spectrum, when having more than 15 SSIDs on non-overlapping channels, beacon frames start to consume significant amount of air time and degrade performance even when most of the networks are idle.

In computer networking, carrier-sense multiple access with collision avoidance and resolution using priorities (CSMA/CARP) is a channel access method. CSMA/CARP is similar in nature to the carrier-sense multiple access with collision detection (CSMA/CD) channel access method used in Ethernet networks, but CSMA/CARP provides no detection of network collisions. Instead of detecting network collisions, CSMA/CARP attempts to avoid collisions by using a system of transmission priorities.

<span class="mw-page-title-main">Orthogonal frequency-division multiple access</span> Multi-user version of OFDM digital modulation

Orthogonal frequency-division multiple access (OFDMA) is a multi-user version of the popular orthogonal frequency-division multiplexing (OFDM) digital modulation scheme. Multiple access is achieved in OFDMA by assigning subsets of subcarriers to individual users. This allows simultaneous low-data-rate transmission from several users.

Multiple Access with Collision Avoidance for Wireless (MACAW) is a slotted medium access control (MAC) protocol widely used in ad hoc networks. Furthermore, it is the foundation of many other MAC protocols used in wireless sensor networks (WSN). The IEEE 802.11 RTS/CTS mechanism is adopted from this protocol. It uses RTS-CTS-DS-DATA-ACK frame sequence for transferring data, sometimes preceded by an RTS-RRTS frame sequence, in view to provide solution to the hidden node problem. Although protocols based on MACAW, such as S-MAC, use carrier sense in addition to the RTS/CTS mechanism, MACAW does not make use of carrier sense.

The network allocation vector (NAV) is a virtual carrier-sensing mechanism used with wireless network protocols such as IEEE 802.11 (Wi-Fi) and IEEE 802.16 (WiMax). The virtual carrier-sensing is a logical abstraction which limits the need for physical carrier-sensing at the air interface in order to save power. The MAC layer frame headers contain a duration field that specifies the transmission time required for the frame, in which time the medium will be busy. The stations listening on the wireless medium read the Duration field and set their NAV, which is an indicator for a station on how long it must defer from accessing the medium.

In statistical time division multiplexing, contention is a media access method that is used to share a broadcast medium. In contention, any computer in the network can transmit data at any time.

<span class="mw-page-title-main">Mobile Slotted Aloha</span>

Mobile Slotted Aloha (MS-Aloha) is a wireless network protocol proposed for applications such as vehicle networks.

Zebra Media Access Control (Z-MAC) is a network protocol for wireless sensor networks. It controls how a Media Access Control (MAC) accesses a common communication medium of a network.

<span class="mw-page-title-main">Evolved wireless ad hoc network</span> Decentralized wireless network

An evolved wireless ad hoc network (EVAN) is a decentralized type of wireless network that compensates for the shortcomings of the existing wireless ad hoc network (WANET). An EVAN is ad hoc like a WANET because it does not rely on a pre-existing infrastructure, such as routers in wired networks or access points in wireless networks. Further advantages of WANETs over networks with a fixed topology include flexibility, scalability and lower administration costs. These characteristics of WANETs are maintained in EVAN as well. However, an EVAN has a physically separate resource management channel called tone channel, unlike existing WANETs. In WANETs, the data channel performs two roles: resource management and data transfer, but in EVAN, the data channel is used only for data transfer.

References

  1. F. Calí, M. Conti, and E. Gregori, "Dynamic IEEE 802.11: design, modeling and performance evaluation," IEEE J. Selected Areas Commun., vol. 18, pp. 1774–1786, Sept. 2000
  2. Kleinrock, L.; Tobagi, F. (December 1975). "Packet Switching in Radio Channels: Part I--Carrier Sense Multiple-Access Modes and Their Throughput-Delay Characteristics". IEEE Transactions on Communications. 23 (12): 1400–1416. doi:10.1109/TCOM.1975.1092768. ISSN   0096-2244. S2CID   5879608.
  3. US 5761431,Gross, Kevin Paul; Anderson, Charles William& Lieb, Derek Wearin,"Order persistent timer for controlling events at multiple processing stations",published 1998-06-02, assigned to Peak Audio Inc.
  4. Najafzadeh; Ithnin; Karimi. "An Analytical Model for Sparse and Dense Vehicular Ad hoc Networks". "Advances in Computer Science and Information Technology": First International Conference on Computer Science and Information Technology, CCSIT 2011. p. 211.
  5. Choi et al.: "Robust broadcast scheme regardless of vehicle distribution in vehicular ad hoc networks". EURASIP Journal on Wireless Communications and Networking 2014 2014:133. doi : 10.1186/1687-1499-2014-133 [accessed Sep 2, 2017].
  6. Krishna, C. M.; Shin, K. G. (1997). Real-Time Systems. McGraw-Hill Higher Education. p. 240. ISBN   978-0-07-070115-1.
General