Project Phase I: Guided By, Presented by

You might also like

Download as ppt, pdf, or txt
Download as ppt, pdf, or txt
You are on page 1of 16

PROJECT PHASE I

GUIDED BY,
Ms. N. Radhika M.Tech.,
Assistant Professor/CSE
Prist Univ-Trichy

PRESENTED BY,
Vadivel.D
II-M.Tech.,CSE
Prist Univ-Trichy

Abstract
The main aim of the project is where Data caching

strategy for ad hoc networks whose nodes exchange


information items in a peer-to-peer fashion.

Why Ad Hoc Networks?


Ease of deployment
Speed of deployment
No fixed infrastructure

Existing System
Mobile environment classification.
Cache array routing protocol.
Mobile node request.
Caching nodes outside the path.

Drawbacks
Cache array routing protocol.
Sharing cache information with the requesting node.

Proposed System
Caching algorithms in different ad hoc network.
Resource-Efficient information access.
Nodes exchanges information.
Network composed of mediator nodes.

Advantages
Data caching Efficiency
Reducing - Access latency and bandwidth.
Information retrieval
Routing protocol

Hardware Requirements
System
Hard Disk
Floppy Drive
Monitor
Mouse
Ram

:
Pentium IV 2.4 GHz.
:
40 GB.
:
1.44 Mb.
15 VGA Color.
:
Logitech.
:
512 Mb.

Software Requirements
Operating system
Coding Language
Tools

:
:
:

Windows XP.
JDK 1.6
Eclipse 3.3

Activity Diagram

Modules
Self -Organizing
Self-Addressing (MANET)
Integrated Cache-Routing
Localized Caching Policy

Distributed Caching Algorithm

Self-Organizing
Node caches item most frequently.
Eliminates replications among neighboring nodes.
Requires mediator nodes.

Self-Addressing
Represent nodes and edges.
Nodes communicate.
Cache placement multiple data items.
Minimize access cost.

Conclusion
Data caching techniques to support effective data access.
Data caching algorithms to determine near optimal cache

placements to maximize reduction in access cost.


Creation of content diversity within the nodes

neighborhood.

References
[1] C. Casetti, and C.-F.Chiasserini, Caching Strategies Based on Information Density
Estimation in Wireless Ad Hoc Networks, IEEE Trans on Vehicular Technology,
Vol.60,No.5, Jun. 2011.
[2] N. Dimokas, D. Katsaros, and Y. Manolopoulos, Cooperative caching in wireless
multimedia sensor networks, ACM Mobile Netw. Appl., vol. 13, no. 3/4, pp. 337
356, Aug. 2008.
[3] B.-J. Ko and D. Rubenstein, Distributed self-stabilizing placement of replicated
resources in emerging networks, IEEE/ACM Trans. Netw., vol. 13, no. 3, pp. 476
487, Jun. 2005.
[4] G. Cao, L. Yin, and C. R. Das, Cooperative cache-based data access in ad hoc
networks, Computer, vol. 37, no. 2, pp. 3239, Feb. 2004.
[5] J. Xu, Q. Hu, W.-C. Lee, and D. L. Lee, Performance evaluation of an optimal
cache replacement policy for wireless data dissemination, IEEE Trans. Knowl.
Data Eng., vol. 16, no. 1, pp. 125139, Jan. 2004.

Thank You

You might also like