COURSE FILE

Mobile Computing

R13

IV B.Tech. - I Semester

Department of Computer Science and Engineering

GAYATRI VIDYA PARISHAD COLLEGE OF ENGINEERING FOR WOMEN

www.gvpcew.ac.in (Approved by AICTE & Affiliated to JNTUK) Estd. – 2008
Gandhi Nagar, Madhurawada, Visakhapatnam, Andhra Pradesh 530048 .

Unit4 material of Mobile Computing by Dr.N.Sharmili

 Unit-wise course material
1.1. Unit – IV - Data Dissemination and Synchronization

Mobile Transport Layer: Conventional TCP/IP Protocols, Indirect TCP, Snooping TCP,
Mobile TCP, Other Transport Layer Protocols for Mobile Networks.

Database Issues: Database Hoarding & Caching Techniques, Client-Server Computing &
Adaptation, Transactional Models, Query processing, Data Recovery Process & QoS Issues.

1.1.1. Unit Objectives: ……

After reading this Unit, you should be able to understand:

- Different protocols
- Different direct and indirect protocols
- Database Issues
- Different hoarding and caching techniques
- Client Server computing
- Different transactional models

1.1.2. Unit Outcomes:

After completing this Unit, the student should be able to:

- Explain different conventional and nonconventional protocols

- Identify different types of TCP protocol

- Compare different database models in the communications

- Analyze different hoarding and caching techniques

- Discuss the data recovery process

- Determine the different quality of service issues

Unit4 material of Mobile Computing by Dr.N.Sharmili

 - Unit Lecture Plan

Lectur Topic Methodology Quick reference

e no.
Lecture Conventional Chalk and Talk http://searchnetworking.techtarget.com/definitio
30 TCP/IP Protocols n/asymmetric-communications
Lecture Indirect TCP, PPT http://www.satishkashyap.com/2012/01/lecture-
31 Snooping TCP ppts-for-mobile-computing-by.html
Mobile TCP, PPT http://www.satishkashyap.com/2012/01/lecture-
Other Transport ppts-for-mobile-computing-by.html
Layer Protocols
Lecture for Mobile
32 Networks
Other Transport PPT http://www.satishkashyap.com/2012/01/lecture-
Layer Protocols ppts-for-mobile-computing-by.html
Lecture for Mobile
33 Networks
Group
Tutorial Discussion
Database PPT http://www.satishkashyap.com/2012/01/lecture-
Hoarding & ppts-for-mobile-computing-by.html
Lecture Caching
34 Techniques
Client-Server PPT http://www.satishkashyap.com/2012/01/lecture-
Lecture Computing & ppts-for-mobile-computing-by.html
35 Adaptation
Transactional PPT http://www.satishkashyap.com/2012/01/lecture-
Models, Query ppts-for-mobile-computing-by.html
Lecture
36 processing
Data Recovery PPT http://www.satishkashyap.com/2012/01/lecture-
Lecture Process & QoS ppts-for-mobile-computing-by.html
37 Issues.
Tutorial Seminar

1.1.3. Teaching Material / Teaching Aids as per above lecture plan.

1.1.3.1. Lecture-1:
Mobile Transport Layer: Conventional TCP/IP Protocols, Indirect TCP, Snooping TCP,
Mobile TCP, Other Transport Layer Protocols for Mobile Networks.

Database Issues: Database Hoarding & Caching Techniques, Client-Server Computing &
Adaptation, Transactional Models, Query processing, Data Recovery Process & QoS Issues.

Unit4 material of Mobile Computing by Dr.N.Sharmili

Congestion Control
A transport layer protocol such as TCP has been designed for fixed networks with fixed end- systems.
Congestion may appear from time to time even in carefully designed networks. The packet buffers of a
router are filled and the router cannot forward the packets fast enough because the sum of the input
rates of packets destined for one output link is higher than the capacity of the output link. The only thing
a router can do in this situation is to drop packets. A dropped packet is lost for the transmission, and the
receiver notices a gap in the packet stream. Now the receiver does not directly tell the sender which
packet is missing, but continues to acknowledge all in sequence packets up to the missing one.

