A virtual backbone based approach for cooperative caching in mobile ad hoc networks

Cache look up is an integral part of cooperative caching in ad hoc networks. In this paper, we discuss a cooperative caching architecture with a distributed cache look up protocol which relies on a virtual backbone for locating and accessing data within a cooperate cache. Our proposal consists of two phases: (i) formation of a virtual backbone and (ii) the cache look up phase. The nodes in a Connected Dominating Set (CDS) form the virtual backbone. The cache look up protocol makes use of the nodes in the virtual backbone for effective data dissemination and discovery. The idea in this scheme is to reduce the number of nodes involved in cache look up process, by constructing a CDS that contains a small number of nodes, still having full coverage of the network. We evaluated the effect of various parameter settings on the performance metrics such as message overhead, cache hit ratio and average query delay. Compared to the previous schemes the proposed scheme not only reduces message overhead, but also improves the cache hit ratio and reduces the average delay

A location aided cooperative caching protocol for mobile ad hoc networks

Cooperative caching is an attractive solution for reducing bandwidth demands and network latency in mobile ad hoc networks. Deploying caches in mobile nodes can reduce the overall traffic considerably. Cache hits eliminate the need to contact the data source frequently, which avoids additional network overhead. In this paper we propose a data discovery and cache management policy for cooperative caching, which reduces the caching overhead and delay by reducing the number of control messages flooded in to the network. A cache discovery process based on location of neighboring nodes is developed for this. The cache replacement policy we propose aims at increasing the cache hit ratio. The simulation results gives a promising result based on the metrics of studies

PEER TO PEER CACHE RESOLUTION MECHANISM FOR MOBILE AD HOC NETWORKS

In this paper we investigate the problem of cache resolution in a mobile peer to peer ad hoc network. In our vision cache resolution should satisfy the following requirements: (i) it should result in low message overhead and (ii) the information should be retrieved with minimum delay. In this paper, we show that these goals can be achieved by splitting the one hop neighbours in to two sets based on the transmission range. The proposed approach reduces the number of messages flooded in to the network to find the requested data. This scheme is fully distributed and comes at very low cost in terms of cache overhead. The experimental results gives a promising result based on the metrics of studies.

Modelling energy consumption of relay-enabled MAC protocols in ad hoc networks

To enhance the throughput of ad hoc networks, dual-hop relay-enabled transmission schemes have recently been proposed. Since in ad hoc networks throughput is normally related to their energy consumption, it is important to examine the impact of using relay-enabled transmissions on energy consumption. In this paper, we present an analytical energy consumption model for dual-hop relay-enabled medium access control (MAC) protocols. Based on the recently reported relay-enabled distributed coordination function (rDCF), we have shown the efficacy of the proposed analytical model. This is a generalized model and can be used to predict energy consumption in saturated relay-enabled ad hoc networks via energy decomposition. This is helpful in designing MAC protocols for cooperative communications and it is shown that using a relay results not only in a better throughput but also better energy efficiency.

Modeling energy consumption of dual-hop relay based MAC protocols in ad hoc networks

Given that the next and current generation networks will coexist for a considerable period of time, it is important to improve the performance of existing networks. One such improvement recently proposed is to enhance the throughput of ad hoc networks by using dual-hop relay-based transmission schemes. Since in ad hoc networks throughput is normally related to their energy consumption, it is important to examine the impact of using relay-based transmissions on energy consumption. In this paper, we present an analytical energy consumption model for dual-hop relay-based medium access control (MAC) protocols. Based on the recently reported relay-enabled Distributed Coordination Function (rDCF), we have shown the efficacy of the proposed analytical model. This is a generalized model and can be used to predict energy consumption in saturated relay-based ad hoc networks. This model can predict energy consumption in ideal environment and with transmission errors. It is shown that using a relay results in not only better throughput but also better energy efficiency. Copyright (C) 2009 Rizwan Ahmad et al.

A mesh based anycast routing protocol for ad hoc networks

Ad hoc networks became a hot topic recently, but the routing algorithm of anycast in the ad hoc networks has not yet been much explored. In this paper, we propose a mesh-based anycast routing algorithm (MARP) for ad hoc networks. The proposed routing model is robust and reliable, which can solve the unsteady topology problem in ad hoc networks. The future work is discussed at the end of this paper.

Prediction based location aided routing for mobile ad hoc networks

