Caching Strategies Based on Information Density Estimation in Wireless Ad Hoc Networks
-
Upload
harithaghantasala -
Category
Documents
-
view
423 -
download
0
description
Transcript of Caching Strategies Based on Information Density Estimation in Wireless Ad Hoc Networks
![Page 1: Caching Strategies Based on Information Density Estimation in Wireless Ad Hoc Networks](https://reader033.fdocuments.us/reader033/viewer/2022050907/55720f5c497959fc0b8c90f0/html5/thumbnails/1.jpg)
Caching Strategies based on Information Density Estimation
In Wireless Ad hoc Networks
By
Haritha Ghantasala
MCA III Year
![Page 2: Caching Strategies Based on Information Density Estimation in Wireless Ad Hoc Networks](https://reader033.fdocuments.us/reader033/viewer/2022050907/55720f5c497959fc0b8c90f0/html5/thumbnails/2.jpg)
2
What is an Ad hoc NetworkCollection of mobile wireless nodes forming
a network without the aid of any infrastructure or centralized administration
Nodes have limited transmission rangeNodes act as a routers
![Page 3: Caching Strategies Based on Information Density Estimation in Wireless Ad Hoc Networks](https://reader033.fdocuments.us/reader033/viewer/2022050907/55720f5c497959fc0b8c90f0/html5/thumbnails/3.jpg)
3
Ad Hoc Networks
Rapidly deployable infrastructure◦ Wireless: cabling impractical◦ Ad-Hoc: no advance planning
Backbone network: wireless IP routers
• Network of access devices• Wireless: untethered• Ad-hoc: random deployment
• Edge network: Sensor networks, Personal Area Networks (PANs), etc.
• Disaster recovery• Battlefield• ‘Smart’ office
![Page 4: Caching Strategies Based on Information Density Estimation in Wireless Ad Hoc Networks](https://reader033.fdocuments.us/reader033/viewer/2022050907/55720f5c497959fc0b8c90f0/html5/thumbnails/4.jpg)
4
Ad Hoc Network
Characteristics◦ Dynamic topologies◦ Limited channel bandwidth◦ Variable capacity links◦ Energy-constrained operation◦ Limited physical security
Applications◦ Military battlefield networks◦ Personal Area Networks (PAN)◦ Disaster and rescue operation ◦ Peer to peer networks
![Page 5: Caching Strategies Based on Information Density Estimation in Wireless Ad Hoc Networks](https://reader033.fdocuments.us/reader033/viewer/2022050907/55720f5c497959fc0b8c90f0/html5/thumbnails/5.jpg)
What is Cache In computer science, a cache is a
component that transparently stores data so that future requests for that data can be served faster.
If requested data is contained in the cache it is cache hit
If it is not in the cache it is Cache Miss
![Page 6: Caching Strategies Based on Information Density Estimation in Wireless Ad Hoc Networks](https://reader033.fdocuments.us/reader033/viewer/2022050907/55720f5c497959fc0b8c90f0/html5/thumbnails/6.jpg)
Difference between buffer and cache A buffer is a temporary memory location that is
traditionally used because CPU instructions cannot directly address data stored in peripheral devices. Thus, addressable memory is used as an intermediate stage.
The buffered data are written to the buffer once and read from the buffer once.
A cache also increases transfer performance. A part of the increase similarly comes from the possibility that multiple small transfers will combine into one large block.
The same datum will be read from cache multiple times, or that written data will soon be read.
![Page 7: Caching Strategies Based on Information Density Estimation in Wireless Ad Hoc Networks](https://reader033.fdocuments.us/reader033/viewer/2022050907/55720f5c497959fc0b8c90f0/html5/thumbnails/7.jpg)
AbstractIn a Wireless Ad Hoc Network nodes exchange
information in peer-to-peer fashion.
Proper use of large-sized and small-sized caches.
Creation of content diversity within the neighborhood.
Simulating caching algorithms to achieve a resource efficient information access.
![Page 8: Caching Strategies Based on Information Density Estimation in Wireless Ad Hoc Networks](https://reader033.fdocuments.us/reader033/viewer/2022050907/55720f5c497959fc0b8c90f0/html5/thumbnails/8.jpg)
ObjectiveOur main objective of this project is to
propose a novel asymmetric cooperative cache approach, where the data requests are transmitted to the cache layer on every node, but the data replies are only transmitted to the cache layer at the intermediate nodes that need to cache the data. This solution not only reduces the overhead of copying data between the user space and the kernel space, it also allows data pipelines to reduce the end-to-end delay.
![Page 9: Caching Strategies Based on Information Density Estimation in Wireless Ad Hoc Networks](https://reader033.fdocuments.us/reader033/viewer/2022050907/55720f5c497959fc0b8c90f0/html5/thumbnails/9.jpg)
Modules
1. Network Joining Module(Cache Implementation)
2. Authentication Modules3. Operations Modules
a) Sendb) Receivec) View Neighborsd) Transactionse) Log
![Page 10: Caching Strategies Based on Information Density Estimation in Wireless Ad Hoc Networks](https://reader033.fdocuments.us/reader033/viewer/2022050907/55720f5c497959fc0b8c90f0/html5/thumbnails/10.jpg)
1. Network Joining Module (Cache Implementation)
This module is used to join in to the network
with proper handshake credentials such as ip
address and port numbers which are provided
to the system for both client and server in the
form of configuration files. Using these first
the server is deployed. And then each client
connects to the server using his own
customized configuration files.
![Page 11: Caching Strategies Based on Information Density Estimation in Wireless Ad Hoc Networks](https://reader033.fdocuments.us/reader033/viewer/2022050907/55720f5c497959fc0b8c90f0/html5/thumbnails/11.jpg)
2. Authentication Module:
By using this module each node joins
network completely by getting validated
by a monitoring node/server. Thus after
this successful operation a node
completely joins the network. Ciphering
schemes are implemented here which
acts as replacements for certificate based
methods.
![Page 12: Caching Strategies Based on Information Density Estimation in Wireless Ad Hoc Networks](https://reader033.fdocuments.us/reader033/viewer/2022050907/55720f5c497959fc0b8c90f0/html5/thumbnails/12.jpg)
3. Operations Modules:
By using this module nodes will get access to all the services provided
by the network. This module is having following sub functionalities.
Send: By using this functionality nodes can send data in the network.
Receive: By using this functionality nodes can receive data from the
network.
View neighbors: By using this functionality nodes can see all the
existing neighbor nodes in the network.
Transaction: A detailed information accumulated of performed
transactions(joining, sending, receiving) in the network.
Log: A log view maintained and displayed for all the transactions in the
network at each client
![Page 13: Caching Strategies Based on Information Density Estimation in Wireless Ad Hoc Networks](https://reader033.fdocuments.us/reader033/viewer/2022050907/55720f5c497959fc0b8c90f0/html5/thumbnails/13.jpg)
Cache
Java Network
Node Admission processNode
Network
Information
Node Communication
<<include>>
Network Operation Use case:
![Page 14: Caching Strategies Based on Information Density Estimation in Wireless Ad Hoc Networks](https://reader033.fdocuments.us/reader033/viewer/2022050907/55720f5c497959fc0b8c90f0/html5/thumbnails/14.jpg)
Project Use case
stone in NODE cache using hamlet strategy
<<extends>>
Determine cache DROPTIME
NODE Determine content replacement in cache
Recive Information
NETWORK
Informanation presence in neighbours
![Page 15: Caching Strategies Based on Information Density Estimation in Wireless Ad Hoc Networks](https://reader033.fdocuments.us/reader033/viewer/2022050907/55720f5c497959fc0b8c90f0/html5/thumbnails/15.jpg)
Class & Package diagram
Network
Server
ClientId[]
Operations()Trackclients()Server()
Node Cache Simulation
A A
A
Operations
MsgNoOfCilent
Node
id
join()send()receive()communication()validateothers()
Query
query
startquery()duplicate()solved()relay()
Information
informationquery
searchquery()recieveInfo()duplicate()solved()chunk()stone()discard()
NODE
ipneigbours[]cache
updatecache()createcache()relay()providechunk()
![Page 16: Caching Strategies Based on Information Density Estimation in Wireless Ad Hoc Networks](https://reader033.fdocuments.us/reader033/viewer/2022050907/55720f5c497959fc0b8c90f0/html5/thumbnails/16.jpg)
SEQUENCE DIAGRAM
:Network:Node :Cache :Query :Information :Neigbhours
join()
joined
updateCache()
cacheUpdated()
requestInformation()
contact()
neigbhours list()
sendQuery()
check each cache
Results
Results
requestQuery()
Search()
get()
process()
Information
informanation
share()
acknowledgment
Information
![Page 17: Caching Strategies Based on Information Density Estimation in Wireless Ad Hoc Networks](https://reader033.fdocuments.us/reader033/viewer/2022050907/55720f5c497959fc0b8c90f0/html5/thumbnails/17.jpg)
COLLABRATION DIAGRAM
:Node
:Cache
:Query
:Information
:Neigbhours
:Network
10: check each cache
15: process()
1: join()
2: joined
4: updateCache()
5: cacheUpdated()
6: requestInformation()14: Search()
12: Results18: Information
7: contact()8: neigbhours list()
9: sendQuery()11: Results
16: get()
17: Information
3: informanation
13: requestQuery()20: acknowledgment
19: share()
![Page 18: Caching Strategies Based on Information Density Estimation in Wireless Ad Hoc Networks](https://reader033.fdocuments.us/reader033/viewer/2022050907/55720f5c497959fc0b8c90f0/html5/thumbnails/18.jpg)
ACTIVITY DIAGRAM
![Page 19: Caching Strategies Based on Information Density Estimation in Wireless Ad Hoc Networks](https://reader033.fdocuments.us/reader033/viewer/2022050907/55720f5c497959fc0b8c90f0/html5/thumbnails/19.jpg)
ACTIVITY DIAGRAM 2
![Page 20: Caching Strategies Based on Information Density Estimation in Wireless Ad Hoc Networks](https://reader033.fdocuments.us/reader033/viewer/2022050907/55720f5c497959fc0b8c90f0/html5/thumbnails/20.jpg)
COMPONENT DIAGRAM
![Page 21: Caching Strategies Based on Information Density Estimation in Wireless Ad Hoc Networks](https://reader033.fdocuments.us/reader033/viewer/2022050907/55720f5c497959fc0b8c90f0/html5/thumbnails/21.jpg)
DEPLOYMENT DIAGRAM
NODE.jar<<system>>
![Page 22: Caching Strategies Based on Information Density Estimation in Wireless Ad Hoc Networks](https://reader033.fdocuments.us/reader033/viewer/2022050907/55720f5c497959fc0b8c90f0/html5/thumbnails/22.jpg)
Assumptions Assume a content distribution system
where the following assumptions hold:• A number I of information items is available to
the users, with each item divided into a number C of chunks
• User nodes can overhear queries for content and relative responses within their radio proximity by exploiting the broadcast nature of the wireless medium
• User nodes can estimate their distance in hops from the query source and the responding node due to a hop-count field in the messages.
![Page 23: Caching Strategies Based on Information Density Estimation in Wireless Ad Hoc Networks](https://reader033.fdocuments.us/reader033/viewer/2022050907/55720f5c497959fc0b8c90f0/html5/thumbnails/23.jpg)
Flowcharts of the processing of (a) query and (b) information messages
![Page 24: Caching Strategies Based on Information Density Estimation in Wireless Ad Hoc Networks](https://reader033.fdocuments.us/reader033/viewer/2022050907/55720f5c497959fc0b8c90f0/html5/thumbnails/24.jpg)
Hamlet Framework Information Presence Estimation
A node n within its reach range computes:
• Provider counter dic(n, j)
dic(n, j) = dic(n, j) +1 ∕hQ
• Transit counter ric(n, j)
ric(n, j) = ric(n, j) +1 ∕hP+1 ∕hQ
![Page 25: Caching Strategies Based on Information Density Estimation in Wireless Ad Hoc Networks](https://reader033.fdocuments.us/reader033/viewer/2022050907/55720f5c497959fc0b8c90f0/html5/thumbnails/25.jpg)
Provider Node and Transit Node
![Page 26: Caching Strategies Based on Information Density Estimation in Wireless Ad Hoc Networks](https://reader033.fdocuments.us/reader033/viewer/2022050907/55720f5c497959fc0b8c90f0/html5/thumbnails/26.jpg)
Hamlet Framework
Information Presence Estimation• In case of not related information
message
ric(n, j) = ric(n, j) +1 ∕hP
• Presence Index of chunk c of
information i given as
pic(n, j) = min {1, dic(n, j) + ric(n, j)}
![Page 27: Caching Strategies Based on Information Density Estimation in Wireless Ad Hoc Networks](https://reader033.fdocuments.us/reader033/viewer/2022050907/55720f5c497959fc0b8c90f0/html5/thumbnails/27.jpg)
Existing SystemThe novel applications such as mobile
multimedia are likely to overload the wireless network (as recently happened to AT&T following the introduction of the iPhone).
It is conceivable that a peer-to-peer system could come in handy, if used in conjunction with cellular networks, to promote content sharing using ad hoc networking among mobile users.
![Page 28: Caching Strategies Based on Information Density Estimation in Wireless Ad Hoc Networks](https://reader033.fdocuments.us/reader033/viewer/2022050907/55720f5c497959fc0b8c90f0/html5/thumbnails/28.jpg)
Disadvantages of Existing SystemIn the caching strategies based on
informationdensity estimation in Mobile Ad Hoc
Networks(MANET), which faces some
disadvantages.
Wasteful in terms of the networks total bandwidth
Message DuplicationSelective Flooding
![Page 29: Caching Strategies Based on Information Density Estimation in Wireless Ad Hoc Networks](https://reader033.fdocuments.us/reader033/viewer/2022050907/55720f5c497959fc0b8c90f0/html5/thumbnails/29.jpg)
Proposed SystemIn the proposed system, we address the
issue ofdisadvantages faced in flooding routing
protocol,using DSR and AODV protocol. The
advantages ofour proposed system are:It eliminates table-driven approach.We simulate and show the node routing
between the cells, with all the information such as number of cells, number of hops, time taken etc.
![Page 30: Caching Strategies Based on Information Density Estimation in Wireless Ad Hoc Networks](https://reader033.fdocuments.us/reader033/viewer/2022050907/55720f5c497959fc0b8c90f0/html5/thumbnails/30.jpg)
System Requirements:
Hardware Requirements: PROCESSOR : PENTIUM IV 2.6 GHz RAM : 512 MB DD RAM MONITOR : 15” COLOR HARD DISK : 20 GB KEYBOARD : STANDARD 102 KEYS MOUSE : 3 BUTTONS
![Page 31: Caching Strategies Based on Information Density Estimation in Wireless Ad Hoc Networks](https://reader033.fdocuments.us/reader033/viewer/2022050907/55720f5c497959fc0b8c90f0/html5/thumbnails/31.jpg)
Software Requirements: Front End : Java( Swings
)Tools Used : Net beans
7.0Operating System : Windows
XP
![Page 32: Caching Strategies Based on Information Density Estimation in Wireless Ad Hoc Networks](https://reader033.fdocuments.us/reader033/viewer/2022050907/55720f5c497959fc0b8c90f0/html5/thumbnails/32.jpg)
Server Started with port number 5555:
![Page 33: Caching Strategies Based on Information Density Estimation in Wireless Ad Hoc Networks](https://reader033.fdocuments.us/reader033/viewer/2022050907/55720f5c497959fc0b8c90f0/html5/thumbnails/33.jpg)
CLIENT1 DETAILS
![Page 34: Caching Strategies Based on Information Density Estimation in Wireless Ad Hoc Networks](https://reader033.fdocuments.us/reader033/viewer/2022050907/55720f5c497959fc0b8c90f0/html5/thumbnails/34.jpg)
CLIENT1 JOINED TO THE NETWORK
![Page 35: Caching Strategies Based on Information Density Estimation in Wireless Ad Hoc Networks](https://reader033.fdocuments.us/reader033/viewer/2022050907/55720f5c497959fc0b8c90f0/html5/thumbnails/35.jpg)
CLIENT1’s NETWORK DETAILS
![Page 36: Caching Strategies Based on Information Density Estimation in Wireless Ad Hoc Networks](https://reader033.fdocuments.us/reader033/viewer/2022050907/55720f5c497959fc0b8c90f0/html5/thumbnails/36.jpg)
CLIENT2 DETAILS
![Page 37: Caching Strategies Based on Information Density Estimation in Wireless Ad Hoc Networks](https://reader033.fdocuments.us/reader033/viewer/2022050907/55720f5c497959fc0b8c90f0/html5/thumbnails/37.jpg)
CLIENT2 JOINED TO THE NETWORK
![Page 38: Caching Strategies Based on Information Density Estimation in Wireless Ad Hoc Networks](https://reader033.fdocuments.us/reader033/viewer/2022050907/55720f5c497959fc0b8c90f0/html5/thumbnails/38.jpg)
CLIENT2’s NETWORK DETAILS
![Page 39: Caching Strategies Based on Information Density Estimation in Wireless Ad Hoc Networks](https://reader033.fdocuments.us/reader033/viewer/2022050907/55720f5c497959fc0b8c90f0/html5/thumbnails/39.jpg)
CLIENT1 IS DISPLAYING UPDATED NEIGHBOR NODES
![Page 40: Caching Strategies Based on Information Density Estimation in Wireless Ad Hoc Networks](https://reader033.fdocuments.us/reader033/viewer/2022050907/55720f5c497959fc0b8c90f0/html5/thumbnails/40.jpg)
CLIENT1 DISPLAYING UPDATED NETWORK DETAILS
![Page 41: Caching Strategies Based on Information Density Estimation in Wireless Ad Hoc Networks](https://reader033.fdocuments.us/reader033/viewer/2022050907/55720f5c497959fc0b8c90f0/html5/thumbnails/41.jpg)
CLIENT3 DETAILS
![Page 42: Caching Strategies Based on Information Density Estimation in Wireless Ad Hoc Networks](https://reader033.fdocuments.us/reader033/viewer/2022050907/55720f5c497959fc0b8c90f0/html5/thumbnails/42.jpg)
CLIENT3 JOINED TO THE NETWORK
![Page 43: Caching Strategies Based on Information Density Estimation in Wireless Ad Hoc Networks](https://reader033.fdocuments.us/reader033/viewer/2022050907/55720f5c497959fc0b8c90f0/html5/thumbnails/43.jpg)
CLIENT1 DISPLAYING UPDATED NEIGHBOR NODES
![Page 44: Caching Strategies Based on Information Density Estimation in Wireless Ad Hoc Networks](https://reader033.fdocuments.us/reader033/viewer/2022050907/55720f5c497959fc0b8c90f0/html5/thumbnails/44.jpg)
CLIENT2 DISPLAYING UPDATED NEIGHBOR NODES
![Page 45: Caching Strategies Based on Information Density Estimation in Wireless Ad Hoc Networks](https://reader033.fdocuments.us/reader033/viewer/2022050907/55720f5c497959fc0b8c90f0/html5/thumbnails/45.jpg)
CLIENT3’s NETWORK DETAILS
![Page 46: Caching Strategies Based on Information Density Estimation in Wireless Ad Hoc Networks](https://reader033.fdocuments.us/reader033/viewer/2022050907/55720f5c497959fc0b8c90f0/html5/thumbnails/46.jpg)
CLIENT1 UPDATED ITS NETWORK DETAILS
![Page 47: Caching Strategies Based on Information Density Estimation in Wireless Ad Hoc Networks](https://reader033.fdocuments.us/reader033/viewer/2022050907/55720f5c497959fc0b8c90f0/html5/thumbnails/47.jpg)
CLIENT2 UPDATED ITS NETWORK DETAILS
![Page 48: Caching Strategies Based on Information Density Estimation in Wireless Ad Hoc Networks](https://reader033.fdocuments.us/reader033/viewer/2022050907/55720f5c497959fc0b8c90f0/html5/thumbnails/48.jpg)
CLIENT1 WANTS TO SEND A MESSAGE TO CLIENT3
![Page 49: Caching Strategies Based on Information Density Estimation in Wireless Ad Hoc Networks](https://reader033.fdocuments.us/reader033/viewer/2022050907/55720f5c497959fc0b8c90f0/html5/thumbnails/49.jpg)
MESSAGE TRANSFERRED INFORMATION IS DISPLAYED IN CLIENT1’S TRANSACTIONS COLUMN
![Page 50: Caching Strategies Based on Information Density Estimation in Wireless Ad Hoc Networks](https://reader033.fdocuments.us/reader033/viewer/2022050907/55720f5c497959fc0b8c90f0/html5/thumbnails/50.jpg)
MESSAGE RECEIVED INFORMATION IS DISPLAYED IN CLIENT3’S TRANSACTIONS COLUMN
![Page 51: Caching Strategies Based on Information Density Estimation in Wireless Ad Hoc Networks](https://reader033.fdocuments.us/reader033/viewer/2022050907/55720f5c497959fc0b8c90f0/html5/thumbnails/51.jpg)
MESSAGE LOG IS CREATED WITH TIME STAMP DISPLAYING THE INFORMATION LIKE SOURCE ADDRESS, DESTINATION ADDRESS AND ALSO THE MESSAGE
![Page 52: Caching Strategies Based on Information Density Estimation in Wireless Ad Hoc Networks](https://reader033.fdocuments.us/reader033/viewer/2022050907/55720f5c497959fc0b8c90f0/html5/thumbnails/52.jpg)
Scope of the project
However, the solution that was proposed is based on the formation of an overlay network composed of “mediator” nodes, and it is only fitted to static connected networks with stable links among nodes. These assumptions, along with the significant communication overhead needed to elect “mediator” nodes, make this scheme unsuitable for the mobile environments that we address.