A wireless multi-hop network is a collection of wireless nodes that dynamically form a temporary network without an infrastructure.

                Operating on a frequency band occupying several on-overlapping channels, IEEE 802.11 is now widely used in Wireless Mesh Networks (WMNs). Many multi-channel MAC protocols are proposed to improve the spatial reuse in the network under the assumption that the transmissions on nonoverlappingchannels do not interfere with each other. Some joint routing and channel assignment algorithms are also designed to increase the network throughput based on the premise that wean switch between different channels freely. Although simulations show that great improvements on network throughput cane observed in both cases, two fundamental questions remain:(1) Can we really use multiple non-overlapping channels freely in wireless mesh networks? (2)
                  If we can, what will be the cost when we switch channels dynamically and frequently? In this paper, by conducting extensive experiments on our testbed, we attemptto answer these questions. We find that in spite of interferencebetween both overlapping and non-overlapping channels, we canstill use multi-channel in mesh networks under crtain conditions, but with care. We also show that the channel switching costis actually very significant in WMNs. We recommend not to switch the channels too frequently when designing the channel assignment algorithms and those channel assignment algorithms selecting one channel for each packet is not really beneficial.

System Requirement Specification:-
DOMAIN     : TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS
SOFTWARE : Operating System: windows xp, Platform: JAVA/J2EE, Protocal: MAC
HARDWARE : Processor: Pentium-IV Speed: 1.8 GHZ,RAM: 512 MB;HDD: 80 GB

                 Traditional trust management schemes developed for wired and wireless ad-hoc networks are not well suited for sensor networks due to their higher consumption of resources such as memory and power. In this work, we propose a new lightweight Group-based Trust Management Scheme (GTMS) for wireless sensor networks which employs clustering. Our approach reduces the cost of trust evaluation. Also, theoretical as well as simulation results show that our scheme demands less memory, energy and communication overheads as compared to the current state-of-the-art trust management schemes and it is more suitable for large-scale sensor networks. Furthermore, GTMS also enables us to detect
and prevent malicious, selfish and faulty nodes

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

                 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 totaldata 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.8 GHZ,RAM: 512 MB, HDD: 80 GB

               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 mny 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 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