Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology ISSN 2320–088X IJCSMC, Vol. 2, Issue. 3, March 2013, pg.83 – 88 SURVEY ARTICLE © 2013, IJCSMC All Rights Reserved 83 A Survey on Knowledge Based Classification of Different Routing Protocols in Delay Tolerant Networks Chintan B. Desai 1 , Vyomal N. Pandya 2 , Prof. Sarman K. Hadia 3 1 Charotar University of Science & Technology, Changa, Gujarat, India 2 C. K. Pithawalla College of Engineering & Technology, Surat, Gujarat, India 3 Charotar University of Science & Technology, Changa, Gujarat, India 1 chitudesai10@gmail.com; 2 vyomal.pandya@ckpcet.ac.in; 3 skhadia.ec@charusat.ac.in Abstract— Now a days, current wireless networks have provided a wide range of applications making it possible to successfully interconnect devices and systems, such as a mobile phone to a powerful server all around the world. Modern Internet protocols exhibits inefficient performance in those networks where the connectivity between end nodes has intermittent property due to dynamic topology such as Mobile Ad-hoc Networks (MANET) or Vehicular Ad-hoc Networks (VANET). The network environments where the nodes are characterized by opportunistic connectivity are referred to as Delay Tolerant Networks (DTNs). DTNs have been one of the growing areas of interest characterized by the significant amount of research efforts invested in this area over the past decade. Routing is one of the major issues affecting the overall performance of DTN networks in terms of resource consumption, data delivery and latency. Over the past few years a number of routing protocols have been proposed for DTN networks. This paper mainly focuses on classification and description of these routing protocols. Key Terms: - Delay Tolerant Network, Routing in DTNs, Deterministic Routing, Stochastic Routing. I. INTRODUCTION Delay Tolerant Network is also referred as the Intermittently Connected Mobile Network [1]. It is the wireless network in which at any given time instance, the probability that there is an end-to-end path from a source to destination is low. Since most of the nodes in a DTN are mobile, the connectivity of the network is maintained by nodes only when they come in to the transmission ranges of each other. If any node has data to send but it is not connected to another node, it stores the message until an appropriate communication opportunity arises. A communication opportunity between two nodes is called a contact in DTN's. Since DTN represents a large group of networks several different kinds of contact have been identified. A contact can be persistent i.e. the contact is always available, on-demand i.e. a contact can be initiated when needed, scheduled i.e. the contact and its characteristics is known in advance or opportunistic contacts, called opportunistic DTN. Generally, MANET routing protocols are built with the assumption that the network is dense enough so that it is fully connected i.e. that there always exists a path between every node in the network or that paths are down for a very short period of time. So, traditional routing protocols for MANETs do not work well for DTNs [2], since they try to discover a full path before sending any data. If no path between the sender and the destination exists, these protocols will not succeed to send any data. To overcome the problem with intermittent connectivity and partitions in the network, DTN routing protocols utilize the mobility of the nodes and buffering of messages, this makes is possible for a node to carry a message and in that Way Bridge partitions in the network. It is also known as store-carry-forward (SFC) [3]. When a