Mobile Computing

Ubiquitous Computing
Mobile Computing ?
Mobile Computing is widely described as the
ability to compute remotely on the move.
Possibility to access the information any time
any where in the world.
Wireless Networking
Wireless networks are computer networks that are not connected by
cables of any kind. The use of a wireless network enables enterprises
to avoid the costly process of introducing cables into buildings or as a
connection between different equipment locations.
Mobile Computing vs Wireless Networking
● It is backbone of mobile computing.
● It is an extension of physical wired network.
● It provides all the basic infrastructure for communications for
mobile computing.
Types of Wireless Networks
● Wireless Network based on fixed Infrastructure
● Wireless Network having no fixed infrastructure.
Infrastructure Based
Infrastructure Based
❖ It uses the fixed Infrastructure.
❖ Simply the extension of wired network.
❖ Single Hop Communication or Two Hop
Communication.
❖ Wireless Lan (WLAN).
❖ Expertise in setting up is not required.
No Infrastructure
No Infrastructure
❖ It is also called as Ad-hoc Networks.
❖ Data channels through multiple hops.
❖ Stable Infrastructure is not necessary.
❖ PAN ( Personal Area Network - Created by Bluetooth
Devices ) are best examples.
❖ It requires the expertise knowledge and less reliable
than Infrastructure based wireless networks.
Characteristics of Mobile
Computing
Nature of Mobile Computing
Characteristics of Mobile Computing
❖ Ubiquity.
❖ Location awareness.
❖ Adaptation.
❖ Broadcast.
❖ Personalization.
Ubiquity
❖ Present every where.
❖ Ability to perform computation anywhere any time.
❖ Very essential for business people.
Location awareness
❖ GPS System ( Handheld devices are now equipped with
this ).
❖ It is useful provide personalized services.
❖ Services
➢ Maps
➢ Traffic Control.
➢ Emergency Services.
➢ Fleet Management. ( Managing vehicles under one command )
Adaptation
❖ Adaptation in mobile computing context that adjusting
with bandwidth fluctuations without inconveniencing
the customers.
❖ It is very crucial for problems we have in mobile
technologies,
➢ Handoffs.
➢ Obstacles.
➢ Environmental noises.
Broadcast
❖ Effective data transmission for more than one node in
the network.
❖ Advertising services based on the locations of the
users.
Personalization
❖ Mobile should be personalized according to the user profiles.
❖ We can personalize the information source for correct information
source.
❖ Subscribing for specific news channels or news topics and get the valid
information.
Structure of Mobile
Application
App’s Structure
Structure of Mobile Applications
❖ It is structured based on the functionality implementations
❖ Most of them are 3 tier architecture.

Presentation ( Tier - 1 )
Applications ( Tier - 2 )
Data (Tier - 3 )
Elaborated View ( Sales System )
Presentation
Tier Find the sales total Five total sales

Sum of all sales

Find the list of sales in the last year Sales 1

Data
Tier Database Storage
Presentation Tier
❖ Top most level of mobile computing application.
❖ Good user interface that is responsible to produces the results in a
meaningful manner.
❖ Runs on client side.
❖ Compatible with browsers and customized client applications.
❖ Eg : Flipkart Interface
Presentation Tier
Application Tier
❖ Vital responsibility of this layer is making logical decisions and
performing calculations.
❖ It moves and process the data between presentation and data tiers.
❖ It is also considered engine of the application.
❖ It gets the user input information and process with the logic and makes
the decisions.
❖ It is implemented using the technology like Java, .NET services,
ColdFusion.
Data Tier
❖ It provides the basic facilities of data.
➢ Storage.
➢ Access.
➢ Manipulations.
❖ This layer contains databases and Query processors.
❖ This layer implemented in the fixed server.
MAC Protocols
MAC
Protocols in Networking
Protocol: Sometimes referred to as an access method, a
protocol is a standard used to define a method of exchanging
data over a computer network such as local area network,
Internet, Intranet, etc. Each protocol has its own method of how
data is formatted when sent and what to do with it once
received, how that data is compressed or how to check for
errors in data.
Why we need in wireless ?
❖ More than one node is sharing the same medium at a
time.
❖ We need disciplined behaviour to use the shared
resources (channel) for effective access.
MAC = Medium Access Control
❖ Medium Access Control is protocol designed by the engineers at data link
level.
❖ It has the rules and regulations for accessing the shared medium at sub
level.
❖ It directly invokes the physical layers.
❖ Primary responsibility of the MAC protocol maintains the discipline in
accessing shared medium.
Is that all MAC Protocols are the same … ?

