A wireless ad hoc network is a decentralized wireless network. The network is ad hoc because it does not rely on a preexisting infrastructure, such as routers in wired networks or access points in managed (infrastructure) wireless networks.

                 Data caching can significantly improve the efficiency of information access in a wireless ad hoc network by reducing the access latency and bandwidth usage. However, designing efficient distributed caching algorithms is non-trivial when network nodes have limited memory. In this article, we consider the cache placement problem of minimizing total data access cost in ad hocnetworks with multiple data items and nodes with limited memory capacity. The above optimization problem is known to be NP-hard. Defining benefit as the reduction in total access cost, we present a polynomial-time centralized approximation algorithm that provably delivers a solution whose benefit is at least one-fourth (one-half for uniform-size data items) of the optimal benefit. The approximation algorithm is amenable to localized distributed implementation, which is shown via simulations to perform close to the approximation algorithm. Our distributed algorithm naturally extends to networks with mobile nodes. We simulate our distributed algorithm using a network simulator (ns2), and demonstrate that it significantly outperforms another existing caching technique (by Yin and Cao [30]) in all important performance metrics. The performance differential is particularly large in more challenging scenarios, such as higher access frequency and smaller memory.

System Requirement Specification:-
DOMAIN      :  TRANSACTIONS ON MOBILE COMPUTING
SOFTWARE  :  Operating System: windows xp Platform: JAVA, Algorithm: Disatributed Greedy
                      algorithm
HARDWARE : Processor:Pentium-IV Speed: 1.8GHZ RAM: 512 MB HDD: 80GB

               Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are many real networks that follow this modal, for example, wildlife tracking sensor networks, Military networks, vehicular ad hoc networks, etc. In This context, conventional routing schemes fail, because they try to establish complete end-to-end paths, before any data is sent.
                To deal with such networks researchers have suggested to use flooding-based routing schemes. While flooding-based schemes have a high probability of delivery, they waste a lot of energy and suffer from severe contention which can significantly degrade their performance. Furthermore, proposed efforts tom reduce the overhead of flooding-based schemes have often been plagued by large delays. With this in mind, we introduce a new family of routing schemes that "spray" a few message copies into the network, and then route each copy independently towards the destination. We show that, if carefully designed, spray routing not only performs significantly fewer transmissions per message, but also has lower average delivery delays than existing schemes; furthermore, it is highly scalable and retains good performance under a large range of scenarios.
                 Finally, we use our theoretical framework proposed in our 2004 paper to analyze the performance of spry routing. We also use this theory to show how to choose the number of copies to be sprayed and how to optimally distribute these copies to relays

System Requirement Specification:-
DOMAIN       :  TRANSACTION ON NETWORKING
SOFTWARE  :  Operating System: Windows XP, Platform: DOTNET
HARDWARE  :  Processor: Pentium-IV, Speed: 1.8 GHZ RAM: 512 MB, HDD: 80 GB

                  In this paper we analyze three mechanisms for providing Endpoint Admission Control: virtual-queue making, random-early marking and tail drop. For each scheme, we analyze the probing duration necessary to guarantee the required QoS (Quality of Service) and achieve high link utilization. Our main conclusion is that very few probe packets have to be sent when early marking is used (eg: 5KB), whereas tail drop requires a large number of probe packets (eg: 1KB). Very few probe packets have to be sent when virtual queue marking is used, Virtual queue marking strategy is based on virtual queue, router maintain the state of a virtual queue, which correspond to a buffer of size B. Arriving packets are queued in the real queue but a counter which tracks of the content of the virtual queue is incremented by one for each arriving packet

System Requirement Specification:-
DOMAIN       : TRANSACTION ON NETWORKING SECURITY
SOFTWARE  :  Operating System: Windows XP , Platform: DOTNET
HARDWARE  :  Processor: Pentium-IV, Speed: 1.8 GHZ RAM: 512 MB, HDD: 80 GB

                In this paper, we address the issue of connecting MANETs to global IPv6 networks while supporting IPv6 mobility. Specifically, we propose a self-organizing, self-addressing, self-routing IPv6-enabled MANET infrastructure, referred to as IPv6-based MANET. The proposed self-organization addressing protocol automatically organizes nodes into tree architecture and configures their global IPv6 addresses.              We have implemented a prototype system to demonstrate the feasibility and efficiency of the IPv6-based MANET and the P2P information sharing system. Simulations are also conducted to show the efficiency of the proposed routing protocol and the P2P file sharing system

System Requirement Specification:-
DOMAIN     : AD-HOC NETWORK
SOFTWARE : Operating System: Windows xp, Platform: JAVA, Protocol: IPV6, Back end : MS Access
HARDWARE : Processor: Pentium-IV, Speed: 1.8 GHZ RAM: 512 MB, HDD: 80 GB

             Image compression usually considers the minimization of storage space as its main objective. It is desirable, however, to code images so that we have the ability to process the resulting representation directly. In this thesis we explore an approach to document image compression that is efficient in both space (storage requirement) and time (processing flexibility). Image processing allows you to modify the appearance of an image by applying various types of filters, scaling options or transformations. The simplest type of processing is linear scaling. With linear scaling, one pixel from the source image is multiplied by a scale fctor, and then an offset term is added. The original pixel value is then replaced with the resulting value. This process is repeated on each pixel in the image. Images account for a significant and growing fraction of Web downloads. The traditional approach to transporting images uses TCP, which provides a generic reliable, in-order byte-stream abstraction, but which is overly restrictive for image data. We analyze the progression of image quality at the receiver with time and show that the in-order delivery abstraction provided by a TCP-based approach prevents the receiver application from processing and rendering portions of an image when they actually arrive. The end result is that an image is rendered in bursts interspersed with long idle times rather than smoothly.