Routing in ad hoc networks faces significant challenges due to node mobility and dynamic network topology. In this work we propose the use of mobility prediction to reduce the search space required for route discovery. A method of mobility prediction making use of a sectorized cluster structure is described with the proposal of the Prediction based Location Aided Routing (P-LAR) protocol. Simulation study and analytical results of P-LAR find it to offer considerable saving in the amount of routing traffic generated during the route discovery phase.

Mobility prediction based routing for minimizing control overhead in mobile ad hoc networks

Routing in ad hoc networks faces significant challenges due to node mobility and dynamic network topology. In this work we propose the use of mobility prediction to reduce the search space required for route discovery. A method of mobility prediction making use of a sectorized cluster structure is described with the proposal of the Prediction based Location Aided routing (P-LAR) protocol. Simulation study and analytical results of the of P-LAR find it to offer considerable saving in the amount of routing traffic generated during the route discovery phase.

A review of current mobility prediction techniques for ad hoc networks

Next Generation Networks (3G & beyond) will support real-time multimedia applications through traditional wide-area networking concepts as well as hot-spot (WLAN) and ad hoc networking concepts. In order to fulfil the vision of Next Generation Networks a method of maintaining a real-time flow despite frequent topology changes and irregularity in user movement is required. Mobility Prediction has been identified as having applications in the areas of link availability estimation and pro-active routing in ad hoc networks. In this work we present an overview of current mobility prediction schemes that have been proposed. Simulation results are also presented.

Self adjusted security architecture for mobile ad hoc networks (MANETs)

In this work we present a novel security architecture for MANETs that merges the clustering and the threshold key management techniques. The proposed distributed authentication architecture reacts with the frequently changing topology of the network and enhances the process of assigning the node's public key. In the proposed architecture, the overall network is divided into clusters where the clusterheads (CH) are connected by virtual networks and share the private key of the Central Authority (CA) using Lagrange interpolation. Experimental results show that the proposed architecture reaches to almost 95.5% of all nodes within an ad-hoc network that are able to communicate securely, 9 times faster than other architectures, to attain the same results. Moreover, the solution is fully decentralized to operate in a large-scale mobile network.

Route maintenance using mobility prediction for mobile ad hoc networks

Next generation networks (3G & beyond) will support real-time multimedia applications through traditional wide-area networking concepts as well as hot-spot (WLAN) and ad hoc networking concepts. In order to fulfill the vision of next generation networks a method of maintaining a real-time flow despite frequent topology changes and irregularity in user movement is required. Mobility prediction has been identified as having applications in the areas of link availability estimation and pro-active routing in ad hoc networks. In this work we present the mobility prediction based algorithm for route maintenance in mobile ad hoc networks. Simulation study of the algorithm proves it to offer significant benefits to dynamic source routing (DSR)

Virtual backbone routing structures in wireless ad-hoc networks

In this paper we studied several virtual routing structures (ring, ring-tree, cord, and mesh) which are scalable, independent on addresses, based on local information and partial global information for routing packets. These virtual routing structures are built on the top of the backbone nodes which are selected by considering power, connections, and immobility metrics.Our experimental results on the ns2 simulator and both TelosBand MicaZ sensor nodes tested platform prove that the virtual backbone structures are superior to the existing routing schemes and the different virtual structures fit in with the different physical scenarios.

MAR : message-aware routing for opportunistic wireless ad hoc networks

In this paper we study the problem of routing in opportunistic wireless network, and propose a novel routing mechanism, message-aware routing (MAR). Using MAR, the messages can be prioritized at mobile nodes and the resources will be allocated accordingly. The MAR uses the message-aware socializing model to classify mobile nodes into different social groups. In MAR, nodes only maintain up-to-date routing information for the nodes in the same social group and the messages for the nodes in the same social group will have higher priority to be delivered. The MAR improves the routing efficiency in terms of reduced traffic and a higher delivery success rate. Further, MAR is constructed in decentralized way and does not require any centralized infrastructure. Experiments using NS2 simulator show that the MAR achieves higher delivery rate than the Epidemic and Prophet routing.

Multicast lifetime maximization using network coding in lossy wireless ad-hoc networks

In traditional stop-and-wait strategy for reliable communications, such as ARQ, retransmission for the packet loss problem would incur a great number of packet transmissions in lossy wireless ad-hoc networks. We study the reliable multicast lifetime maximization problem by alternatively exploring the random linear network coding in this paper. We formulate such problem as a min-max problem and propose a heuristic algorithm, called maximum lifetime tree (MLT), to build a multicast tree that maximizes the network lifetime. Simulation results show that the proposed algorithms can significantly increase the network lifetime when compared with the traditional algorithms under various distributions of error probability on lossy wireless links.