NO
Properties Required of MAC Protocols
❖ It should implement some rules that helps to enforce
discipline when the multiple nodes contend for a same
channel.
❖ It should help maximize the utilization of the channel.
❖ Channel allocation needs to be fair. No node should be
discriminated against at any time and made to wait for
an unduly(extremely) long time for transmission.
Properties Required of MAC Protocols
❖ It should be capable of supporting several types of
traffic having different maximum and average bit rates.
❖ It should be robust in the face of equipment failures
and changing network conditions.
MAC Protocols for wireless network
❖ We have standardised MAC protocol for wireless
network.
❖ IEEE 802.11 is WLAN Protocol for WiFi Cards.
❖ Still the researchers are concentrated towards improve
it’s efficieny.
 Wireless
MAC Protocol
Issues
MAC Protocol in Wireless vs Wired
❖ In wireless medium implementing MAC protocol is difficult.
❖ Collision detection is very hard in a wireless medium.
❖ So implementing a collision detection system in wireless is
hard.
❖ There are two common problems are found in wireless
network,
➢ Hidden Terminal Problem
➢ Exposed Terminal Problem
Hidden Terminal Problem
Radio Range of A Radio Range of C

A B C
Hidden Terminal Problem
❖ A, B, C are the nodes are terminals for data transmission.
❖ Bigger circle is transmission range.
❖ Individual Transmission between A to B and C to B has no problem at all.
❖ But if A and C are want to transmit to B at same time the problem arises,
❖ Because,
➢ B is present in transmission range of both A and C.
➢ But A and C does not know each other.
➢ A is hidden form C.
➢ A cannot sense C is present and vice versa.
➢ This create an problem that need to be solved by MAC protocol.
Exposed Terminal Problem

A B C
Hidden Terminal Problem
❖ A, B, C, are the nodes are terminals for data transmission.
❖ Bigger circle is transmission range.
❖ D wants to Transmit A.
❖ Normal conditions there is no problems.
❖ If B already transmitting to C means all the transmission are blocked for A
because A is exposed to B.
❖ Even simultaneous transmission from D to A and B to C is not affecting
each other.
❖ This is known as hidden terminal problem.
❖ It should be solved by MAC protocol.
Taxonomy of MAC Protocols
Types of MAC
Types of MAC Protocols
❖ There are three Types of MAC Protocols,
➢ Fixed Assignment Schemes.
➢ Random Assignment Schemes.
➢ Reservation Based Schemes.
Fixed Assignment Schemes
Strict Sharing
Fixed Assignment Schemes
❖ It is also called as circuit switched scheme.
❖ The Resource or Channel is shared by nodes based on
Time, Frequency or Code.
❖ There are three types of schemes available
➢ Frequency Division Multiple Access ( FDMA ).
➢ Time Division Multiple Access ( TDMA ).
➢ Code Division Multiple Access ( CDMA ).
Frequency Division Multiple
Access
FDMA
Frequency Division Multiple Access ( FDMA )
Available Bandwidth

Channel 6
Channel 4
Channel 2

Channel 5
Channel 3
Channel 1