System Requirement Specification:-
DOMAIN        : Image Processing
SOFTWARE : Operating System: windows xp Platform: JAVA
HARDWARE : Processor: Pentium-IV Speed: 1.8 GHZ RAM: 512 MB HDD: 80 GB

              A mobile ad hoc network consists of wireless hosts that may move often.Movement of hosts results in a change in routes,requiring some mechanism for determining new routes.Several routing protocols have already been proposed for ad hoc networks. The paper suggests an approach to utilize location information(for instance,obtained using the global positioning System)to improve performance of routing protocol for ad hoc networks. By using location information.the proposed location-Aided Routing (LAR) protocols limit the search for a new route to a smaller �reguest zone� of the ad hoc network.This results in a significant reduction in the number of routing messages. We present two algorithms to determine the request zone,and suggest potential optimizations to our algorithms.

System Requirement Specification:-
DOMAIN     : AD-HOC NETWORK
SOFTWARE : Operating System: windows xp,Platform: JAVA,Protocol: IPV6,Back End: Ms-access
HARDWARE : Processor: Pentium-IV, Speed: 1.8 GHZ ,RAM: 512 MB , HDD: 80 GB

                  The Ad-Hoc network path is a peer-peer connection between the systems .In our project the java application is connected through the Ad-Hoc network and the protocol used in these systems is 802.11b.The network path of these connection used in the network layer here the networking connections are made through the java Programming language these language is most suitable for these kind of connectivity of network layer. And here using the name of protocol is UDP (user data gram protocol) data gram. By using this network path providing the direct connection between the units and also the accessing Zone. This network path is providing only on the demand time. Otherwise the application path can�t access it.
Modules                                                                                                                                                                                                          Instance messages, FTP

System Requirement Specification:-
DOMAIN      : AD-HOC NETWORK
SOFTWARE : Operating System: windows xp, Platform: JAVA
HARDWARE : Processor: Pentium-IV Speed: 1.8 GHZ RAM: 512 MB HDD: 80 GB

                 An ad-hoc mobile network is a collection of mobile nodes that are dynamically and arbitrarily located in such a manner that the interconnections between nodes are capable of changing on a continual basis. The primary goal of such an ad-hoc network routing protocol is correct and efficient route establishment between a pair of nodes so that messages may be delivered in a timely manner. Multicasting is to send single copy of a packet to all of those of clients that requested it, and not to send multiple copies of a packet over the same portion of the network, nor to send packets to clients who don�t want it.                           The Adhoc Multicast Routing Protocol (AMRoute) presents a novel approach for robust IP Multicast in mobile ad-hoc networks by exploiting user-multicast trees and dynamic logical cores. It creates a bi-directional, shared tree for data distribution using only group senders and receivers as tree nodes. Unicast tunnels are used as tree links to connect neighbors on the User-multicast tree. Thus AMRoute does not need to be supported by network nodes that are not interested/capable of multicast, and group State Cost is incurred only by group senders and receivers. Also, the use of tunnels as tree links implies that tree structure does not need to change even in case of a dynamic network topology, which reduces the signaling traffic and packet loss. Thus AMRoute does not need to track network dynamics; the underlying Unicast protocol is solely responsible for this function.
AMRoute does not require a specific Unicast routing protocol; therefore, it can operate seamlessly over separate domains with different Unicast protocols. We have tried to overcome the transient loops in the mesh creation. Also we have implemented the Dynamic core migration technique by using a timer which periodically changes the current core node, so that the efficiency of the protocol can be improved.

System Requirement Specification:-
DOMAIN      : WIRELESS NETWORKING
SOFTWARE : Operating System: windows xp, Platform: JAVA, Algorithm: SHA
HARDWARE : Processor: Pentium-IV, Speed: 1.8 GHZ , RAM: 512 MB, HDD: 80 GB

             To create router application for a wireless sensor network to transmit the data secure and quick. The network manager should monitor all the towers whether they are in active.
� It should find the shortest path in the network so that the data reaches the destination from source faster without any fault.
� If any fault occurs in that path through which the data are passing, then the router should select the next shorter path through which data must disseminate.
� All the towers (i.e. Nodes) in the network should share the information about the status of the towers.
              In a larger sensor network transmission of data will be less in accuracy, the data packets gets last due to the fault occur in that network sensor nodes. This may happens due the electronic circuits or other malfunction. To overcome these defect we have to implement the High Resilient routing technique in which the data packets will be sent from source to destination in save and secure manner.
Modules � Client module � Server modules � Network Manager
The server module contains three sub modules. They are
        1. Source and Sink
        2. Network manager
        3. Towers

System Requirement Specification:-
DOMAIN      : NETWORKING SECURITY
SOFTWARE : Operating System: windows xp, Platform: JAVA
HARDWARE : Processor: Pentium-IV Speed: 1.8 GHZ RAM: 512 MB HDD: 80 GB