The sender notices the missing acknowledgement for the lost packet and assumes a packet loss due to
congestion. Retransmitting the missing packet and continuing at full sending rate would now be unwise,
Unit4 material of Mobile Computing by Dr.N.Sharmili
as this might only increase the congestion. To mitigate congestion, TCP slows down the transmission
rate dramatically. All other TCP connections experiencing the same congestion do exactly the same so
the congestion is soon resolved.

Slow start
TCP’s reaction to a missing acknowledgement is quite drastic, but it is necessary to get rid of congestion
quickly. The behavior TCP shows after the detection of congestion is called slow start. The sender always
calculates a congestion window for a receiver. The start size of the congestion window is one segment
(TCP packet). The sender sends one packet and waits for acknowledgement. If this acknowledgement
arrives, the sender increases the congestion window by one, now sending two packets (congestion
window = 2). This scheme doubles the congestion window every time the acknowledgements come
back, which takes one round trip time (RTT). This is called the exponential growth of the congestion
window in the slow start mechanism

Unit4 material of Mobile Computing by Dr.N.Sharmili

Unit4 material of Mobile Computing by Dr.N.Sharmili
Unit4 material of Mobile Computing by Dr.N.Sharmili
Unit4 material of Mobile Computing by Dr.N.Sharmili
Unit4 material of Mobile Computing by Dr.N.Sharmili
Unit4 material of Mobile Computing by Dr.N.Sharmili
Unit4 material of Mobile Computing by Dr.N.Sharmili
Unit4 material of Mobile Computing by Dr.N.Sharmili
Unit4 material of Mobile Computing by Dr.N.Sharmili
Database Issues: Database Hoarding & Caching Techniques, Client-Server Computing &
Adaptation, Transactional Models, Query processing, Data Recovery Process & QoS Issues.

Unit4 material of Mobile Computing by Dr.N.Sharmili

Both the two architectures belong to the class of one-tier database architecture because the databases
are specific to a mobile device, not meant to be distributed to multiple devices, not synchronized with
the new updates, are stored at the device itself. Some examples are downloaded ringtones, music etc.
IBM DB2 Everyplace (DB2e) is a relational database engine which has been designed to reside at the

Unit4 material of Mobile Computing by Dr.N.Sharmili

device. It supports J2ME and most mobile device operating systems. DB2e synchronizes with DB2
databases at the synchronization, application, or enterprise server .

The database architecture shown below is for two-tier or multi-tier databases. Here, the databases
reside at the remote servers and the copies of these databases are cached at the client tiers. This is
known as client-server computing architecture.

A cache is a list or database of items or records stored at the device. Databases are hoarded at the
application or enterprise tier, where the database server uses business logic and connectivity for
retrieving the data and then transmitting it to the device. The server provides and updates local copies
of the database at each mobile device connected to it. The computing API at the mobile device (first
tier) uses the cached local copy. At first tier (tier 1), the API uses the cached data records using the
computing architecture as explained above. From tier 2 or tier 3, the server retrieves and transmits the
data records to tier 1 using business logic and synchronizes the local copies at the device. These local
copies function as device caches.

The advantage of hoarding is that there is no access latency (delay in retrieving the queried record from
the server over wireless mobile networks). The client device API has instantaneous data access to
hoarded or cached data. After a device caches the data distributed by the server, the data is hoarded at
the device. The disadvantage of hoarding is that the consistency of the cached data with the database at
the server needs to be maintained.

Data Caching
Hoarded copies of the databases at the servers are distributed or transmitted to the mobile devices
from the enterprise servers or application databases. The copies cached at the devices are equivalent to
the cache memories at the processors in a multiprocessor system with a shared main memory and
copies of the main memory data stored at different locations.

Cache Access Protocols: A client device caches the pushed (disseminated) data records from a server.
Caching of the pushed data leads to a reduced access interval as compared to the pull (ondemand)
mode of data fetching. Caching of data records can be-based on pushed 'hot records' (the most needed
database records at the client device). Also, caching can be based on the ratio of two parameters—
access probability (at the device) and pushing rates (from the server) for each record. This method is
called cost-based data replacement or caching.

