Page 1

Poster Paper Proc. of Int. Colloquiums on Computer Electronics Electrical Mechanical and Civil 2011

A Comparative Study of Routing Protocols Used In Delay Tolerant Networks Rekha.K.S1,Shibu.K.R2, Gincy Abraham3 1

Viswajyothi College of Engineering and Technology, Dept of Computer Science, Kerala, India Email: 2 Viswajyothi College of Engineering and Technology, Dept of Computer Science, Kerala, India Email: krshibu 3 Viswajyothi College of Engineering and Technology, Dept of Computer Science, Kerala, India Email: abraham.gincy Abstract- This paper does a comparative study of different routing protocols used in Delay-Tolerant Networks (DTNs). The basic idea is to compare the different routing protocols and to find out the relative merits and demerits of each method. Protocols for DTN can be broadly classified in to data centric and cluster based. In data centric models every node plays similar role in routing. Cluster based routing protocols group mobile nodes with similar mobility pattern into a cluster, which can then interchangeably share their resources for overhead reduction and load balancing. The data centric models are relatively simple and easy to implement whereas the cluster based methods are more complex but relatively efficient. Figure 1. Routing Protocols in DTN

Index Terms - Delay-tolerant networks, data centric protocols,


Cluster based routing protocols

Some of the datacentric models discussed in this paper are Epidemic, Spray and wait, Message Ferrying, SWIM, CAR, PROPHET, MoVe and Moby Space. In data-centric routing, the sink sends queries to certain regions and waits for data from the sensors located in the selected regions. Since data is being requested through queries, attribute-based naming is necessary to specify the properties of data.

I. INTRODUCTION Delay-tolerant networking (DTN) is an approach to computer network architecture that seeks to address the technical issues in heterogeneous networks that may lack continuous network connectivity. The important characteristics of Delay Tolerant Networks include low data rate, disconnection, long queuing times, interoperability considerations etc. Most DTN protocols [1].–[8] are. “datacentric.”, where every node plays a similar role in routing. This architecture is simple and effective in small networks, but not scalable to large size DTNs. Clustering [12] has long been considered as an effective approach to reduce network overhead and improve scalability. The protocols in delay tolerant mobile networks are mainly classified into flat or data centric protocols and cluster based protocols. The important datacentric protocols include epidemic, spray and wait, ferrying, SWIM, context aware routing (CAR), MoVe [11], Mobyspace, PROPHET etc. The cluster based routing protocols in delay tolerant mobile networks are classified into deterministic and probabilistic. Cluster based protocol include Hierarchial Routing protocol (using multi level clustering) and clustering using different schemes such as exponentially weighted moving average(EWMA).A comparitive study of the different protocols in delay tolerant mobile networks is done in this paper.

A. Epidemic Routing In epidemic routing a message copy is forwarded to every node encountered. Epidemic routing in its simplest form will continue to exchange messages even well after the message is delivered to its destination. Xiaofeng Lu [13] proposes nepidemic routing protocol, an energy-efficient routing protocol for DTN. The n-epidemic routing protocol is based on the reasoning that in order to reach a large audiences with low number of transmissions, it is better to transmit only when the number of neighbors reaching a certain threshold. B. Spray and Wait Another flat protocol discussed is the Spray and Wait protocol. Here a new routing scheme that sprays a number of copies in to the network and then waits till one of these nodes meets the destination. The main design goals includes fewer transmissions, delivery delay close to optimal, scalable with respect to network size or node density, require low network knowledge [6]. C. Message Ferrying In message ferrying we use special mobile nodes (Ferry nodes) and designed trajectory for providing communication.

© 2011 ACEEE DOI: 02.CEMC.2011.01. 587


Poster Paper Proc. of Int. Colloquiums on Computer Electronics Electrical Mechanical and Civil 2011 The main idea behind the MF approach is to introduce non randomness in the movement of nodes and exploit such non randomness to help deliver data.[1]

then interchangeably share their possessions such as cache space for overhead diminution and load harmonizing aiming to achieve proficient routing. Clustering based methods can be broadly classified in to Probabilistic and deterministic models. A. Hierarchial Clustering It is a method of deterministic clustering in which the nodes in this network periodically switch on and then transmits the data of interest. Thus, they provide a picture of the pertinent parameters at regular intervals. They are well suited for applications requiring episodic data monitoring .All the nodes in the network are homogeneous and begin with the same initial energy and the BS however has a constant power supply and so, has no energy constraints. a) Intra Cluster Routing:- If Nodes i and j are in the identical cluster, they have elevated chance to meet each other, thus Node i will transmit the data message to Node j when they meet. b).Solitary Hop Inter Cluster Routing:- If they are not in the same cluster, node i look up gateway information to Node j’s cluster in its gateway table. If an entry is found, Node i send the data message to that gateway. Upon receiving the data message, the gateway will forward it to any node, e.g., Node k, in Node b’s cluster. Node b in turn delivers the data message to Node j via Intra-cluster Routing .

Figure 2 . Message Ferrying (Source W.Zhao, A Message Ferrying Approach for Data Delivery in Sparse Mobile Ad Hoc Networks)

D. Context Aware Routing (CAR) Context is defined as the set of attributes that describes the aspects of the system that can be used to optimize the process of message delivery. Each host uses local prediction of delivery probabilities between updates of information. The host sends the message to the host in the cloud that has the highest mobility. E. PROPHET Probabilistic Routing Protocol using History of Encounters and Transitivity (PROPHET) is another flat routing protocol used for intermittently connected networks. When two nodes meet, they exchange a delivery predictability vector containing the delivery predictability information for destinations known by the nodes. Also, they will update the probability between them.

Fig ure 5. Multihop inter cluster routing

