Dissertation cloud computing lab with mobile

presentation for cloud computing

1. Presented By
Ravi Kant Sahu
10M535
M. Tech. (Mobile Computing)

2. Outlines
Introduction
Problem Statement
Proposed Scheme for data dissemination
Importance of proposed Research
Expected Deliverables/ Outcomes
References

3. Introduction
Sensors measure and monitor ambient conditions in the
surrounding environment.
Source nodes: sensors generating the data.
Sink: an object or base station, subscribing the data.
Data Dissemination: Process of forwarding the measurements
and monitored events to the sink.
Mobility of sinks and events in the sensor field brings new
challenges.

4. Problem Statement
The main problems in data dissemination in WSNs are:
1.Use of separate virtual grids for each source.
2.No energy efficient scheme for handling dissemination node
failure.
3.Energy of the sensor nodes are not considered during the grid
construction process and data forwarding to the sinks.
4.Data dissemination to multiple mobile sinks from the mobile
source of event.
5.Improving the performance and virtual grid life-time.

5. Proposed Data Dissemination Scheme
Objectives:
The main objectives are:
To reduce the number of messages required for virtual
grid construction.
To provide an efficient data dissemination scheme for
mobile sinks.
Handling Dissemination node failure in virtual grid.
Taking the energy aspects into consideration while
selecting the dissemination nodes for data dissemination.

6. Research Issues and Challenges
Determining the cell size
Uncertainty in sensor nodes location
Sink Mobility
Event Mobility
Dissemination node failure

7. Determining Cell size
Determining the radius d of expected zone
We will construct a circular expected zone with radius d.
So πd
2
will be the area of the expected zone.
Let there are n sensor nodes deployed in the sensor field and the area of the
region is A.
Then , Area of finding 1 sensor node = total number of sensors / total area
πd
2
= n / A
d = (n / π A)
½
We will take the upper bound (floor value) of the calculated value, so that
there will be the probability of finding more than one sensor nodes in that
area-
d = ┌ (n / π A)
½
┐

8. AB = BC = CD = AD = α … (cell
size)
AP = CQ = d … (radius of expected
zone)
In triangle ABC,
So, AC = α √2
PQ = R … (Radio range)
So, QC + CA + AP = R
Or d + α √2 + d = R
Or α √2 + 2d =R
Or α √2 = R –2d
Or α = (R –2d) / √2

9. Grid Construction
Select the node with maximumenergywith in the expected
zone.
Maintain the list of all the nodes in descending order of
remaining energy.

10. References
Elyes Ben Hamida and Guillaume Chelius, “Strategies for data dissemination to mobile
sinks in wireless sensor networks,”IEEE Wireless Commun., December 2008.
H. Luo et al., “TTDD: Two-Tier Data Dissemination in Large-Scale Wireless Sensor
Networks,” ACM J. Mobile Net. And Apps., Special Issue on ACM MOBICOM ’03,
2003.
T.P. Sharma et al., “GBDD: Grid Based Data Dissemination in Wireless Sensor
Networks,”
ADCOM 2008.
Soochang Park et al.,“Scalable and Robust Data Dissemination for Large-scale Wireless
Sensor Networks,” IEEE Transactions on Consumer Electronics, Vol. 56, No. 3, August
2010.
J.-L. Lu and F. Valois, “On the Data Dissemination in WSNs,” 3rd Int’l. Conf. Wireless
and Mobile Comp.,Net. and Commun., New York, NY, Oct. 2007.
C.-J. Lin, P.-L. Chou, and C.-F. Chou, “HCDD: Hierarchical Cluster-Based Data
Dissemination in Wireless Sensor Networks with Mobile Sink,” Proc. 2006 Int’l. Conf.
Wireless Commun. and Mobile Comp., New York, NY, 2006, pp. 1189–94.

11. .
.