Module 2
Module 2
Physical layer design issues - Media, Signal strength and interference. Data
encoding, Multiplexing (TDM, FDM). Data Link layer Design Issues – Flow
Control and ARQ techniques. Data link Protocols – HDLC. IEEE 802 FOR LANs
IEEE 802.3, 802.5. Wireless LANs - 802.11.
GUIDED MEDIA
Guided media, which are those that provide a medium from one device to
another, include twisted-pair cable, coaxial cable, and fiber-optic cable.
Any transmission system has limited band of frequencies. This limits the data
rate which can be carried through the transmission media
Bandwidth: It is the difference of the highest and the lowest frequency in the
channel. Higher bandwidth gives higher data rate.
Transmission impairments or data loss can occur during transmission eg
: Attenuation
Interference of the signals can also occur.
Types of guided media include twisted-pair cable, coaxial cable, and fiber-optic cable
1. TWISTED PAIR CABLE
One of the oldest and still most common transmission media is twisted pair. A
twisted pair consists of two insulated copper wires, typically about 1 mm thick. The
wires are twisted together in a helical form, just like a DNA molecule.
One of the wire carries signal and other is used as ground reference
Twisting is done because two parallel wires constitute a fine antenna. When the wires
are twisted, the waves from different twists cancel out, so the wire radiates less
effectively.
The most common application of the twisted pair is the telephone system. Nearly all
telephones are connected to the telephone company (telco) office by a twisted pair.
Both telephone calls and ADSL Internet access run over these lines.
Twisted pairs can run several kilometers without amplification, but for longer
distances the signal becomes too attenuated and repeaters are needed. When many
twisted pairs run in parallel for a substantial distance, such as all the wires coming
from an apartment building to the telephone company office, they are bundled
together and encased in a protective sheath.
Twisted pairs can be used for transmitting either analog or digital information. The
bandwidth depends on the thickness of the wire and the distance travelled Due to their
adequate performance and low cost, twisted pairs are widely used.
Classified into two
a. Unshielded Twisted pair (UTP)
b. Shielded Twisted
pair Unshielded Twisted Pair
Used as ordinary telephone wire
It is cheapest
Easy to install
Suffers from external Electromagnetic Interferences
Another common transmission medium is the coaxial cable (also known as just
‘‘coax’’). It has better shielding and greater bandwidth than unshielded twisted pairs,
so it can span longer distances at higher speeds
coax has a central core conductor of solid or stranded wire (usually copper) enclosed
in an insulating sheath, which is, in turn, encased in an outer conductor of metal foil.
The outer metallic wrapping serves both as a shield against noise and as the second
conductor, which completes the circuit.
Coaxial cable is categorized by the radio government (RG) ratings. Each RG number
denotes a unique set of physical specification, including the wire gauge of the inner
conductor, thickness and type of the inner insulator,
Performance
Attenuation is much higher in coaxial cables than in twisted-pair cable. In other
words, although coaxial cable has a much higher bandwidth, the signal weakens
rapidly and requires the frequent use of repeaters.
Application
Coaxial cable was widely used in analog telephone networks where a single coaxial
network could carry 10,000 voice signals. Later it was used in digital telephone
networks where a single coaxial cable could carry digital data up to 600 Mbps.
Cable TV networks also use coaxial cables. In the traditional cable TV network, the
entire network used coaxial cable. Cable TV uses RG-59 coaxial cable
Another common application of coaxial cable is in traditional Ethemet LANs Because
of its high bandwidth, and consequently high data rate, coaxial cable was chosen for
digital transmission in early Ethemet LANs. The 10Base-2, or Thin Ethernet, uses
RG- 58 coaxial cable with BNC connectors to transmit data at 10 Mbps
The 10Base5, or Thick Ethernet, uses RG-11 (thick coaxial cable)
to transmit 10 Mbps with a range of 5000 m. Thick Ethernet has specialized connectors.
3. FIBRE OPTICS
A fiber-optic cable is made of glass or plastic and transmits signals in the form of
light. Light travels in a straight line as long as it is moving through a single uniform
substance. If a ray of light traveling through one substance suddenly enters another
substance (of a different density), the ray changes direction.
Working
When a ray of light travels from a denser to a rarer medium such that the angle of
incidence is greater than the critical angle, the ray reflects back into the same medium
this phenomena is called TIR.
In the optical fiber the rays undergo repeated total number of reflections until it
emerges out of the other end of the fiber, even if fiber is bend
Structure
Core - central tube of very thin size made up of optically transparent material and
carries the light form transmitter to receiver
Cladding- outer optical material surrounding the core having less density than core. It
helps to keep the light within the core
Coating- plastic coating that protects the fiber made of silicon rubber
Propagation Modes
• Optical Fibre is classified into two categories based on
1. Number of modes
– Single mode
– Multi mode
2. Densities
– Step Index optical Fibre
– Graded Index optical
Demultiplexing Process:
The demultiplexer uses a series of filters to decompose the multiplexed signal into its constituent
component signals. The individual signals are then passed to a demodulator that separates them
from their carriers and passes them to the output lines. Following Figure is a conceptual
illustration of demultiplexing process.
Applications of FDM: A very common application of FDM is AM and FM radio broadcasting.
Time-Division Multiplexing
Time-division multiplexing (TDM) is a digital process that allows several connections to share
the high bandwidth of a link.
Instead of sharing a portion of the bandwidth as in FDM, time is shared.
Each connection occupies a portion of time in the link. In the figure, portions of signals 1, 2, 3,
and 4 occupy the link sequentially.
TDM into two different schemes: synchronous and statistical.
1. Synchronous TDM: Time slots are preassigned and are fixed. Each source is given it's time slot at
every turn due to it. This turn may be once per cycle, or several turns per cycle ,if it has a high data
transfer rate, or may be once in a no. of cycles if it is slow. This slot is given even if the source is not
ready with data. So this slot is transmitted empty.
2. Asynchronous TDM: In this method, slots are not fixed. They are allotted dynamically
depending on speed of sources, and whether they are ready for transmission.
DATA LINK LAYER DESIGN ISSUES
The data link layer uses the services of the physical layer to send and receive bits over
communication channels.
It has a number of functions, including:
1. Providing a well-defined service interface to the network layer.
2. Dealing with transmission errors.
3. Regulating the flow of data so that slow receivers are not swamped by fast senders.
To accomplish these goals, the data link layer takes the packets it gets from the network layer
and encapsulates them into frames for transmission.
Each frame contains:
a frame header,
a payload field for holding the packet,
a frame trailer
Frame management forms the heart of what the data link layer does.
Function2 : Framing:
The data link layer have to detect and, if necessary, correct errors in the bit stream received from
the physical layer.
The data link layer to break up the bit stream into discrete frames, compute a short token called a
checksum for each frame, and include the checksum in the frame when it is transmitted. When
a frame arrives at the destination, the checksum is recomputed. If the newly computed
checksum is different from the one contained in the frame, the data link layer knows that an
error has occurred and takes steps to deal with it.
Four methods of breaking up the bit stream into frames:
1. Byte count.
2. Flag bytes with byte stuffing.
3. Flag bits with bit stuffing.
4. Physical layer coding violations.
1. Byte count :
A field in the header is used to specify the number of bytes in the frame. When the data link
layer at the destination sees the byte count, it knows how many bytes follow and hence where
the end of the frame is. Example frames of sizes 5, 5, 8, and 8 bytes, respectively.
Drawback: The count can be garbled by a transmission error. For example, if the byte count of 5
in the second frame of Fig. 3-3(b) becomes a 7 due to a single bit flip, the destination will get out
of synchronization. It will then be unable to locate the correct start of the next frame. Even if
the checksum is incorrect so the destination knows that the frame is bad, it still has no way of
telling where the next frame starts. Sending a frame back to the source asking for a
retransmission does not help either, since the destination does not know how many bytes to
skip over to get to the start of the retransmission.
The boundary between two frames can be unambiguously recognized by the flag pattern. Thus,
if the receiver loses track of where it is, all it has to do is scan the input for flag sequences,
since they can only occur at frame boundaries and never within the data.
The hardware troubles may cause a frame to vanish completely. Then introducing timers into
the data link layer. When the sender transmits a frame, it generally also starts a timer. The
timer is set to expire after an interval long enough for the frame to reach the destination, be
processed there, and have the acknowledgement propagate back to the sender. Normally, the
frame will be correctly received and the acknowledgement will get back before the timer runs
out, in which case the timer will be canceled.
Either the frame or the acknowledgement is lost, the timer will go off, alerting the sender. The
solution is to just transmit the frame again. However, when frames may be transmitted multiple
times there is a danger that the receiver will accept the same frame two or more times and
pass it to the network layer more than once. To prevent this from happening, it is generally
necessary to assign sequence numbers to outgoing frames, so that the receiver can distinguish
retransmissions from originals.
Flow control is a set of procedures which tells the sender how much data can be transmitted before
it must wait for an acknowledgment from the receiver.
Flow of data must not overload the receiver
Receiver must also be able to inform the sender before it reaches the limit. Flow
control techniques are of two types :
1. stop and wait / request-reply FC
2. sliding window FC
1. Stop-and-Wait Flow Control:
This method is the easiest and simplest form of flow control. A message or data is broken down
into various multiple frames, and then receiver indicates its readiness to receive frame of
data. When acknowledgment is received, then only sender will send or transfer the next frame.
This process is continued until sender transmits EOT (End of Transmission) frame. In this
method, only one of frames can be in transmission at a time. It leads to inefficiency i.e. less
productivity if propagation delay is very much longer than the transmission delay.
Sender sends one data packet and then waits for its acknowledgement.
Sender sends the next packet only after it receives the acknowledgement for the previous packet.
Advantages –
This method is very easiest and simple and each of the frames is checked and acknowledged
well.
It can also be used for noisy channels.
This method is also very accurate.
Disadvantages –
This method is fairly slow.
In this, only one packet or frame can be sent at a time.
It is very inefficient and makes the transmission process very slow.
For any sliding window protocol to work without any problem, the following condition must
be satisfied-
Available Sequence Numbers <= Sender Window Size + Receiver Window Size
Advantages –
It performs much better than stop-and-wait flow control.
This method increases efficiency.
Multiples frames can be sent one after another.
Disadvantages –
The main issue is complexity at the sender and receiver due to the transferring of multiple
frames.
The receiver might receive data frames or packets out the sequence.
Maximum number of frames that sender can send without acknowledgement = Sender window
size
In SR protocol,
Receiver window is implemented as a linked list.
When receiver receives a new frame, it places the new frame at the end of the linked list.
When the received frames are out of order, receiver performs the sorting.
Sorting sorts the frames in the correct order.
Only the missing frame has to be sent by the sender.
For sending the missing frame, sender performs searching and finds the missing frame.
Then, sender selectively repeats that frame.
Thus, only the selected frame is repeated and not the entire window.
SR protocol leads to retransmission of lost frames after expiry of time out timer.
Piggy Backing
To improve the efficiency of bidirectional protocols. Full duplex transmission can be achieved using
two separate communicating channels that is wastage of bandwidth.
When a data frame arrives a receiver, it will not send the acknowledgment immediately instead it
waits until its network layer passes data to data link layer. The acknowledgement is attached to
data frame. The technique in which out going acknowledgement is delayed is called as
piggybacking.
Each frame acts as an envelope for the transmission of different type of message. Each frame may
carry up to six fields
frame structure.
01111110 – flag field – 8 bit sequence that identifies beginning an end of frames. This helps as
synchronization pattern for the receiver. The frame is delimited with another flag sequence
(01111110).
The Address field is used to identify one of the terminals. This can be 1 byte or more. 1 byte can
identify 128 stations.
The Control field is 1 or 2 bytes used for flow control or error control. This bits depends on the
frame type.
The Data field may contain any information. It may be arbitrarily long. The
Checksum field – error detection field
The minimum frame contains three fields and totals 32 bits, excluding the flags on either end. The
I frame is used to carry data from network layer. Iframe include flow control and error control
information.
1st bit is 0 – denotes that frame is of type I
Next 3 bits -The Seq field is the frame sequence number. (0 -7)
The P/F bit stands for Poll/Final.
P/F = 1 poll : frame sent by primary to secondary.
P/F = 0 final : frame sent by secondary to primary.
The Next field is a piggybacked acknowledgement number. Instead of piggybacking
the number of the last frame received correctly, they use the number of the first frame
not yet received (i.e., the next frame expected). The choice of using the last frame
received or the next frame expected is arbitrary.
Control field of S frame :
Supervisory frame are used for flow and error control when piggybacking is inappropriate. Eg:
when station has no data to send of its own or have to send some thing othe than
acknowledgement.
S frame do not have information field.
First two bits 1 0 means its S frame.
3 and 4 bit – Type of S frame :
The various kinds of Supervisory frames are distinguished by the Type field.
Type 00 / Receive Ready is an acknowledgement frame used to indicate the next
frame expected.
Type 01/ Reject S frame is a negative acknowledgement frame. It is used to
indicate that a transmission error has been detected. The Next field indicates the
first frame in sequence not received correctly (i.e., the frame to be retransmitted).
The sender is required to retransmit all outstanding frames starting at Next.
Type 10/ Receive not ready - mentions receiver is busy and cannot receive any
frame.
Type 11 / Selective reject. It calls for retransmission of only the frame specified.
The P/F bit stands for Poll/Final.
P/F = 1 poll : frame sent by primary to secondary.
P/F = 0 final : frame sent by secondary to primary.
The Next field is a piggybacked acknowledgement number
2 bits befor P/F and 3 bits after together they contribute upto 32 different types of u frames. HDLC
Functions of MAC:
1. Perform control of access to media
2. Perform unique addressing to station directly connected to LANS
3. Error detection
Pure ALOHA
The basic idea of an ALOHA system is simple: users transmit whenever they have data to be sent.
The colliding frames will be damaged. Senders need some way to find out the collision.
After each station has sent its frame to the central computer, this computer rebroadcasts the
frame to all of the stations. A sending station thus listen for the broadcast from the hub to see if
its frame has gotten through.
In other systems, such as wired LANs, the sender might be able to listen for collisions while
transmitting. If the frame was destroyed, the sender just waits a random amount of time and
sends it again. The waiting time must be random or the same frames will collide over and over,
in lockstep. Systems in which multiple users share a common channel in a way that can lead to
conflicts are known as contention systems.
All the frames are with the same length because the throughput of ALOHA systems is
maximized by having a uniform frame size rather than by allowing variable-length frames.
Whenever two frames try to occupy the channel at the same time, there will be a collision (as
seen in Fig. 4-1) and both will be garbled. If the first bit of a new frame overlaps with just the
last bit of a frame that has almost finished, both frames will be totally destroyed (i.e., have
incorrect checksums) and both will have to be retransmitted later. The checksum does not (and
should not) distinguish between a total loss and a near miss.
If N > 1, the user community is generating frames at a higher rate than the channel can handle,
and nearly every frame will suffer a collision. For reasonable throughput, we would expect
0 <N< 1.
A frame will not suffer a collision if no other frames are sent within one frame time of its start,
as shown in Fig. 4-2.
Let t be the time required to send one frame. If any other user has generated a frame between
time t 0 and t 0 + t, the end of that frame will collide with the beginning of the shaded one. In
fact, the shaded frame‘s fate was already sealed even before the first bit was sent, but since in
pure ALOHA a station does not listen to the channel before transmitting, it has no way of
knowing that another frame was already underway. Similarly, any other frame started between
t 0 + t and t 0 + 2t will bump into the end of the shaded frame.
The probability that k frames are generated during a given frame time, in which G frames are
expected, is given by the Poisson distribution.
Slotted ALOHA
A method for doubling the capacity of an ALOHA system. His proposal was to divide time
into discrete intervals called slots, each interval corresponding to one frame. This approach
requires the users to agree on slot boundaries. One way to achieve synchronization would be to
have one special station emit a pip at the start of each interval, like a clock the continuous time
ALOHA is turned into a discrete time one. This halves the vulnerable period. To see this, look
at Fig. 4-3 and imagine the collisions that are now possible. The probability of no other traffic
during the same slot as our test frame is then e −G, which leads to
S = Ge −G
The slotted ALOHA peaks at G = 1, with a throughput of S = 1/e or about 0.368, twice that of
pure ALOHA. The probability of a collision is then just 1 − e −G. The probability of a
transmission requiring exactly k attempts (i.e., k − 1 collisions followed by one success) is
With slotted ALOHA, the best channel utilization that can be achieved is 1/e
nonpersistent CSMA- As before, a station senses the channel when it wants to send a frame,
and if no one else is sending, the station begins doing so itself. However, if the channel is
already in use, the station does not continually sense it for the purpose of seizing it
immediately upon detecting the end of the previous transmission. Instead, it waits a random
period of time and then repeats the algorithm. Consequently, this algorithm leads to better
channel utilization but longer delays than 1-persistent CSMA.
p-persistent CSMA. It applies to slotted channels.. When a station becomes ready to send, it
senses the channel. If it is idle, it transmits with a probability p. With a probability q = 1 − p, it
defers until the next slot. If that slot is also idle, it either transmits or defers again, with
probabilities p and q. This process is repeated until either the frame has been transmitted or
another station has begun transmitting. In the latter case, the unlucky station acts as if there had
been a collision (i.e., it waits a random time and starts again). If the station initially senses that
the channel is busy, it waits until the next slot and applies the above algorithm. IEEE 802.11
uses a refinement of p-persistent CSMA
At the point marked t 0, a station has finished transmitting its frame. Any other station having
a frame to send may now attempt to do so. If two or more stations decide to transmit
simultaneously, there will be a collision. If a station detects a collision.
Our model for CSMA/CD will consist of alternating contention and transmission periods, with
idle periods occurring when all stations are quiet.
IEEE 802.3
The IEEE has standardized a number of local area networks and metropolitan area networks
under the name of IEEE 802(Ethernet).
Two kinds of Ethernet exist:
Classic Ethernet, which solves the multiple access problem using the techniques. ran
at rates from 3 to 10 Mbps
Switched Ethernet, in which devices called switches are used to connect different
computers. runs at 100, 1000, and 10,000 Mbps, in forms called fast Ethernet, gigabit
Ethernet, and 10 gigabit Ethernet.
ETHERNET cabling:
The first number is the speed in Mbps. Then comes the word ''Base'' (or sometimes ''BASE'') to
indicate baseband transmission.
10Base5 cabling, popularly called thick Ethernet –
It has markings every 2.5 meters to show where the taps go. Connections to it are
generally made using vampire taps. It operates at 10 Mbps, uses baseband signaling,
and can support segments of up to 500 meters.
10Base2, or thin Ethernet - covers 200m
Connections to it are made using industrystandard BNC connectors to form T
junctions, rather than using vampire taps. BNC connectors are easier to use and more
reliable. Thin Ethernet is much cheaper and easier to install, but it can run for only 185
meters persegment. It can handle up to 30 machines.
10BaseT – Twisted pair cable – covers 100m and can connect up to 1024 machines.
10BaseF – Fiber Optics – covers 2000m
10base5 and 10base2 uses bus topology, 10baseT and 10baseF uses star topology.
Each frame starts with a Preamble of 8 bytes (preamble 7 bytes + SFD 1 byte),
each containing the bit pattern 10101010.
The frame contains two addresses, one for the destination and one for the source.
The standard allows 2-byte and 6-byte addresses. When a frame is sent to a group
address, all the stations in the group receive it. Sending to a group of stations is
called multicast. The address consisting of all 1 bits is reserved for broadcast. A
frame containing all 1s in the destination field is accepted by all stations on the
network.
The difference between multicast and broadcast is: A multicast frame is sent to a
selected group of stations on the Ethernet; a broadcast frame is sent to all stations
on the Ethernet. Multicast is more selective, but involves group management.
Broadcasting is coarser but does not require any group management.
o the destination address – physical address of destination station.
o Source address – physical address of the node which send the packets.
The Type field, which tells the receiver what to do with the frame.
Next come the data, up to 1500 bytes.
If the data portion of a frame is less than 46 bytes, the Pad
field is used to fill out
the frame to the minimum size.
The final Ethernet field is the Checksum. It is effectively a 32-bit hash code of the
data for error detection. There is a restriction imposed on minimum(512 bits) and
maximum(12144 bits) length of frame. The restriction of minimum length is to
ensure correct option of CSMA/CD.
Addressing
Each station on an Ethernet network (such as a PC, workstation, or printer) has its own
network interface card (NIC). The NIC fits inside the station and provides the station with a 6-
byte physical address.
The Ethernet address is 6 bytes (48 bits), normally written in hexadecimal notation, with a
colon between the bytes.
06:01 :02:01:2C:4B
6 bytes =12 hex digits =48 bits
Type of address – last significant bit of first byte decides the type of addressing. If its 0 –
unicast else multicast. Broadcasting is a special type of multicasting in which all bits are 1‘s.
1) Unicast – source address is always unicast addressing
2) Multicast -
3) Broadcast
A unicast destination address defines only one recipient; the relationship between the sender
and the receiver is one-to-one. A multicast destination address defines a group of addresses;
the relationship between the sender and the receivers is one-to-many. The broadcast address is
a special case of the multicast address; the recipients are all the stations on the LAN. A
broadcast destination address is forty-eight.
Frame format:
Start frame delimiter (SFD) – Alerts each station for the arrival of token(or data
frame) or start of the frame. It is used to synchronize clocks.
Frame control (FC) – First 2 bits indicates whether the frame contains data or control
information. In control frames, this byte specifies the type of control information.
Destination address (DA) and Source address (SA) – consist of two 6-byte fields
which is used to indicate MAC address of source and destination.
Data – Data length can vary from 0 to maximum token holding time (THT) according
to token reservation strategy adopted. Token ring imposes no lower bound on size of
data i.e. an advantage over Ethernet.
Cyclic redundancy check (CRC) – 32 bit CRC which is used to check for errors in the frame, i.e., whether
the frame is corrupted or not. If the frame is corrupted, then its discarded.
End delimiter (ED) – It is used to mark the end of frame. In Ethernet, length field is used for this purpose.
It also contains bits to indicate a damaged frame and identify the frame that is the last in a logical
sequence.
The infrared option uses diffused (i.e., not line of sight) transmission at 0.85 or 0.95 microns.
Two speeds are permitted: 1 Mbps and 2 Mbps. At 1 Mbps, an encoding scheme is used in
which a group of 4 bits is encoded as a 16-bit codeword containing fifteen 0s and a single 1,
using what is called Gray code. Infrared signals cannot penetrate walls, so cells in different
rooms are well isolated from each other. Nevertheless, due to the low bandwidth (and the fact
that sunlight swamps infrared signals), this is not a popular option.
FHSS (Frequency Hopping Spread Spectrum) uses 79 channels, each 1-MHz wide, starting
at the low end of the 2.4-GHz ISM band. A pseudorandom number generator is used to
produce the sequence of frequencies hopped to. As long as all stations use the same seed to the
pseudorandom number generator and stay synchronized in time, they will hop to the same
frequencies simultaneously. The amount of time spent at each frequency, the dwell time, is an
adjustable parameter, but must be less than 400 msec. FHSS' randomization provides a fair
way to allocate spectrum in the unregulated ISM band. It also provides a modicum of security
since an intruder who does not know the hopping sequence or dwell time cannot eavesdrop on
transmissions. Over longer distances, multipath fading can be an issue, and FHSS offers good
resistance to it. It is also relatively insensitive to radio interference, which makes it popular for
building-to-building links. Its main disadvantage is its low bandwidth.
DSSS (Direct Sequence Spread Spectrum), is also restricted to 1 or 2 Mbps. Each bit is
transmitted as 11 chips, using what is called a Barker sequence. It uses phase shift modulation
at 1 Mbaud, transmitting 1 bit per baud when operating at 1 Mbps and 2 bits per baud when
operating at 2 Mbps.
The first of the high-speed wireless LANs, 802.11a, uses OFDM (Orthogonal Frequency
Division Multiplexing) to deliver up to 54 Mbps. Different frequencies are used—52 of them,
48 for data and 4 for synchronization.
HR-DSSS (High Rate Direct Sequence Spread Spectrum), another spread spectrum
technique, which uses 11 million chips/sec to achieve 11 Mbps in the 2.4-GHz band. It is
called 802.11b but is not a follow-up to 802.11a. In fact, its standard was approved first and it
got to market first. Data rates supported by 802.11b are 1, 2, 5.5, and 11 Mbps. The two slow
rates run at 1 Mbaud, with 1 and 2 bits per baud, respectively, using phase shift modulation
(for compatibility with DSSS). The two faster rates run at 1.375 Mbaud, with 4 and 8 bits per
baud, respectively, using Walsh/Hadamard codes. The data rate may be dynamically adapted
during operation to achieve the optimum speed possible under current conditions of load and
noise. In practice, the operating speed of 802.11b is nearly always 11 Mbps. Although 802.11b
is slower than 802.11a, its range is about 7 times greater.
An enhanced version of 802.11b, 802.11g, was approved by IEEE. It uses the OFDM
modulation method of 802.11a but operates in the narrow 2.4-GHz ISM band along with
802.11b. It can operate at up to 54 MBps. The 802.11 committee has produced three different
high speed wireless LANs: 802.11a, 802.11b, and 802.11g.
The exposed station problem, illustrated in Fig. 4- 26(b). Here B wants to send to C so it
listens to the channel. When it hears a transmission, it falsely concludes that it may not send to
C, even though A may be transmitting to D (not shown). In addition, most radios are half
duplex, meaning that they cannot transmit and listen for noise bursts at the same time on a
single frequency. As a result of these problems, 802.11 does not use CSMA/CD.
To deal with this problem, 802.11 supports two modes of operation. The first, called DCF
(Distributed Coordination Function), does not use any kind of central control (in that
respect, similar to Ethernet). The other, called PCF (Point Coordination Function), uses the
base station to control all activity in its cell. All implementations must support DCF but PCF is
optional.
When DCF is employed, 802.11 uses a protocol called CSMA/CA (CSMA with Collision
Avoidance). In this protocol, both physical channel sensing and virtual channel sensing are
used. Two methods of operation are supported by CSMA/CA.
In the first method, when a station wants to transmit, it senses the channel. If it is idle,
it just starts transmitting. It does not sense the channel while transmitting but emits its
entire frame, which may well be destroyed at the receiver due to interference there. If
the channel is busy, the sender defers until it goes idle and then starts transmitting. If a
collision occurs, the colliding stations wait a random time, using the Ethernet binary
exponential backoff algorithm, and then try again later.
The other mode of CSMA/CA operation is based on MACAW and uses virtual channel
sensing, as illustrated in Fig. 4-27. In this example, A wants to send to B. C is a station
within range of A (and possibly within range of B, but that does not matter). D is a
station within range of B but not within range of A. Figure 4-27. The use of virtual
channel sensing using CSMA/CA. The protocol starts when A decides it wants to send
data to B. It begins by sending an RTS frame to B to request permission to send it a
frame. When B receives this request, it may decide to grant permission, in which case it
sends a CTS frame back. Upon receipt of the CTS, A now sends its frame and starts an
ACK timer. Upon correct receipt of the data frame, B responds with an ACK frame,
terminating the exchange. If A's ACK timer expires before the ACK gets back to it, the
whole protocol is run again.
Now let us consider this exchange from the viewpoints of C and D. C is within range of
A, so it may receive the RTS frame. If it does, it realizes that someone is going to send
data soon, so for the good of all it desists from transmitting anything until the exchange
is completed. From the information provided in the RTS request, it can estimate how
long the sequence will take, including the final ACK, so it asserts a kind of virtual
channel busy for itself, indicated by NAV (Network Allocation Vector) in Fig. 4-27. D
does not hear the RTS, but it does hear the CTS, so it also asserts the NAV signal for
itself. Note that the NAV signals are not transmitted; they are just internal reminders to
keep quiet for a certain period of time.
To deal with the problem of noisy channels, 802.11 allows frames to be fragmented into
smaller pieces, each with its own checksum. The fragments are individually numbered
and acknowledged using a stop-and-wait protocol (i.e., the sender may not transmit
fragment k + 1 until it has received the acknowledgment for fragment k). Once the
channel has been acquired using RTS and CTS, multiple fragments can be sent in a
row, as shown in Fig. 4-28. sequence of fragments is called a fragment burst.
Fragmentation increases the throughput by restricting retransmissions to the bad fragments rather
than the entire frame. The fragment size is not fixed by the standard but is a parameter of each
cell and can be adjusted by the base station. The NAV mechanism keeps other stations quiet
only until the next acknowledgement, but another mechanism (described below) is used to
allow a whole fragment burst to be sent without [Link] of the above discussion applies
to the 802.11 DCF mode. In this mode, there is no central control, and stations compete for air
time, just as they do with Ethernet.
The other allowed mode is PCF, in which the base station polls the other stations, asking them if
they have any frames to send. Since transmission order is completely controlled by the base
station in PCF mode, no collisions ever occur. The standard prescribes the mechanism for
polling, but not the polling frequency, polling order, or even whether all stations need to get
equal service.
The basic mechanism is for the base station to broadcast a beacon frame periodically (10 to 100
times per second). The beacon frame contains system parameters, such as hopping sequences
and dwell times (for FHSS), clock synchronization, etc. It also invites new stations to sign up
for polling service. Once a station has signed up for polling service at a certain rate, it is
effectively guaranteed a certain fraction of the bandwidth, thus making it possible to give
quality-of-service guarantees.
PCF and DCF can coexist within one cell. At first it might seem impossible to have central control
and distributed control operating at the same time, but 802.11 provides a way to achieve this
goal. It works by carefully defining the interframe time interval. After a frame has been sent, a
certain amount of dead time is required before any station may send a frame. Four different
intervals are defined, each for a specific purpose. The four intervals are depicted in Fig. 4-29.
Figure 4-29. Interframe spacing in 802.11
The shortest interval is SIFS (Short InterFrame Spacing). It is used to allow the parties in a
single dialog the chance to go first. This includes letting the receiver send a CTS to respond to
an RTS, letting the receiver send an ACK for a fragment or full data frame, and letting the
sender of a fragment burst transmit the next fragment without having to send an RTS again.
There is always exactly one station that is entitled to respond after a SIFS interval. If it fails to
make use of its chance and a time PIFS (PCF InterFrame Spacing) elapses, the base station
may send a beacon frame or poll frame. This mechanism allows a station sending a data frame
or fragment sequence to finish its frame without anyone else getting in the way, but gives the
base station a chance to grab the channel when the previous sender is done without having to
compete with eager users.
If the base station has nothing to say and a time DIFS (DCF InterFrame Spacing) elapses,
any station may attempt to acquire the channel to send a new frame. The usual contention rules
apply, and binary exponential backoff may be needed if a collision occurs.
The last time interval, EIFS (Extended InterFrame Spacing), is used only by a station that
has just received a bad or unknown frame to report the bad frame. The idea of giving this event
the lowest priority is that since the receiver may have no idea of what is going on, it should
wait a substantial time to avoid interfering with an ongoing dialog between two stations.
services
The 802.11 standard states that each conformant wireless LAN must provide nine services. These
services are divided into two categories: five distribution services and four station services. The
distribution services relate to managing cell membership and interacting with stations outside
the cell. In contrast, the station services relate to activity within a single cell.
The five distribution services are provided by the base stations and deal with station mobility as
they enter and leave cells, attaching themselves to and detaching themselves from base
stations. They are as follows.
1. Association. This service is used by mobile stations to connect themselves to base
stations.
2. Disassociation. Either the station or the base station may disassociate, thus breaking the
relationship.
3. Reassociation. A station may change its preferred base station using this service.
4. Distribution. This service determines how to route frames sent to the base station.
5. Integration. If a frame needs to be sent through a non-802.11 network with a different
addressing scheme or frame format, this service handles the translation from the 802.11
format to the format required by the destination network.
The remaining four services are intracell (i.e., relate to actions within a single cell). They are used
after association has taken place and are as follows.
1. Authentication. Because wireless communication can easily be sent or received by unauthorized
stations, a station must authenticate itself before it is permitted to send data. After a mobile
station has been associated by the base station (i.e., accepted into its cell), the base station sends
a special challenge frame to it to see if the mobile station knows the secret key (password) that
has been assigned to it. It proves its knowledge of the secret key by encrypting the challenge
frame and sending it back to the base station. If the result is correct, the mobile is
**********************************************************************************************
Important Questions