Frequency
Frequency Division Multiple Access ( FDMA )
❖ In FDMA the available bandwidth is divided into many
narrow frequency band called channels.
❖ Each user need a two link
➢ Forward link ( Mobile to Base Station ).
➢ Reverse Link ( Base Station to Mobile ).
❖ Two channels are allocated to one user.
❖ These 2 channels are unable to allocate to other users
while on use.
Frequency Division Multiple Access ( FDMA )
❖ User never always uses this channel.
❖ When user on idle the channel utilization is very low.
❖ Implementation of this protocol is very easy.
❖ Big disadvantage is poor channel utilization
Time Division Multiple Access
TDMA
Time Division Multiple Access

Ch 1 Ch 2 …. Ch N Ch 1 Ch2 ... Ch N Ch 1 Ch 2 ... Ch N

Time
Frame
Time Division Multiple Access ( TDMA )
❖ TDMA allows the user to use multiple channels based
on different time slots.
❖ All sources are uses the same channel but it will wait
for time slots.
❖ The time slots are allocated in the round robin manner.
❖ Unused time slot makes the channel idle so this to
leads to poor utilization of channel.
Code Division Multiple Access
CDMA
Code Division Multiple Access ( TDMA )

Code 1

Code 2 Channel

Code 3
Code Division Multiple Access ( TDMA )
❖ In CDMA Technology multiple users can use the same
channel same time.
❖ No scheduling is needed.
❖ Message or data is encoded in the one end and
decripted in the other end.
❖ Lot of users data are encoded and multiplexed and
send in to same channel at time.
❖ Each user uses only one code.
Code Division Multiple Access ( TDMA )
❖ Maximum utilization of channel is obtained.
❖ But we need a special mechanism to generate code as
well encode and decode.
❖ Quite expensive procedure when compared to FDMA
and TDMA.
Random Assignment Scheme
Everybody Owns a Chance
Types of Schemes
❖ ALOHA.
❖ Slotted ALOHA.
❖ CSMA.
❖ CSMA/CD.
❖ CSMA/CA.
ALOHA
Don’t Wait
ALOHA Scheme
❖ It is simple communication scheme developed by university of hawaii.
❖ Also called as pure aloha.
❖ If want to start transmit just begin transmission.
❖ Transmission done by frame by frame.
❖ Check with every frame with destination whether frame is arrived or not.
❖ If it fails just retransmit.
❖ If it is success transmit next frame.
Problem ALOHA Scheme
❖ It is very acceptable when the network is too small and no.of transmitters
is less.
❖ If no.of transmitters are increasing the collision is unavoidable and it
becomes unacceptably high.
❖ So this is inefficient for larger networks.
Slotted ALOHA Scheme
❖ Time is divided into slots and packets assigned with.
❖ Packet size is restricted.
❖ Node can just transmit only the beginning of the transmission.
❖ Beacon signal is employed for indignation to beginning of the signals.
CSMA Scheme
❖ CSMA = Carrier Sense Multiple Access.
❖ Before the transmission begins the node check with a medium for traffic
and it defers the transmission rate.
❖ Two Techniques
➢ CSMA/CD
➢ CSMA/CA
Reservation Based Scheme
Everybody Owns a Chance
Reservation Based Scheme
❖ The scheme is based on RTS/CTS Signals
➢ RTS = Ready To Send
➢ CTS = Clear To Send
❖ Before the transmission node must send RTS Signal to receiver and
❖ Receiver sends CTS Signal and engages with transmission.
❖ Other nodes must wait until the data transmission is completed.
❖ To avoid collision with RTS and CTS Signal each node must wait in random
time slot send or receive RTS or CTS Signal.
❖ MACA - Multiple Access Collision Avoidance
What CTS and RTS Contains

Sender

Receiver

Transmission
Time

Typical CTS packet

RTS

A CTS B C
CTS
MACA Scheme (Exposed)
Radio Range of A Radio Range of C

CTS

A RTS B C
RTS