Pre-fetching: Pre-fetching is another alternative to caching of disseminated data. The process of pre-
fetching entails requesting for and pulling records that may be required later. The client device can pre-
fetch instead of caching from the pushed records keeping future needs in view. Pre-fetching reduces
server load. Further, the cost of cache-misses can thus be reduced. The term 'cost of cache-misses'
refers to the time taken in accessing a record at the server in case that record is not found in the device
database when required by the device API.

Caching Invalidation Mechanisms

Unit4 material of Mobile Computing by Dr.N.Sharmili

A cached record at the client device may be invalidated. This may be due to expiry or modification of the
record at the database server. Cache invalidation is a process by which a cached data item or record
becomes invalid and thus unusable because of modification, expiry, or invalidation at another
computing system or server. Cache invalidation mechanisms are used to synchronize the data at other
processors whenever the cache-data is written (modified) by a processor in a multiprocessor system,
cache invalidation mechanisms are also active in the case of mobile devices having distributed copies
from the server.

A cache consists of several records. Each record is called a cache-line, copies of which can be stored at
other devices or servers. The cache at the mobile devices or server databases at any given time can be
assigned one of four possible tags indicating its state—modified (after rewriting), exclusive, shared, and
invalidated (after expiry or when new data becomes available) at any given instance. These four states
are indicated by the letters M, E, S, and I, respectively (MESI). The states indicated by the various tags
are as follows:

a) The E tag indicates the exclusive state which means that the data record is for internal use and
cannot be used by any other device or server.

b) The S tag indicates the shared state which indicates that the data record can be used by others. c)
The M tag indicates the modified state which means that the device cache d) The I tag indicates the
invalidated state which means that the server database no longer has a copy of the record which was
shared and used for computations earlier.

The following figure shows the four possible states of a data record i at any instant in the server
database and its copy at the cache of the mobile device j.

Unit4 material of Mobile Computing by Dr.N.Sharmili

Unit4 material of Mobile Computing by Dr.N.Sharmili
Unit4 material of Mobile Computing by Dr.N.Sharmili
Unit4 material of Mobile Computing by Dr.N.Sharmili
Unit4 material of Mobile Computing by Dr.N.Sharmili
Unit4 material of Mobile Computing by Dr.N.Sharmili
Unit4 material of Mobile Computing by Dr.N.Sharmili
Unit4 material of Mobile Computing by Dr.N.Sharmili
Transaction means execution of interrelated instructions in a sequence for a specific operation on a
database. Database transaction models must maintain data integrity and must enforce a set of rules
called ACID rules.

ACID Rules
Atomicity: All operations of a transaction must be complete. In case, a transaction cannot be completed;
it must be undone (rolled back). Operations in a transaction are assumed to be one indivisible unit
(atomic unit)

Consistency: A transaction must be such that it preserves the integrity constraints and follows the
declared consistency rules for a given database. Consistency means the data is not in a contradictory
state after the transaction. i.e. guarantees data validity even in the event of errors or power failures.

Isolation: If two transactions are carried out simultaneously, there should not be any interference
between the two (i.e. multiple transactions occurring at the same time without impacting each others
execution). Further, any intermediate results in a transaction should be invisible to any other
transaction.

Unit4 material of Mobile Computing by Dr.N.Sharmili

Durability: After a transaction is completed, it must persist and cannot be aborted or discarded (i.e.
Durability gives guarantee that transactions have committed will survive permanently) • For example, in
a transaction entailing transfer of a balance from account A to account B, once the transfer is completed
and finished there should be no roll
back.

Unit4 material of Mobile Computing by Dr.N.Sharmili

Unit4 material of Mobile Computing by Dr.N.Sharmili
Unit4 material of Mobile Computing by Dr.N.Sharmili
 1.1.4. Review Questions
