Probabilistic Routing Protocol for Intermittently Connected Networks

This document is a product of the Delay Tolerant Networking Research Group and has been reviewed by that group. No objections to its publication as an RFC were raised. This document defines PRoPHET, a Probabilistic Routing Protocol using History of Encounters and Transitivity. PRoPHET is a variant of the epidemic routing protocol for intermittently connected networks that operates by pruning the epidemic distribution tree to minimize resource usage while still attempting to achieve the best-case routing capabilities of epidemic routing. It is intended for use in sparse mesh networks where there is no guarantee that a fully connected path between the source and destination exists at any time, rendering traditional routing protocols unable to deliver messages between hosts. These networks are examples of networks where there is a disparity between the latency requirements of applications and the capabilities of the underlying network (networks often referred to as delay and disruption tolerant). The document presents an architectural overview followed by the protocol specification

Routing in Wireless Multimedia Home Networks

This paper describes an adapted version of the destination sequenced distance vector routing protocol (DSDV) which is suitable to calculate routes in a wireless real-time home network. The home network is based on a IEEE 802.11b ad hoc network and uses a scheduled token to enforce real-time behaviour to support multimedia streams. The multimedia network protocol works for both single-hop and multi-hop networks, however in the latter case special measures have to be taken to forward streams from node to node and to find routes. Existing routing protocols exhibit non-deterministic behaviour which may interfere with the correct streaming of multimedia. The proposed routing protocol does not rely on flooding, instead it piggy-backs the real-time token and behaves in a predictable manner. Simulation of the routing protocol shows that routes in the network are found in finite time

Enhanced Cluster Based Routing Protocol for MANETS

Mobile ad-hoc networks (MANETs) are a set of self organized wireless mobile nodes that works without any predefined infrastructure. For routing data in MANETs, the routing protocols relay on mobile wireless nodes. In general, any routing protocol performance suffers i) with resource constraints and ii) due to the mobility of the nodes. Due to existing routing challenges in MANETs clustering based protocols suffers frequently with cluster head failure problem, which degrades the cluster stability. This paper proposes, Enhanced CBRP, a schema to improve the cluster stability and in-turn improves the performance of traditional cluster based routing protocol (CBRP), by electing better cluster head using weighted clustering algorithm and considering some crucial routing challenges. Moreover, proposed protocol suggests a secondary cluster head for each cluster, to increase the stability of the cluster and implicitly the network infrastructure in case of sudden failure of cluster head.Comment: 6 page