DTN Routing in a Mobility Pattern Space

Routing in Delay Tolerant Networks (DTNs) benefits considerably if one can take advantage of knowledge concerning node mobility. The main contribution of this paper is the definition of a generic routing scheme for DTNs using a high-dimensional Euclidean space constructed upon nodes' mobility patterns. For example, nodes are represented as points having as coordinates their probability of being found in each possible location. We present simulation results indicating that such a scheme can be beneficial in a scenario inspired by studies done on real mobility traces. This work should open the way to further use of the virtual space formalism in DTN routing.Comment: 8 pages, preprin

Adaptive routing for intermittently connected mobile ad hoe networks

The vast majority of mobile ad hoc networking research makes a very large assumption: that communication can only take place between nodes that are simultaneously accessible within in the same connected cloud (i.e., that communication is synchronous). In reality, this assumption is likely to be a poor one, particularly for sparsely or irregularly populated environments.In this paper we present the Context-Aware Routing (CAR) algorithm. CAR is a novel approach to the provision of asynchronous communication in partially-connected mobile ad hoc networks, based on the intelligent placement of messages. We discuss the details of the algorithm, and then present simulation results demonstrating that it is possible for nodes to exploit context information in making local decisions that lead to good delivery ratios and latencies with small overheads.</p

CLUSTERING BASED ROUTING FOR DELAY- TOLERANT NETWORKS

ABSTRACT Delay-tolerant networking (DTN) is an approach to computer network Clustering significantly reduces the energy consumption of a cluster. In this paper, a cluster based routing protocol for Delay-Tolerant Mobile Networks (DTMNs) is used. Exponentially weighted moving average (EWMA) scheme is employed for on-line updating region contact probability, with its mean proven to converge to the true contact probability. The gateway nodes exchange network information and perform routing. It uses clustering&apos;s structure to decrease overhead, average end-to-end delay and improve the average packet delivery ratio

Evaluating Mobility Pattern Space Routing for DTNs

Because a delay tolerant network (DTN) can often be partitioned, the problem of routing is very challenging. However, routing benefits considerably if one can take advantage of knowledge concerning node mobility. This paper addresses this problem with a generic algorithm based on the use of a high-dimensional Euclidean space, that we call MobySpace, constructed upon nodes' mobility patterns. We provide here an analysis and the large scale evaluation of this routing scheme in the context of ambient networking by replaying real mobility traces. The specific MobySpace evaluated is based on the frequency of visit of nodes for each possible location. We show that the MobySpace can achieve good performance compared to that of the other algorithms we implemented, especially when we perform routing on the nodes that have a high connection time. We determine that the degree of homogeneity of mobility patterns of nodes has a high impact on routing. And finally, we study the ability of nodes to learn their own mobility patterns.Comment: IEEE INFOCOM 2006 preprin

Mobility entropy and message routing in community-structured delay tolerant networks

Many message routing schemes have been proposed in the context of delay tolerant networks (DTN) and intermittently connected mobile networks (ICMN). Those routing schemes are tested on specific environments that involve particular mobility complexity whether they are random-based or soci-ologically organized. We, in this paper, propose community structured environment (CSE) and mobility entropy to dis-cuss the effect of node mobility complexity on message rout-ing performance. We also propose potential-based entropy adaptive routing (PEAR) that adaptively carries messages over the change of mobility entropy. According to our simu-lation, PEAR has achieved high delivery rate on wide range of mobility entropy, while link-state routing has worked well only at small entropy scenarios and controlled replication-based routing only at large entropy environments

INFLUENCE OF STRUCTURAL DEVIATION IN A MICROSTRIP PATCH ANTENNA WITH 70 GHZ BAND

This paper describes the influence of structural deviation in a microstrip patch antenna on millimeter wave performance through the use of an electromagnetic field simulator. We divided the structural deviation into two deviations: uneven and tapered. The resonant frequency was shifted to low frequency region by the uneven structural deviation. We also found that the tapered structural deviation had a small effect on the resonant frequency, and the return loss was improved by the tapered structural deviation

Context aware Routing to Assist Routing Decisions for Quality Improvement in Multi Hop Ad hoc Networks

The context information is an intriguing aspect of decision making. The context-awareness can be useful in the ad hoc networks in which nodes are mobile, and the conditions are dynamic. In ad hoc networks, routing protocols are intended to discover the route over multi-hop wireless links under varying conditions. The context-awareness can assist the routing protocols in determining the appropriate path. This paper investigates into choosing the appropriate route by applying the context information and presents the approach to improve the decision making and the quality of the route. We consider nodes, connecting links, and different layers as the context. The paper introduces the scalability and flexibility in the set of parameters that govern the eminence of the node inter-connection that, in turn, influences the overall quality of the route. We propose the context-aware dynamic routing protocol (CADR) and present the approach, algorithm, and analysis. We simulate the protocol by taking the flexible combination of the context attributes and the values, also compares the performance with AODV. The simulation results show that the protocol chooses the appropriate route as per the considered attributes and weight, and provide the enhanced performanc

A Secure 3-Way Routing Protocols for Intermittently Connected Mobile Ad Hoc Networks

The mobile ad hoc network may be partially connected or it may be disconnected in nature and these forms of networks are termed intermittently connected mobile ad hoc network (ICMANET). The routing in such disconnected network is commonly an arduous task. Many routing protocols have been proposed for routing in ICMANET since decades. The routing techniques in existence for ICMANET are, namely, flooding, epidemic, probabilistic, copy case, spray and wait, and so forth. These techniques achieve an effective routing with minimum latency, higher delivery ratio, lesser overhead, and so forth. Though these techniques generate effective results, in this paper, we propose novel routing algorithms grounded on agent and cryptographic techniques, namely, location dissemination service (LoDiS) routing with agent AES, A-LoDiS with agent AES routing, and B-LoDiS with agent AES routing, ensuring optimal results with respect to various network routing parameters. The algorithm along with efficient routing ensures higher degree of security. The security level is cited testing with respect to possibility of malicious nodes into the network. This paper also aids, with the comparative results of proposed algorithms, for secure routing in ICMANET