IT6601 Mobile Computing Unit 1 Intro v1 Vishnu PDF
IT6601 Mobile Computing Unit 1 Intro v1 Vishnu PDF
IT6601 Mobile Computing Unit 1 Intro v1 Vishnu PDF
MOBILE COMPUTING
Class -1
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 1
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
OBJECTIVE
• Understand the basic concepts of mobile computing
• Be familiar with the network protocol stack
• Learn the basics of mobile telecommunication system
• Be exposed to Ad-Hoc networks
• Gain knowledge about different mobile platforms and
application development
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 2
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
UNIT1- INTRODUCTION
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 3
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
INTRODUCTION
• Mobile Computing
• Mobile Computing Vs wireless Networking
• Mobile Computing Applications
• Characteristics of Mobile computing
• Structure of Mobile Computing Application.
• MAC Protocols.
• Wireless MAC Issues
• Fixed Assignment Schemes
• Random Assignment Schemes
• Reservation Based Schemes.
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 4
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Basic Concepts
• Mobile Handsets, Wireless Communications, and server
applications
– Cell Phone System
– Types of Telecommunication Networks
– Computer Networks
– Controller Area Networks (CANs)
– Network is used to connect the different components of an
embedded controller. Eg,
• Automobiles industry
– LANs - private owned, building or campus operate at 1 Gbps
• Internetworks – several LANs connected
• LAN Architecture – topologies (ring, mesh..)
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 5
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Basic Concepts
• Components of a wireless communication system
– Transmitter, receiver, filter, antenna, amplifier, mixers
• Wireless Networking Standards (Table1.1)
– ITU, IEEE and ISO
– IEEE 802.11 standards (a,bc,d,e,f…u)
• WLAN Architecture
– Components ( Access point, bridge, and LAN card)
– Applications
• Campus WLANs
• Streamlining inventory management
• Providing LAN
• WLAN connectivity to geographically dispersed computers
• Advantages of wireless LAN over wired LAN
– Mobility
– Simplicity and speedy deployment
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 6
Wireless Networking Standards
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 8
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 9
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Why go Mobile
• Enable anywhere/anytime connectivity
• Bring computer communications to areas
• without pre-existing infrastructure
• Enable mobility
• Enable new applications
• An exciting new research area
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 10
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Mobile Computing
Vs
Wireless Networking
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 11
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 12
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Cntd…
• The question of interoperability between
different wireless LAN products became critical.
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 13
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Cntd…
• WLAN uses the unlicensed Industrial, Scientific,
and Medical (ISM) band that different
products can use as long as they comply with
certain regulatory rules
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 14
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Cntd…
• Examples could be cordless telephone, microwave oven etc.
These are 900-MHz ISM band, which ranges from 902 to 928 MHz;
2.4-GHz ISM band, which ranges from 2.4 to 2.4853 GHz; and the 5.4
GHz band, which range from 5.275 to 5.85 GHz.
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 15
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
MOBILE COMPUTING
• Mobile computing can be defined as a
computing environment over physical
mobility.
• The user of a mobile computing
environment will be able to access data,
information or other logical objects from any
device in any network while on the move.
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 18
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
MOBILE COMPUTING
• Mobile computing system allows a user to perform a
task from anywhere using a computing device in the
public (the Web), corporate (business information) and
personal information spaces (medical record, address
book).
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 19
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Cntd…
– This is similar to the telephone number of a GSM (Global System for
Mobile communication) phone, which moves with the phone.
– The offline (local) and real-time (remote) computing environment will
move with the user.
– In real-time mode user will be able to use all his remote data and services
online.
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 20
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Cntd…
• Nomadic Computing: The
computing environment is nomadic and
moves along with the mobile user.
– This is true for both local and remote
services.
–
• Pervasive Computing: A computing
environment, which is pervasive in
nature and can be made available in
any environment.
• Ubiquitous Computing: A
disappearing (nobody will notice its
presence) everyplace computing
environment. User will be able to
use both local and remote services.
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 21
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 22
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 23
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 24
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Cntd…
• Most of these applications can be classified
into:
– wireless and mobile access to the Internet
– wireless and mobile access to private Intranets
– wireless and adhoc mobile access between
mobile computers.
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 25
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 26
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Cntd…
• Ubiquity
– Present everywhere
• Location awareness
– GPS
• Adaption
– Bandwidth Fluctuations without disturbing the users
• Broadcast
– Efficient delivery of data to hundreds of users
• Personalization
– Interested information from a specific source
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 27
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 28
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 29
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 30
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 31
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Application Structure
Tier2
Tier3
Tier1
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 32
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
MAC Protocols
Wireless MAC Protocols Issues
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 33
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 34
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 35
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 37
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 38
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 39
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
FDMA
• Similar to broadcast radio and TV, assign a different
carrier frequency per call
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 40
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 41
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
FDMA Operation
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 42
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Work to be done
• How to find FDMA Channel ? if
– Total Spectrum is 15 MHz
– Guard Band is 15 KHz
– Channel Bandwidth is 30 KHz
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 43
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Advantages of FDMA
• If channel is not in use, it sits idle
• Channel bandwidth is relatively narrow (30kHz)
• Simple algorithmically, and from a hardware
standpoint
• Fairly efficient when the number of stations is small
and the traffic is uniformly constant
• Capacity increase can be obtained by reducing the
information bit rate and using efficient digital code
• No need for network timing
• No restriction regarding the type of baseband or type of
modulation
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 44
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Cntd…
• TDMA
Large room divided up into small rooms. Three
pairs of people per room, however, each pair gets
20 seconds to speak.
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 46
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
TDMA
• Each user transmits data on a time slot on
multiple frequencies
• A time slot is a channel
• A user sends data at an accelerated rate (by
using many frequencies) when its time slot
begins
• Data is stored at receiver and played back at
original slow rate
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 47
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 48
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
TDMA Operation
• Efficiency of TDMA frame
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 49
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Efficiency of TDMA
Frame Efficiency
No.ofbits / frame containingtransmitted data
ηf =
Total Numberof bits / frame
= (1 − bOH / bT ) × 100
(bT − bOH )
= × 100
bT
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 50
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 51
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 52
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Bt − 2 Bg
N =m 2/n
6 S
Bc n / 2
3 I min
where n is the path loss exponent
S
I is the minimum required Signal to Interference ratio
min
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 53
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Cntd…
• Example
The GSM System uses a TDMA frame structure
where each frame consist of 8 time slots, and
each time slot contains 156.25 bits, and data is
transmitted at 270.833 kbps in the channel.
• Time duration of a bit
• Time duration of a slot
• Time duration of a frame
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 54
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Solution
• Time duration of a bit
1 1
= Tb = = = 3.692 µ s
bit-rate 270.833 × 10 3
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 55
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Advantages of TDMA
• Flexible bit rate
• No frequency guard band required
• No need for precise narrowband filters
• Easy for mobile or base stations to initiate and execute
hands off
• Extended battery life
• TDMA installations offer savings in base station
equipment, space and maintenance
• The most cost-effective technology for upgrading a current
analog system to digital
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 56
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 57
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Cntd…
• CDMA – No small rooms. Everyone is speaking in
different languages. If voice volume is minimized, the
number of people is maximized.
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 58
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Frequency Vs Time
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 59
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
CDMA
• Rx: 869-894MHz Tx: 824-849MHz
• 20 Channels spaced 1250kHz apart
• (798 users/channel)
• QPSK/(Offset) OQPSK modulation scheme
• 1.2288Mbps bit rate
• IS-95 standard
• Operates at both 800 and 1900 MHz frequency
bands
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 60
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
CDMA Operation
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 61
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Advantages of CDMA
• Many users of CDMA use the same frequency,
• TDD or FDD may be used
• Multipath fading may be substantially reduced
because of large signal bandwidth
• No absolute limit on the number of users
• Easy addition of more users
• Impossible for hackers to decipher the code sent
Better signal quality
• No sense of handoff when changing cells
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 62
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 63
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 64
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 65
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 66
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Cntd…
Note that all packets have the same length because the throughput of
ALOHA systems is maximized by having a uniform packet size.
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 68
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Throughput
• Throughput:
– The number of packets successfully transmitted
through the channel per packet time.
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 69
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Assumptions
• Infinite population of users
• New frames are generated according to a
Poisson distribution with mean S packets per
packet time.
– Probability that k packets are generated during a
given packet time:
S k e−S
Pr[ k ] =
k!
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 70
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Observation on S
• If S > 1, packets are generated at a higher rate
than the channel can handle.
• Therefore, we expect
0<S<1
• If the channel can handle all the packets, then
S is the throughput.
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 71
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Packet Retransmission
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 73
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Vulnerable Period
• Under what conditions will the shaded packet
arrive undamaged?
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 74
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Throughput
• Vulnerable period: from t0 to t0+2t
• Probability of no other packet generated during
the vulnerable period is:
−2 G
P0 = e
−2 G
S = Ge
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 75
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 76
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Slotted ALOHA
• Divide time up into discrete intervals, each
corresponding to one packet.
• The vulnerable period is now reduced in half.
• Probability of no other packet generated during the
vulnerable period is: P = e − G
0
• Hence,
−G
S = Ge
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 77
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Carrier Sense
• In many situations, stations can tell if the
channel is in use before trying to use it.
• If the channel is sensed as busy, no station will
attempt to use it until it goes idle.
• This is the basic idea of the Carrier Sense
Multiple Access (CSMA) protocol.
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 78
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
CSMA Protocols
• There are different variations of the CSMA protocols:
– 1-persistent CSMA
• If medium idle, transmit; if medium busy, wait until idle; then
transmit with p=1.
• If collision, waits random period and starts again.
– Non-persistent CSMA
• if medium idle, transmit; otherwise wait a random time before re-
trying.
• Thus, station does not continuously sense channel when it is in use.
– p-persistent CSMA
• when channel idle detected, transmits packet in the first slot with p.
• Slotted channel, i.e., with probability q = p-1, defers to next
slot
• We discuss only 1-persistent CSMA.
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 79
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
1-persistent CSMA
• The protocol:
– Listens before transmits
– If channel busy, waits until channel idle
– If channel idle, transmits
– If collision occurs, waits a random amount of time and
starts all over again
• It is called 1-persistent because the station transmits
with a probability of 1 whenever it finds the channel
idle.
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 80
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
CSMA Protocol
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 81
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
CSMA vs Aloha
CSMA/CD
• CSMA with collision detection.
• Problem: when frames collide, medium is
unusable for duration of both (damaged)
frames.
• For long frames (when compared to
propagation time), considerable waste.
• What if station listens while transmitting?
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 83
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
CSMA/CD Protocol
1. If medium idle, transmit; otherwise 2.
2. If medium busy, wait until idle, then transmit
with p=1.
3. If collision detected, transmit brief jamming
signal and abort transmission.
4. After aborting, wait random time, try again.
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 84
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
CSMA/CD Performance
• Wasted capacity restricted to time to detect
collision.
• Time to detect collision < 2*maximum
propagation delay.
• Rule in CSMA/CD protocols: frames long
enough to allow collision detection prior to
end of transmission.
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 85
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 86
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 87
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 88
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Cntd…
• Any station that hears the RTS message, defers all communication
for some time until the associated CTS message has been finished.
• A CTS message defers communication for the duration of the time
indicated in the CTS message.
• When A is transmitting data, C can go ahead and access the
channel.
• What all could go wrong here ?
RTS
A B
CTS D
C
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 89
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 91
IT6601-MOBILE COMPUTING Vishnu Kumar Kaliappan
Thank You
Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.
Ltd, New Delhi – 2012. 92