a. Objective type of questions(Very short notes)
i) Restate communication asymmetry?
ii) Rewrite data delivery mechanisms?
iii) Restate data dissemination?
iv) Trace broadcast models?
v) Rewrite selective tuning methods?
vi) Restate selective indexing methods?
vii) List data synchronization softwares?
viii) List data synchronization tools?
ix) Rewrite data synchronization protocols?
x) List data delivery mechanisms?
b. Analytical type questions
i) Analyze data delivery mechanisms?
ii) Compare different broadcast models?
iii) Classify data delivery mechanisms?
iv) Categorize selective tuning methods?
v) Differentiate data broadcast and dissemination models?
vi) Classify selective tuning and indexing methods?
vii) Analyze selective indexing methods?
viii) Differentiate data synchronization protocols?
ix) Compare data synchronization softwares?
x) Classify data synchronization protocols?
c. Essay type Questions
i) Explain the concept of communications asymmetry?
ii) Describe different data delivery mechanisms?
iii) Determine different data disseminate and broadcast models?
iv) Analyze selective tuning methods?
v) Compare selective tuning and indexing tuning methods?
vi) Write a note on data synchronization software tools?
vii) Write a note on data synchronization software protocols?
viii) Distinguish data synchronization software tools and protocols?
ix) Explain in detail about the different data dissemination models?
x) Determine different data synchronization protocols?

1.1.5. Skill Building Exercises/Assignments

Eg:- -Prepare a model of something
Unit4 material of Mobile Computing by Dr.N.Sharmili
 -Trace something
-Prepare a report on something etc.

1.1.6. Previous Questions (Asked by JNTUK from the concerned Unit)

i) Give the taxonomy for data dissemination mechanism for mobile
application?
ii) Draw the architectural diagram for pull based data delivery?
iii) Explain in detail about selective tuning techniques?
iv) Describe hybrid data dissemination mechanism. List its advantages?
v) What are the advantages of hoarding data at the mobile data?
vi) What is meant by communication asymmetry?
vii) What is a push model? Explain its pros and cons?
viii) Write a brief note on data synchronization?
ix) Explain data dissemination process and broadcasting process in
information management of mobile computing devices?

1.1.7. GATE Questions (Where relevant)

Mobile Computing syllabus was not included in the GATE Prescribed syllabus.

1.1.8. Interview questions (which are frequently asked in a Technical

round - Placements)
i) Explain different data delivery mechanisms?
ii) Define data dissemination?
iii) Explain different data broadcast models?
iv) What is selective tuning?
v) Explain different selective tuning methods?
vi) Explain different data indexing methods?
vii) What is data synchronization?
viii) Name different data synchronization software tools?
ix) Name different data synchronization protocols?
x) Differentiate selective tuning and indexing?
1.1.9. Real-Word (Live) Examples / Case studies wherever applicable
i) Server Broadcast Programs
ii) Client Cache Management
iii) Prefetching models
iv) Read/Write Case

1.1.10. Literature references of Relevant NPTEL Videos/Web/You Tube

videos etc.
Unit4 material of Mobile Computing by Dr.N.Sharmili
 i) https://www.youtube.com/watch?v=5eS78dE2z6Y&list=PL1A4AFAC7AC
1909C9&index=22
ii) https://www.youtube.com/watch?v=NmLl_1iV-
dE&list=PLPRthuw8Et1epkTZicuwxLETjjkpRy3-R
iii) https://www.youtube.com/watch?v=ISeO7CDmr7M&index=2&list=PLPR
thuw8Et1epkTZicuwxLETjjkpRy3-R
iv) https://www.youtube.com/watch?v=B5CIeOaq7Io
v) https://www.youtube.com/watch?v=zzXs0EnCin0&list=PL04D5787E247D
C324&index=3
vi) https://www.youtube.com/watch?v=zzXs0EnCin0&list=PL04D5787E247
DC324&index=4
vii) https://www.youtube.com/watch?v=zzXs0EnCin0&list=PL04D5787
E247DC324&index=5
viii) https://www.youtube.com/watch?v=zzXs0EnCin0&list=PL04D5787E247
DC324&index=6

4.1.1. Reference Text Books / with Journals Chapters etc.

1. Jochen Schiller, “Mobile Communications”, Addison-Wesley, Second Edition, 2009.
2. Raj Kamal, “Mobile Computing”, Oxford University Press, 2007, ISBN: 0195686772
3. ASOKE K TALUKDER, HASAN AHMED, ROOPA R YAVAGAL, “Mobile Computing,
Technology Applications and Service Creation” Second Edition, Mc Graw Hill.
4. UWE Hansmann, Lother Merk, Martin S. Nocklous, Thomas Stober, “Principles of Mobile
Computing,” Second Edition, Springer.

Unit4 material of Mobile Computing by Dr.N.Sharmili