The CCP of a Gateway comprises its cluster ID and a list of clusters to which it serves as gateway along with analogous contact probabilities. Such information can be readily obtained from the gateway table. Once a gateway node accumulates a sufficient set of CCP’s, it constructs a network graph. d) Disseminated clustering:- Each node learns unswerving contact probabilities to other nodes. It is not necessary that a node stores contact information of all other nodes in network. Since our purpose is to group all nodes with elevated pair-wise contact probabilities together, a node joins a cluster only if its couple incisive contact probabilities to all existing members are greater than average.

F. Motion Vector (MoVe) MoVe is another flat routing protocol used in delay tolerant mobile networks. The Motion vector (MoVe) scheme leverages the knowledge of relative velocities of a Mobile router and its neighboring nodes to predict the closest distance they are predicted to get to the destination. G. Limitations of Data Centric Protocols Almost all the data centric models suffer from problems of scalability. These methods generally give reasonable performance in small networks, where as when applied to large networks the performance drastically comes down. In addition the delivery performance is not good in large networks.

B. Clustering Using EWMA The routing protocol proposed by Ha Dang[12] is the first effort to investigate the clustering problem and cluster based routing in a non deterministic intermittent environment. The basic idea group mobile nodes with similar mobility pattern in to a cluster which can share their resources for overhead reduction and load balancing. An exponentially weighted moving average (EWAM) is used for updating nodal contact probability. Based on nodal contact probabilities a

III. CLUSTER BASED ROUTING PROTOCOLS Clustering is defined as the procedure of systematizing objects into group whose constituents are analogous in some way. The essential idea of clustering is to group numerous nodes with similar domain pattern into a cluster which can © 2011 ACEEE DOI: 02.CEMC.2011.01.587


Poster Paper Proc. of Int. Colloquiums on Computer Electronics Electrical Mechanical and Civil 2011 [5] J. LeBrun, C.-N. Chuah, and D. Ghosal, .”Knowledge based opportunistic forwarding in vehicular wireless ad hoc networks,.” in Proc. IEEE Vehicular Technology Conference (VTC) Spring, pp. 1.–5, 2005.Resource and Performance Tradeoffs in Delay Tolerant wireless Networks Tara Small & Zygmunt Haas [6] T. Spyropoulos, K. Psounis, and C. S. Raghavendra, .”Spray and wait: an efficient routing scheme for intermittently connected mobile networks,.”in Proc. ACM SIGCOMM Workshop on DTN and Related Topics,pp. 252.–259, 2005. [7] J. Leguay, T. Friedman, and V. Conan, .”DTN routing in a mobility pattern space,.” in Proc. WDTN .’05: 2005 ACM SIGCOMM Workshop on Delay-tolerant Networking, pp. 276.–283, 2005. [8] Utility based multipoint relay flooding in hetrogenous mobile Ad Hoc Networks – Lipmaman, Boustead [9] T. Small and Z. J. Haas, .”Resource and performance tradeoffs in delaytolerant wireless networks,.” in Proc. ACM SIGCOMM Workshop on Delay Tolerant Networking and Related Topics, pp. 260.–267, 2005. [10] Y. Wang and H. Wu, .”DFT-MSN: the delay fault tolerant mobile sensor network for pervasive information gathering,.” in Proc. 26th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM.’07), pp. 1235.–1243, 2006. [11] T. Spyropoulos, K. Psounis, and C. Raghavendra, .”Performance analysis of mobility-assisted routing,.” in Proc. MobiHoc .’06: 7th ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp. 49.–60, 2006. [12] Ha Dang, Hongyi Yu,”Clustering and Cluster Based Routing Protocol for Delay Tolerant Mobile Networks”, IEEE Transactions on Wireless Communications, Vol.9,No.6, June 2010. [13] Xiaofeng Lu; Pan Hui,An Energy-Efficient n-Epidemic Routing Protocol for Delay Tolerant Networks, Networking, Architecture and Storage (NAS), 2010 IEEE Fifth International Conference [14] E.Selvadivya,Greeta Priyadarshini, Proficient cluster-based routing protocol using EBSA And LEACH approaches, , Int. J. Comp. Tech. Appl., Vol 2 (2), 295-299

set of functions are devised for cluster formation and gateway selection. IV. CONCLUSIONS DTN routing appears to be a rich and challenging problem. In this paper we compared the different flat routing protocols and cluster based routing protocols in delay tolerant mobile networks. Data centric routing protocols have many disadvantages compared to cluster based routing protocols.

Cluster based routing protocols outperform data-centric routing protocols in terms of scalability and effectiveness. In this paper an attempt has been made to investigate different protocols in handling Delay tolerant Networks. The cluster based scheme manages to overcome many of the shortcomings of and improve routing performance in DTN. REFERENCES [1] W. Zhao, M. Ammar, and E. Zegura, .”A message ferrying approach for data delivery in sparse mobile ad hoc networks,.” in Proc. MobiHOC, pp. 187.– 198, 2004. [2] M. Musolesi, S. Hailes, and C. Mascolo, .”Adaptive routing for intermittently connected mobile ad hoc networks,.” in Proc. IEEE 6th International Symposium on a World of Wireless, Mobile and Multimedia Networks (WOWMOM), pp. 1.–7, 2005. [3] A. Lindgren, A. Doria, and O. Scheln, .”Probabilistic routing in intermittently connected networks,.” in Proc. First International Workshop on Service Assurance with Partial and Intermittent Resources, pp. 239.–254,2004. [4] K. Fall, .”A delay-tolerant network architecture for challenged Internets,.”in Proc. ACM SIGCOMM, pp. 27.–34, 2003.

© 2011 ACEEE DOI: 02.CEMC.2011.01. 587