Base Paper Title:
Caching Strategies Based on Information Density
Estimation in Wireless Ad Hoc Networks
(OR)
Our Proposed Title:
CACHING STRATEGIES IN MANET USING DSR AND AODV ROUTING PROTOCOLS
ABSTRACT:
We address cooperative caching in wireless networks, where the nodes may be mobile and exchange information in a peer-to-peer fashion. We consider both cases of nodes with large and small-sized caches. For large-sized caches, we devise a strategy where nodes, independent of each other, decide whether to cache some content and for how long. In the case of small-sized caches, we aim to design a content replacement strategy that allows nodes to successfully store newly received information while maintaining the good performance of the content distribution system. Under both conditions, each node takes decisions according to its perception of what nearby users may store in their caches and with the aim of differentiating its own cache content from the other nodes’. The result is the creation of content diversity within the nodes neighborhood so that a requesting user likely finds the desired information nearby. We simulate our caching algorithms in different ad hoc network scenarios and compare them with other caching schemes, showing that our solution succeeds in creating the desired content diversity, thus leading to a resource-efficient information access.
Objective:
Our 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. Another objective of this project is to propose AODV and DSR algorithm for the novel asymmetric cooperative cache approach and to evaluate the two proposed routing protocols namely, AODV and DSR, for wireless ad-hoc networks based on performance. This evaluation should be done theoretically and through simulation. Our objective also included the goal to generate a simulation environment that could be used as a platform for further studies within the area of ad-hoc networks.
EXISTING SYSTEM:
The 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 thus 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.
For highly popular content, peer-to-peer distribution can, indeed, remove bottlenecks by pushing the distribution from the core to the edge of the network.
Disadvantages of Existing System:
In the caching strategies based on information density estimation in Mobile Ad Hoc Networks (MANET), uses Flooding type Routing protocol, which faces several disadvantages.
· It is very wasteful in terms of the networks total bandwidth. While a message may only have one destination it has to be sent to every host. This increases the maximum load placed upon the network.
· Messages can also become duplicated in the network further increasing the load on the networks bandwidth as well as requiring an increase in processing complexity to disregard duplicate messages.
· A variant of flooding called selective flooding partially addresses these issues by only sending packets to routers in the same direction. In selective flooding the routers don't send every incoming packet on every line but only on those lines which are going approximately in the right direction.
PROPOSED SYSTEM:
In the proposed system, we address the issue of disadvantages faced in flooding routing protocol, using DSR and AODV protocol. The advantages of our proposed system are:
- Efficient caching strategies can be achieved using DSR and AODV protocol. Where our proposed system uses a reactive approach which eliminates the need to periodically flood the network with table update messages which are required in a table-driven approach. In a reactive (on-demand) approach such as this, a route is established only when it is required and hence the need to find routes to all other nodes in the network as required by the table-driven approach is eliminated. The intermediate nodes also utilize the route cache information efficiently to reduce the control overhead
- 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.
- We also show the simulation results of Basic Routing and Secured Routing. Where basic routing, routes between the nodes which are near by or by using the suitable protocol DSR or AODV. Whereas in secured routing, the routing is done through a cluster head, so the data is secured.
OVERALL ARCHITECTURE
SYSTEM MODULES:
ü Network Creation Module
ü Message Transfer Module
ü Route Maintenance Module
ü Cache Updating Module
ü Cache routing simulation module
MODULES DESCRIPTION:
Module 1: Network Creation Module
In the network Creation module, we design a virtual network which consists of Nodes N1, N2 and N3 and their Caches. In which, we address cooperative caching in wireless networks, where the nodes may be mobile and exchange information in a peer-to-peer fashion. Nodes N1, N2 and N3 are designed in such a way, that, each node can act as Active Node or In-active node, which inherits the property of wireless network where the nodes may be mobile. In this module, Cache also designed for each node by considering both cases of nodes with large and small-sized caches.
Module 2: Message Transfer Module
The Message transfer relates with that the sender node wants to send a message to the destination node after the path is selected and status of the destination node through is true. The receiver node receives the message completely and then it sends the acknowledgement to the sender node through the router nodes where it is received the message.
Module 3: Route Maintenance Module
Route Maintenance, the node forwarding a packet is responsible for confirming that the packet has been successfully received by the next hop. If no acknowledgement is received after the maximum number of retransmissions, the forwarding node sends a ROUTE ERROR to the source, indicating the broken link. Each node forwarding the ROUTE ERROR removes from its cache the routes containing the broken link
Module 4: Cache Updating Module
When a node detects a link failure, our goal is to notify all reachable nodes that have cached that link to update their caches. To achieve this goal, the node detecting a link failure needs to know which nodes have cached the broken link and needs to notify such nodes efficiently. Our solution is to keep track of topology propagation state in a distributed manner.
The algorithm starts either when a node detects a link failure or when it receives a notification.
In a cache table, a node not only stores routes but also maintain two types of information for each route: (1) how well routing information is synchronized among nodes on a route; and (2) which neighbor has learned which links through a ROUTE REPLY. Each node gathers such information during route discoveries and data transmission, without introducing additional overhead. The two types of information are sufficient; because each node knows for each cached link which neighbors have that link in their caches.
Module 5: Cache routing simulation module:
There are two routing protocol used:
- Ad-hoc On-demand Distance Vector (AODV) routing protocol
- Dynamic Source Routing (DSR)
The data server needs to measure the benefit of caching a data item on an intermediate node and use it to decide whether to cache the data. After an intermediate node (Ni) caches a data item, node (Ni) can serve later requests using the cached data, instead of forwarding the requests to the data server, saving the communication overhead between node(Ni) and the data center. However, caching data at node (Ni) increases the delay of returning the data to the current requester, because it adds extra processing delay at Ni, and the data reassembly at node (Ni) may affect possible pipelines.
System Requirements:
Hardware Requirements:
PROCESSOR : PENTIUM IV 2.6 GHz
RAM : 512 MB DD RAM
MONITOR : 15” COLOR
HARD DISK : 20 GB
FLOPPY DRIVE : 1.44 MB
CDDRIVE : LG 52X
KEYBOARD : STANDARD 102 KEYS
MOUSE : 3 BUTTONS
Software Requirements:
Front End : Java, JFC (Swing)
Backend : MS-Access (Data Base)
Tools Used : Eclipse 3.3
Operating System: Windows XP
REFERENCE:
Marco Fiore, Claudio Casetti, and Carla-Fabiana Chiasserini, “Caching Strategies based on information density estimation in Wireless Ad Hoc Networks”, IEEE Transactions on Vechicular Technology, Vol. 60, No.5, June 2011.
Caching Strategies Based on Information Density Estimation in Wireless Ad Hoc Networks
*******
Caching Strategies based on information density estimation in Wireless Ad Hoc Networks, 2011 IEEE projects, 2011 IEEE java projects, 2011 IEEE Dotnet projects, 2011 IEEE .net projects,IEEE Projects, IEEE Projects 2011,IEEE Academic Projects, IEEE 2011 Projects, IEEE, IEEE Projects Pondicherry,IEEE Software Projects, Latest IEEE Projects,IEEE Student Projects, IEEE Final year Student Projects,Final Year Projects, final year IEEE 2011 projects, final year 2011 projects,ENGINEERING PROJECTS, MCA projects, BE projects, Embedded Projects, JAVA projects, J2EE projects, .NET projects, Students projects,BE projects, B.Tech. projects, ME projects, M.Tech. projects, M.Phil Projects
