Multiple ACCESS protocol

ypes of Multiple access protocol

Transmission Technology
Transmission technology can be categorized into two categories :
Point-to point networks Broadcast networks

Two types of transmission technology

Point-to-Point Link

Broadcast Link

Point-to-point networks Point-to-point networks are those in which when a message is

sent from one computer to another, it usually has to be sent via other computers in the network. A point-to-point network consists of many connections between individual pairs of computers.

Broadcast networks
Broadcast networks have a single communication channel that is shared by all the machines on the network. A packet sent by one computer is received by all the other computers on the network. The packets that are sent contain the address of the receiving computer; each computer checks this field to see if it matches its own address. If it does not then it is usually ignored; if it does then it is read. Broadcast channels are sometimes known as multi-access channel.

One Shared channel

Need of protocols in Broadcast channel

Issues in multi-access channel :
WHO is going to use the channel ? WHEN the channel is going to be used ? For HOW much time the channel is used ?

Due to shared channel and unregulated traffic over the network ..collisions and data loss occur. Some protocol must be followed for regulated and safe transmission over the network.

Multiple ACCESS protocol

(Medium access protocol) is a sub layer of Data link layer. MAC is the bottom part of the Data link layer. The protocols used to determine who goes next on a multi-access channel belongs to this layer. Some of the algorithms for allocating multi-access channel are as follows:

Aloha protocol Carrier Sense Multiple Access Protocols(CSMA) Collision-free protocols : Limited contention protocol Wireless LAN protocol Digital Cellular radio

 In 1970s ,Norman Abramson and his colleagues at the University

of Hawaii devised a new and elegant method to solve the channel allocation problem and this method is known as ALOHA SYSTEM users are competing for the use of single shared channel.

The basic idea is applicable to any system in which uncoordinated There are two versions of Aloha system which differ with respect to

whether or not time is divided up into discrete slots into which all frames must fit. :

PURE ALOHA (Who's first )

SLOTTED ALOHA (who's next?)

PURE ALOHA The basic idea on which pure aloha is based upon is : It let users
transmit whenever they have data to be sent. So there will be collisions ,of course, and the colliding frames will be damaged. However due to feed back property of broadcasting a sender can always find out whether its frame was destroyed by listening to the channel. All the receivers acknowledge the packets which means that the packet is received and if there is no acknowledgement from the receiver then the transmission is assumed to be unsuccessful and the station then retransmits the packet after random amount of time.

The systems in which multiple users share a common channel in a way that can lead to conflict are widely known as contention systems.

Pure Aloha

If the first bit of a new frame overlaps with just the last bit of a frame almost finished, both the frames will be totally destroyed. It does not distinguish between a total loss or a near miss.

Slotted Aloha
In 1987, Roberts publish a method called slotted aloha which doubled

the capacity of pure aloha.

Divide time up into discrete intervals, each corresponding to one

packet.
The stations can only transmit data in one of the time slots only. The vulnerable period is now reduced in half. If the frames collide they

will overlap completely instead of partially.

Slotted ALOHA Offered Load vs. Throughput

Max

at G = 1, S = 1/e, only about 0.368 (37%)

Slotted ALOHA
Assumptions All frames same size Time divided into equal slots (time to transmit a frame) Nodes are synchronized Nodes begin to transmit frames only at start of slots If two or more nodes transmit, all nodes detect collision Operation When node gets fresh data, transmits in next slot No collision: success! Collision: node retransmits frame in each subsequent slot with probability p until success

16

Slotted

Pros and Cons of Slotted Aloha

Pros Single active node can continuously transmit at full rate of channel Highly decentralized: only need slot synchronization
Simple

Cons Wasted slots:

Idle Collisions

Nodes should detect

collision in less than time to transmit packet Clock synchronization

18

Summary
Aloha Protocol:
Whenever a station has data, it transmits immediately Receivers ACK all packets No ACK = collision. Wait a random time and retransmit

 The Slotted Aloha Protocol

Slotted Aloha - Aloha with an additional constraint Time is divided into discrete time intervals (=slot) A station can transmit only at the beginning of a frame

CSMA
CSMA: Carrier sense multiple access Based on the principle sense before transmit or listen before talk Can reduce the possibility of collision Cannot eliminate it

Q: Why may there be a collision if each station listens to the medium before transmitting a frame? A: Possibility of collision still exists because of propagation delay. When a station sends a frame, it takes time for the first bit to reach every station and for every station to sense it.

Persistence Strategies
Define what a station should do if, when sensing the medium, it finds the medium busy

Figure 1-2

Definition

Figure 8-12

p-Persistent Approach

<

Attempts to minimize the idle time, while at the same time minimize the chance of simultaneous transmissions

Token Passing
Common Features
A token rotates around a ring to each node in turn. We will

define: PROP = minimum rotation time around ring. All nodes (computers, routers, etc.) copy all data and tokens, and repeat them along the ring. When a node wishes to transmit packet(s), it grabs the token as it passes. It holds the token while it transmits. When it is done, it releases the token again and sends it on its way.
CS244a Handout 10 25

Winter 2008

Figure 8-15

Token Passing Network

(Use controlled Access method)

Summary

Channel allocation methods and systems for a common

ALOHA Network application

28

Ethernet Physical Layer standards

10Base5 10 Mbps, Baseband transmission, 500m cable length 10Base2 10 Mbps, Baseband transmission, ~200m cable length 10Base-T 10 Mbps, Baseband transmission, UTP cable 100Base-TX 100 Mbps, Baseband transmission, UTP cable

Fast Ethernet

MAP application

Comparison of MAC protocols in wired systems and wireless systems

Wireless Sensor Networks

IEEE standard 802.15.4

Name of a specification for a suite of high level communication protocols using small, low-power digital radios
MAC layer: CSMA/CA

32

Comparison of MAC protocols in wired systems and wireless systems

Conclusion
Simplest allocation schemes: FDM and TDM Poor choices for large, variable or bursty traffic Alternative: ALOHA (Dynamic Allocation) Carrier Sensing in LANs and MANs led to variety of protocols Binaray Countdown Eliminates contention completely Tree Walk Reduces contention by dividing stations dynamically Ethernet Dominant in Wired LANs Uses CSMA/CD

33

References
1. Andrew S. Tanenbaum, Computer Networks, Fourth Edition

1. William Stallings, Data and Computer Communications, Eighth Edition

1. Holger Karl, Andreas Willig, Protocols and Architectures for Wireless Sensor Networks

1. http://en.wikipedia.org
2. Alaa Muqattash, Marwan Krunz, CDMA-Based MAC Protocol for Wireless Ad Hoc Networks

34