Comparative Study of Selected Proactive Routing Protocols in MANET

Size: px
Start display at page:

Download "Comparative Study of Selected Proactive Routing Protocols in MANET"

Transcription

1 Comparative Study of Selected Proactive Routing Protocols in MANET Bodhy Krishna S Research Scholar, Dept. of Computer Science, Sree Narayana Guru College, Bharathiar University, Coimbatore, India Dr. C. Chandrasekar Asst. Professor, Department of Computer Science, Sree Narayana Guru College, Coimbatore, India Abstract----Ad hoc network is a collection of wireless mobile nodes without any fixed infrastructure. Mobile ad-hoc network (MANET) is a sub class of ad-hoc network and it dynamically forms a temporary network without any support of central administration. The network is ad hoc because it does not rely on any pre-existing network infrastructure like routers in wired networks. Such networks have no fixed topology due to the high degree of node mobility. Node mobility may cause the routes change. Hence, routing in MANET is a critical task due to its highly dynamic environment. To accomplish this task, a variety of routing algorithms have been proposed and also the number remains increasing day by day. These protocols fall in to mainly three categories---proactive, Reactive and Hybrid. But, it is difficult to determine which protocol performs best under a number of different scenarios. Hence, this paper presents review and a comparison of the typical representatives of proactive routing protocols designed for MANETs by presenting their characteristics, advantages and limitations. Keywords: MANET, Proactive routing protocols, DSDV, OLSR, CGSR, Comparative study. I. INTRODUCTION Wireless networks have become increasingly popular in the computing industry since their emergence in 1970s.It allows users to access information and services electronically, irrespective of their geographic location. But now, there is increasing demand for connectivity in situations/places where there is no base station / infrastructure available. This is where ad hoc network came into existence. Wireless networks can be classified into infrastructure networks and infrastructure less networks or mobile ad hoc networks (MANETs). A MANET is a collection of mobile nodes that can communicate with each other without the use of predefined infrastructure or centralized administration [1]. Today, MANETs have been widely adopted in many applications which include students using laptop to participate in an interactive lecture, business associates sharing information during a conference, search & rescue operations etc. Recently, Mobile Ad-hoc networks have become a hot research topic among researchers due to their flexibility and independence of network infrastructures such as base stations. The infrastructure less and the dynamic nature of these networks demand new set of networking strategies to be implemented in order to provide efficient communication. MANETs can be deployed quickly at a very low cost and can be easily managed. In the future, there will be more and more ad-hoc networks, in which routing is one of the critical issues. In a MANET, each mobile node acts as a router as well as a node. As these nodes may be mobile, entering and leaving the network, the topology of the network will change continuously. Mobility and the absence of any fixed infrastructure make routing in MANET, as one of the most challenging task. Routing in networking is the process of selecting paths in a network to send network packets. For this, there are several routing protocols already available. But, a heavy computational burden on mobile computers makes the use of conventional routing protocols inconvenient in a dynamic network [2]. So, a number of routing protocols have been developed which seamlessly adapt to changing network topology. These routing protocols can be divided into three categories: proactive (table driven routing protocols), reactive (on-demand routing protocols), and hybrid. The classifications of Routing Protocols are given below: A.Proactive Protocols (Table-driven) In networks using proactive routing protocol, every node builds and maintains routing information to all other nodes, so that when a packet needs to be forwarded the route is already known and can be immediately used. The route information is maintained in the routing tables and is updated regularly in order to maintain up-to-date routing information. For this, topology information needs to be exchanged between the nodes on a regular basis, leading to a high overhead on the network. One of the main advantages is that the routes will always be available on request. Examples are Destination-Sequence Distance Vector routing (DSDV), Optimized Link-State Routing(OLSR), Clusterhead Gateway Switch Routing(CGSR) etc. B.Reactive Protocols (On-demand) Reactive routing protocols do not make the nodes initiate a route discovery process until a route to a destination is required. That is, routes are discovered on demand and aren t famous before hand as in proactive protocols. A node wishing to communicate with another node first seeks 1042

2 for a route in its routing table. If it finds one, the communication starts immediately, otherwise the node initiates a route discovery phase. Once a Route has been established, it is maintained until either the destination becomes inaccessible, or until the route is no longer used, or expired. This leads to higher latency than with proactive protocols, but the overhead of maintaining routing table is reduced. Examples are Ad-Hoc On-demand Distance Vector (AODV), Dynamic Source Routing (DSR) etc. C.Hybrid Protocols These types of protocols combine proactive and reactive protocols to try and exploit their strengths. It was proposed to reduce the control overhead of proactive routing protocols and also decrease the latency caused by route discovery in reactive routing protocols. Routing is initially established with some of the proactively prospected routes and then serves the demand from additionally activated nodes through reactive flooding. Examples are Zone Routing Protocol (ZRP), Sharp Hybrid Adaptive Routing Protocol (SHARP) etc. Until now, many researchers performed valuable research with reference to routing in MANETs. In this paper we present the review and comparison of selected proactive protocols--- DSDV, OLSR and CGSR. The rest of the article is organized as follows. Section II discusses proactive routing protocols in detail with special reference to DSDV, OLSR and CGSR. Their advantages and disadvantages are also pointed out. Section III focuses on the comparative study of these routing protocols. Lastly, section IV concludes the article. II. PROACTIVE ROUTING PROTOCOLS Proactive protocols are known as proactive since they maintain the routing information before it is needed. Every node in the network maintains routing information about how to reach every other node in the network. It continuously evaluates all the routes within a network regardless of whether or not it is needed. That is, the protocol maintains fresh lists of destinations and their routes by periodically distributing routing tables throughout the network. So that when a packet needs to be forwarded, a route is already known and can be used soon. Once the routing tables are setup, then data transmissions will be as fast and easy as in the traditional wired networks. Unfortunately, it is a big overhead to maintain routing tables in the mobile ad hoc network environment. Proactive protocols produce higher routing efficiency than reactive protocols in the network with scattered traffic. But proactive protocols use more bandwidth and resources like battery power, than reactive protocols. Thus, the proactive protocols cannot be used in resource critical solutions. There are various existing proactive routing protocols. The routing protocols that are compared in this paper are DSDV, OLSR and CGSR. A. Destination-Sequence Distance Vector (DSDV) routing protocol DSDV (Destination-Sequence Distance Vector) [3], [4] is a predictably performing routing protocol designed by Charles E. Perkins and Pravin Bhagwat. It is a table-driven, unicast MANET routing protocol. This protocol is based on Bellman-Ford algorithm [5]. The improvements made to the Bellman-Ford algorithm include freedom from loops in routing tables. Every mobile node in the network maintains a routing table. It contains the list of all possible destinations in that network. An entry in the table stores the destination address, the next hop towards the destination, the cost metric for the routing path to the destination in terms of hop count and a destination sequence number created by the destination node. The sequence numbers enable the mobile nodes to distinguish stale routes from new ones, so that routing loops can be avoided. Preference is given to the route with the greater sequence number. Routing table updates are periodically transmitted throughout the network in order to maintain updated information in the table. These route updates can be either time-driven or event-driven. In time -driven, every node periodically transmits updates including its routing information to its immediate neighbors. But in eventdriven, a node propagates its changed routing table since the last update in an event-triggered style. In DSDV there are two ways for sending routing table updates. One is known as full dump and it carries full routing information during the update. So, it requires many packets. During periods of infrequent movement, these packets are transmitted occasionally. The other, known as incremental packets are used to transmit only that information which has changed since the last full dump. Incremental packets may fit in one packet. The mobile nodes maintain an additional table where they store the data sent in the incremental routing information packets. 1)Advantages Efficient protocol for route discovery. Whenever a route to a new destination is required, it already exists at the source. Hence, latency for route discovery is very low. DSDV also guarantees loop-free paths. Count to infinity problem is reduced. It is quite suitable for creating ad-hoc networks with small number of nodes. Freshness of routing information available in the routing table is ensured by the Sequence number. Usage of incremental updates instead of full dumps avoids extra traffic. The amount of space in routing table is reduced as DSDV maintains only the best path or shortest path to every destination. 1043

3 2)Limitations DSDV requires large amount of overhead due to the requirement of periodic routing table update messages. This may generate high volume of traffic for highdensity and highly mobile networks which makes them in-effective in large networks. Regular update of its routing tables, uses up battery power and a small amount of bandwidth even when the network is idle. Wastage of bandwidth takes place due to needless advertising of routing information even if there is no change in the network topology. Whenever the topology of the network changes, a new sequence number is necessary before the network reconverges which again makes DSDV not suitable for highly dynamic or large scale networks. It doesn t support multi path routing. There is no commercial implementation of this algorithm B.Optimized Link State Routing (OLSR) Protocol The Optimized Link State Routing (OLSR) protocol [6] is a modification of original Link State routing and it was modified for improved operation in ad hoc networks. But, it can also be used in other wireless networks. It is a proactive and non-uniform link state routing approach. In the original Link State algorithm, each node broadcasts its link state information to all other nodes in the network. But in OLSR only fewer nodes re-broadcast link state information there by reducing the overhead. The main feature of OLSR is its use of multipoint relays (MPRs) to reduce the overhead of network floods. The MPR set for a given node is the set of neighbours that covers the two-hop neighbourhood of the node. We could also say that MPR of a node N is the minimal set of N s one-hop neighbors such that each of N s two-hop neighbors has at least one of N s multipoint relays as its one-hop neighbor. An illustration of multipoint relays is shown in figure 1. When a node broadcasts a message, all of its neighbours will receive the message. But, only those nodes in its MPR set which have not seen the message before rebroadcast the message. Other neighbours process the message but not rebroadcast it. Therefore, the overhead for message flooding can be greatly reduced. Node selects their MPR independently from its set of neighbours in different ways. One is through the periodic exchange of Hello messages. Each node periodically transmits a list of neighbours within a Hello message. An attribute including the directionality of the link to a neighbor is associated with each neighbour. The node is labeled symmetric if the link to the neighbour is bidirectional, or asymmetric if a Hello has been received from that node but the link has not been confirmed as bidirectional. A node obtains complete knowledge of its two-hop neighbour set at that point of time when a node receives this Hello message from each of its neighbours. Further, it knows the link with that neighbour is bidirectional if its own address is listed in the Hello message. Then the status of that neighbour can be updated to be symmetric. OLSR may use an extraction algorithm for MPR selection [7] which is as follows. Each node starts with an empty MPR set. The N is defined to be the set of one-hop neighbours with which there exists bidirectional connectivity and the set of N2 is the set of two-hop bidirectional neighbours. The first nodes that are selected for the MPR set are those nodes in N that are the only neighbours of some node in N2. Next, the degree of each node n in N that is not in the MPR set is calculated., where the degree is the number of nodes in N2 that are not covered by nodes in the MPR set, the node in N that has the highest degree is included in the MPR set. Once all the nodes in N2 are covered, the process terminates. Routing path within the network can be determined when each node s MPR set is selected. Each node maintains a route to every other node in the network as OLSR is a proactive protocol. Nodes periodically exchange topology control (TC) messages with their neighbours to diffuse topology information. The TC message for a given node only lists its connections to those neighbours that have selected it as an MPR. Those neighbours are called MPR Selectors. Only this set of nodes is advertised within the network. The link state update is sent whenever a change of the MPR set has been detected. The period of link state exchange is set to a minimum value if the MPR set has been changed. If the MPR set remains stable, the period is increased until it reaches a refresh interval value. Each node obtains network topology information and constructs its routing table through link state messages. Only MPRs are included as intermediate nodes in routes used in OLSR. Fig. 1: An illustration of Multipoint relays 1)Advantages Routes are immediately available when needed due to its proactive nature. Has less average end to end delay. Implementation is more user-friendly. Does not need central administrative system to handle its routing process. The rapid change of the source and destination pairs makes it more suitable for ad hoc networks. Does not require that the link is reliable for the control messages, since the messages are sent periodically and the delivery does not have to be sequential. Its simplicity in using interfaces makes it easy to integrate the routing protocol in the existing operating 1044

4 systems without changing the format of the header of the IP messages. The protocol only interacts with the host s routing table. This protocol is well suited for applications which do not allow the long delays in the transmission of the data packets. Flooding is minimized by the use of MPRs OLSR s best working environment is a dense network where most of the communications is concentrated between a large number of nodes. OLSR has also extensions to allow for hosts to have multiple OLSR interface addresses and provide the external routing information giving the possibility for routing to the external addresses. It immediately knows the status of the link and it is possible to extend the quality of service (QoS) information to such protocol so that the hosts know in advance the quality of the route. Timeout values and validity information is contained within the messages conveying information allowing for different timer values to be used at differing nodes. 2)Limitations Needs more time re-discovering a broken link. Wider delay distribution. Requires more processing power when discovering an alternate route. The path that OLSR provides is not necessarily the shortest path, because every route involves forwarding through a MPR node. Has routing delays and bandwidth overhead at the MPR nodes as they act as localized forwarding routers. OLSR does not include any provisions for sensing of link quality; it simply assumes that a link is up if a number of Hello packets have been received recently. Being a proactive protocol, OLSR uses power and network resources in order to propagate data about possibly unused routes. OLSR requires a reasonably large amount of bandwidth and CPU power to compute optimal paths in the network. Maintain information about routes that may never be used, hence wasting possibly scarce resources. C. The Clusterhead Gateway Switch Routing (CGSR) The Clusterhead Gateway Switch Routing (CGSR) [8] is a hierarchical routing protocol which is similar to DSDV. It differs from the previous protocols in the type of addressing and network organization scheme employed. It uses a hierarchical network topology, unlike other table driven approaches that employ flat topologies [9]. CGSR is a clustered multihop mobile wireless network with several heuristic routing schemes. The cluster structure improves performance of the routing protocol because it provides effective membership and traffic management. Cluster construction and clusterhead selection algorithms are important components of cluster based routing protocols. In cluster construction, mobile nodes are aggregated into clusters and a special node termed cluster-head is elected for each cluster which coordinates the members of the cluster. To elect a node as the cluster head a cluster head selection algorithm is used within the cluster. The problem of having a cluster head scheme is that changing of the cluster heads frequently can adversely affect routing protocol performance as nodes are busy in cluster head selection instead of packet relaying. So, a Least Cluster Change (LCC) clustering algorithm is introduced to improve the performance of CGSR. Using LCC, cluster heads only change when two cluster heads come into contact, or when a node moves out of contact of all other cluster heads [10]. When a node as cluster head comes under the range of another cluster head, a tie is broken either using lowest ID or highest connectivity algorithm [9]. All member nodes of a cluster can be reached by the cluster head within a single hop, thereby enabling the cluster head to provide improved coordination among nodes that fall under its cluster [10]. CGSR modifies DSDV by using hierarchical clusterhead-to-gateway routing approach to route traffic from source to destination. Gateway nodes are nodes that are within communication range of two or more cluster heads. These gateway nodes are responsible for communication between the cluster heads. A packet sent by a node is first routed to its cluster head, and then the packet is routed from the cluster head to a gateway to another cluster head, and so on until the cluster head of the destination node is reached. The packet is then transmitted to the destination. In this method, each node must keep a cluster member table where it stores the destination cluster head for each mobile node in the network. These cluster member tables are broadcast by each node periodically using the DSDV algorithm. After receiving broadcasts from other nodes, a node updates its cluster member table. Along with this table, each node must also maintain a routing table which is used to determine the next hop in order to reach the destination. In CGSR, when forwarding a packet, a node first checks both these tables and tries to find the nearest cluster-head along the routing path to the destination. Next, the node will check its routing table to determine the next hop used to reach the selected cluster head. It then transmits the packet to this node. The route traffic follows: SourceClusterheadGatewayClusterhead. Destination. Figure 2 shows an example of this routing scheme [10].In this; the source (node 1) transmits the packet to its cluster-head (node 2). From the cluster-head, the packet is sent to the gateway node (node 3) that is connected to this cluster-head and the next cluster-head (node 4).Node 4 then sends the packet to the gateway node (node 6) which sends the packet to the next cluster-head (node 7), i.e. the destination cluster-head. The destination cluster-head then transmits the packet to the destination (node 8). 1045

5 Movement or death of mobile node may lead to the reelection of a new cluster head which may cause reelections in the whole of the cluster structure. This may cause the performance degradation of the upper layer protocols. Fig. 2: CGSR Routing Scheme 1)Advantages By having a cluster head controlling a group of ad hoc nodes, a framework for code separation (among clusters), channel access, routing, and bandwidth allocation can be achieved. Better bandwidth utilization reduces the size of distance vector table because the routing is performed only over cluster head. Performance of this protocol is high in comparison to other routing protocols. Reduces communication and control overheads due to predetermined paths of communication through cluster heads. Increases the network lifetime. Decreases transmission overhead by updating the routing tables after topological changes occur.[11] It helps to aggregate topology information as the nodes of a cluster are smaller when compared to the nodes of entire network. Here each node stores only a fraction of the total network routing information. Saves energy and communication bandwidth in ad-hoc networks.[12] In case of a route failure the entire route doesn t need to be recalculated. Only the part of the route in the sector where the route has been broken needs to be recalculated. 2)Limitations More time is spent in selection of cluster heads and gateways. If the mobile node uses CDMA/TDMA then it can take some time to get permission to send packets. Changes in the cluster-head may result in multiple path breaks. Construction and maintenance of cluster structure requires additional costs as compared to a topology control without cluster. Power consumption of nodes like cluster heads and gateways are high as they manage and forward all messages of the local cluster. This may cause ultimate shutdown of nodes.[13] As the network topology changes, a number of information message exchange is required which consumes a lot of network bandwidth and energy in mobile nodes. III. COMPARATIVE STUDY Having discussed the operations and characteristics of three of the existing table-driven routing protocols, it is important to have a comparative study. Routing is an essential component of communication protocols in mobile ad hoc networks. The design of the protocols are driven by specific goals and requirements based on respective assumptions about the network properties or application area. This section provides comparative analysis between routing protocols described in the previous section. The protocols are compared based on some important parameters in table 1. Time complexity is defined as the number of steps needed to perform a protocol operation, and communication complexity is the number of messages needed to perform a protocol operation. Storage complexity is the amount of space needed to perform protocol operations [14], [15]. Note that the performance metrics represent the worst case scenario of each routing protocol. Control traffic overhead and loop-free properties are two important issues with proactive routing protocols in MANETs. DSDV is a typical proactive distance-vector routing protocol in which each node holds a routing table including the next-hop information for each possible destination. CGSR is also a distance-vector routing protocol as it is based on DSDV. It is also a cluster based routing protocol and routing in CGSR occurs over cluster-heads and gateways. In this, every node keeps routing information for other nodes in both the cluster member table and the routing table. OLSR protocol, on the other hand is a modification of original Link State routing in which only fewer nodes (MPRs) re-broadcast link state information there by reducing the overhead. It is a core-node based routing protocol in which the routing table is based on the information contained in the local link information base and the topology set. Thus, each node has a routing table, neighbor table and a topology table. In this, the core-node extraction method is a key component. In CGSR, because routing performance is dependent on the status of specific nodes (cluster head, gateway, or normal nodes), time complexity of a link failure associated with a cluster head is higher than DSDV, given the additional time needed to perform cluster head reselection. Similarly, this applies to the case of link additions associated with the cluster head. There is no gateway selection in CGSR since each node declares it is a gateway node to its neighbors if it is responding to multiple radio codes. If a gateway node moves out of range, the routing protocol is responsible for routing the packet to another gateway. In terms of communication complexity, DSDV, OLSR and CGSR have the same degree of complexity during link failures and additions. When storage complexity is considered, all the three have different complexities among which that of OLSR is 1046

6 the highest. The storage complexity of the OLSR protocol is related on how much hosts are in the network. It is because the OLSR has to have all possible routes in Routing Table. In the addition, the OLSR must keep the topology information in the topology set, MPR information in MPR selector set and also update the state information about the links and neighbours [16]. The function for periodic maintainability of the routes consumes a lot of resources. In OLSR it is done by TC messages. The nodes in a MANET generally have a limited transmission range, so each node seeks the assistance of its neighboring nodes in forwarding packets. Thus data is sent between nodes by hopping through the intermediate nodes. So, all the three protocols have multi-hop forwarding strategy. And none of them have multicast capability. All the three protocols are loop free which utilizes destination sequence number to avoid route loops. DSDV and CGSR provide only one path to the destination and it will be the shortest path. But OLSR has multiple route support. Both periodic and triggered updates are utilized in DSDV. Therefore, their performance is tightly related with the network size and node mobility pattern. But in OLSR and CGSR only periodic updates are used. A study of performance evaluation on DSDV shows that DSDV is able to deliver virtually all data packets when each node moves with relatively low speed. However, when the mobility of each node increases, the speed at which the system converges to the correct path decreases [17]. One advantage of CGSR is that several heuristic methods can be employed to improve the protocol s performance. These methods include priority token scheduling, gateway code scheduling, and path reservation [18]. So the performance of the protocols is high in comparison to other routing protocols. OLSR reduce the control overhead forcing the MPR to propagate the updates of the link state, also the efficiency is gained compared to classical link state protocol when the selected MPR set is as small as possible. But the drawback of this is that it must maintain the routing table for all the possible routes, so there is no difference in small networks, but when the number of the mobile hosts increase, then the overhead from the control messages is also increasing. This constrains the scalability of the OLSR protocol. OLSR showed good performance with the constantly changing hosts, so that the network structure is always changing. OLSR has advantage in networks with high density and highly sporadic traffic. But their scalability is limited when network size increases. Another consideration is whether a flat or hierarchical addressing scheme should be used. Both DSDV and OLSR use a flat addressing scheme. But, CGSR uses hierarchical addressing scheme. Among the flat routed global routing the OLSR may scale well. The scalability in OLSR is achieved by reducing the number of rebroadcasting through the MPR mechanism. The MPR is used to elect only a number of neighbouring nodes for rebroadcasting the message. A downside to OLSR is that it must maintain information about routes that may never be used, hence wasting possibly scarce resources. The one great advantage of the OLSR protocol is that it immediately knows the status of the link and it is possibly to extend the quality of service information to such protocol so that the hosts know in advantage the quality of the route. Extending the OLSR protocol the quality of service feature will result additional latency and overhead. [19], [20].In addition, OLSR protocol also uses the Hello messages for maintaining the neighbour s status. During link additions, hello messages are used as a presence indicator in DSDV and OLSR, such that the routing table entry can be updated. But, this only affects neighboring nodes. But CGSR do not use hello messages. TABLE 1 CHARACTERISTIC COMPARISON OF DSDV, OLSR AND CGSR Parameter DSDV OLSR CGSR Basis of routing Typical Core-node Cluster based Proactive based Routing Uni-cast Broadcast Uni-cast Mechanism Forwarding Multi-hop Multi-hop Multi-hop Strategy Routing type Flat Flat Hierarchical Time complexity O(d) O(d) O(d) (link addition/failure) Communication O(N) O(N) O(N) complexity (link addition/failure) Storage O(N) O(N 2 ) O(2N) Complexity Overall High Low High Complexity Loop-free Yes Yes Yes Multicast No No No capability Tables required One Three (Routing, neighbour and Two(Cluster member table and routing table) topology tables) Frequency of Periodically Periodically Periodically update transmissions and as needed (Hybrid) Updates transmitted to Neighbours Neighbours Neighbours & Clusterheads Sequence nos. Yes Yes Yes Hello messages Yes Yes No Critical nodes No Yes(MPRs) Yes(Clusterhead) Routing Matrics Shortest Path Shortest Path Shortest Path QoS Support No Yes No Multiple route No Yes No support Security No No No Cluster Head & No No Yes Gateway Distributed Yes Yes Yes Uniformity Uniform Non uniform Non uniform Works most Small Dense Large networks efficiently in Networks networks ControlOverhead High Reduced Reduced Use of MPR No Yes No Protocol type Distance Vector Link-state Scalability Yes Yes(Limited when network size increases) Distance Vector No 1047

7 Abbreviations: N = Number of nodes in the network d = Network diameter All the three protocols do not specify any special security measurements, but there are recommendations how the security could be done. The protection of the network from the other hosts can be done by encrypting all messages with some public key cryptography. However, there were not any issues about denial of service attack, because it seems impossible task to implement in such networks. IV. CONCLUSION AND FUTURE WORK Mobile ad-hoc networks (MANETS) are expected to play an important role in the deployment of future wireless communication systems. The routing in ad-hoc networks is much more difficult than in conventional networks because of its dynamic topology and unpredictability in wireless links. The design of the routing protocols are driven by specific goals and requirements based on respective assumptions about the network properties or application area. Each protocol introduced in this paper has its own advantages and disadvantages in different MANET settings or environments. Therefore, it is hard to say which one is the best. The study suggests that not a single routing protocol is best suited for all scenarios of MANET. So, the choice of routing protocol should be done carefully according to the requirements of the specific application. In this paper, we performed a comprising survey and compare different proactive routing protocol using some parameters. The three proactive routing protocols taken in to consideration are DSDV, OLSR & CGSR and their core architecture is described. The basic actions related to these routing protocols are studied in detail. Also the advantages and disadvantages of the protocols based on their routing processes are pointed out. Each routing protocol has unique features. The comparison of the routing protocols indicates that the design of a secure ad hoc routing protocol constitutes a challenging research problem against the existing solutions. We also discussed some important characteristics of the three routing strategies (proactive, reactive and hybrid). DSDV, CGSR and OLSR have distinctive characteristics which makes the one better suited than the other one, depending on the situation. The OLSR protocol is more efficient in networks with high density and highly sporadic traffic. But the best situation is when between large numbers of hosts. It also has QoS support and their performance depends a lot from the network environment. DSDV works most efficiently in small networks as its control overhead is high. We have also seen the structure and the working of the cluster-based routing protocol. It is best suited for large networks. Cluster-based approaches on routing in mobile ad-hoc networks are good methods to decrease network traffic and routing overhead. The focus of the study in our future research work is to propose an extension of the existing conventional routing protocols which will be better in terms of security as none of the three protocols specify any special security measurements. ACKNOWLEDGEMENT Special thank and recognition goes to my guide, Assistant Professor. Dr. C. Chandrasekar, who advised, inspired and motivated me through this research. I would also like to thank Computer Science Department, Sree Narayana Guru College, Coimbatore and Bharathiar University for supporting this research. REFERENCES 1. C.Sivaram murthy, B.S.Manoj, Ad hoc wireless networks: Architectures, and protocols, Pearson Edu, Roberto Carlos Hincapi e, Blanca Alicia Correa, and Laura Ospina, Survey on Clustering Techniques for Mobile Ad Hoc Networks, pp C.Perkins,Praving Bhagwat, Highly dynamic destination sequenced distance vector Routing (DSDV) for Mobile computers. 4. Charles E. Perkins and Elizabeth M.Royer. Ad-hoc on-demand distance vector routing. Technical report, Sun Micro Systems Laboratories, Advanced Development Group, USA 5. R. Dube et al., "Signal Stability based Adaptive Routing (SA) for Ad- Hoc Mobile Networks," PerS. Commun., Feb. 1997, pp P. Jacquet, P. Muhlethaler, A. Qayyum, Optimized Link State Routing Protocol, Internet Draft, draft-ietf-manetolsr- 00.txt, November A. Laouiti, A.Qayyum, and L.Viennot, Multipoint Relaying; An Efficient Technique for Flooding in Mobile Wireless Networks, in Proceeedings of the 35th Annual Hawaii International Conference on System Science (HICSS 2002), Waikoloa, HI, January C.-C. Chiang, Routing in Clustered Multihop, Mobile Wireless Networks with Fading Channel, Proc. IEEE SICON 97, Apr. 1997, pp C.Siva Ram Murthy and B.S.Manoj, Ad-Hoc Wireless Networks: Architectures and Protocols, Pearson Education, ISBN , , May Elizabeth M. Royer and Chai-Keong Toh, A Review of Current Routing Protocols for Ad Hoc MobileWirelessNetworks, IEEE Personal Communication, April Roberto Carlos Hincapi e, Blanca Alicia Correa, and Laura Ospina, Survey on Clustering Techniques for Mobile Ad Hoc Networks, pp Naveen Chauhan, L. K. Awasthi, Narottam chand, Vivek Katiyar, and Ankit Chug, A Distributed Weighted Cluster Based Routing Protocol for Manets, World Academy of Science, Engineering and Technology 75,pp , R. Fallier and B. Scheers, Clustering in Mobile Ad-hoc Networks. 14. M. S. Corson and A. Ephremides, A Distributed Routing Algorithm for Mobile Wireless Networks, ACM/Baltzer Wireless Networks J., vol. 1, no. 1, Feb. 1995, pp C-K. Toh, Associativity-Based Routing for Ad-Hoc Mobile Networks, Wireless Pers. Commun., vol. 4,no. 2, Mar. 1997, pp Koey Huishan, Chua Huimin and Koh Yeow Nam Routing Protocols in Ad hocwireless Networks. National University of Singapore. 17. E. M. Royer and C. K. Toh, A review of current routing protocols for ad hoc mobile wireless networks,ieee Personal Communications Magazine, April 1999, pp C.-C. Chiang, Routing in Clustered Multihop, Mobile Wireless Networks with Fading Channel, Proc.IEEE SICON 97, Apr. 1997, pp Ying Ge, Thomas Kunz and Louise Lamont Quality of Service Routing in Ad-Hoc Networks Using OLSR. Proceeding of the 36th Hawaii International Conference on System Science(HICSS 03) 20. Xiaoyan Hong, Kaixin Xu and Mario Gerla Scalable Routing Protocols for Mobile Ad Hoc Networks. Computer Science Department, University of California, Los Angeles, August

Performance Of OLSR Routing Protocol Under Different Route Refresh Intervals In Ad Hoc Networks

Performance Of OLSR Routing Protocol Under Different Route Refresh Intervals In Ad Hoc Networks Performance Of OLSR Routing Protocol Under Different Route Refresh Intervals In Ad Hoc Networks P.Suganthi Research Scholar Mother Teresa Women s University Kodaikanal, TamilNadu, India Dr.A.Tamilarasi

More information

Routing Protocols in MANET: Comparative Study

Routing Protocols in MANET: Comparative Study Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 3, Issue. 7, July 2014, pg.119

More information

Simulation & Performance Analysis of Mobile Ad-Hoc Network Routing Protocol

Simulation & Performance Analysis of Mobile Ad-Hoc Network Routing Protocol Simulation & Performance Analysis of Mobile Ad-Hoc Network Routing Protocol V.S.Chaudhari 1, Prof.P.N.Matte 2, Prof. V.P.Bhope 3 Department of E&TC, Raisoni College of Engineering, Ahmednagar Abstract:-

More information

2013, IJARCSSE All Rights Reserved Page 85

2013, IJARCSSE All Rights Reserved Page 85 Volume 3, Issue 12, December 2013 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Overview of

More information

Introduction to Mobile Ad hoc Networks (MANETs)

Introduction to Mobile Ad hoc Networks (MANETs) Introduction to Mobile Ad hoc Networks (MANETs) 1 Overview of Ad hoc Network Communication between various devices makes it possible to provide unique and innovative services. Although this inter-device

More information

Mobile Ad Hoc Network Routing Protocols: A Comparative Study

Mobile Ad Hoc Network Routing Protocols: A Comparative Study Mobile Ad Hoc Network Routing Protocols: A Comparative Study Charu Wahi 1, Sanjay Kumar Sonbhadra 2 1 Birla institute of Technology, Noida, India charu@bitmesra.ac.in 2 Shri Shankracharya Institute of

More information

Unicast Routing in Mobile Ad Hoc Networks. Dr. Ashikur Rahman CSE 6811: Wireless Ad hoc Networks

Unicast Routing in Mobile Ad Hoc Networks. Dr. Ashikur Rahman CSE 6811: Wireless Ad hoc Networks Unicast Routing in Mobile Ad Hoc Networks 1 Routing problem 2 Responsibility of a routing protocol Determining an optimal way to find optimal routes Determining a feasible path to a destination based on

More information

REVIEW ON ROUTING PROTOCOLS FOR MOBILE AD HOC NETWORKS

REVIEW ON ROUTING PROTOCOLS FOR MOBILE AD HOC NETWORKS REVIEW ON ROUTING PROTOCOLS FOR MOBILE AD HOC NETWORKS G. Poornima 1, Mr. M. Rajasenathipathi 2, 1 Research Scholar, Department of Computer Science, NGM College, Pollachi 2 Assistant Professor, Department

More information

Performance Evaluation of MANET through NS2 Simulation

Performance Evaluation of MANET through NS2 Simulation International Journal of Electronic and Electrical Engineering. ISSN 0974-2174, Volume 7, Number 1 (2014), pp. 25-30 International Research Publication House http://www.irphouse.com Performance Evaluation

More information

Routing Protocols in MANETs

Routing Protocols in MANETs Chapter 4 Routing Protocols in MANETs 4.1 Introduction The main aim of any Ad Hoc network routing protocol is to meet the challenges of the dynamically changing topology and establish a correct and an

More information

Routing Protocols in Mobile Ad-Hoc Network

Routing Protocols in Mobile Ad-Hoc Network International Journal of Computer Science & Management Studies, Vol. 12, Issue 02, April 2012 Protocols in Mobile Ad-Hoc Network Sachin Minocha M. Tech Student, Vaish College of Engineering, Rohtak, Haryana

More information

CLASSIFICATION OF ROUTING Routing. Fig.1 Types of routing

CLASSIFICATION OF ROUTING Routing. Fig.1 Types of routing Volume 5, Issue 5, MAY 2015 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com A Survey on Unicast

More information

Study of Route Reconstruction Mechanism in DSDV Based Routing Protocols

Study of Route Reconstruction Mechanism in DSDV Based Routing Protocols Study of Route Reconstruction Mechanism in DSDV Based Routing Protocols Sharma Shelja, Kumar Suresh and Rathy R. K. Department of CSE, FET, MRIU, Faridabad, India Email: sharma.shelja@gmail.com, enthusk@yahoo.com,

More information

A COMPARISON OF REACTIVE ROUTING PROTOCOLS DSR, AODV AND TORA IN MANET

A COMPARISON OF REACTIVE ROUTING PROTOCOLS DSR, AODV AND TORA IN MANET ISSN: 2278 1323 All Rights Reserved 2016 IJARCET 296 A COMPARISON OF REACTIVE ROUTING PROTOCOLS DSR, AODV AND TORA IN MANET Dr. R. Shanmugavadivu 1, B. Chitra 2 1 Assistant Professor, Department of Computer

More information

OLSR Protocol with Cross Layer Design in MANET

OLSR Protocol with Cross Layer Design in MANET OLSR Protocol with Cross Layer Design in MANET 1 Janakkumar Patel, 2 Mitesh Thakkar Department Of Computer Engineering L.J. Institute of Engineering & Technology, Ahmedabad-382210, India 1 janakp005@gmail.com

More information

Performance Evaluation of Various Routing Protocols in MANET

Performance Evaluation of Various Routing Protocols in MANET 208 Performance Evaluation of Various Routing Protocols in MANET Jaya Jacob 1,V.Seethalakshmi 2 1 II MECS,Sri Shakthi Institute of Science and Technology, Coimbatore, India 2 Associate Professor-ECE, Sri

More information

A Novel Review on Routing Protocols in MANETs

A Novel Review on Routing Protocols in MANETs Robinpreet Kaur & Mritunjay Kumar Rai Department of Electronics and Engineering, Lovely Professional University, Phagwara, Punjab, India E-mail : robin_turna@yahoo.com, raimritunjay@gmail.com Abstract

More information

Enhanced QoS in MANETs using Analysis of Routing Protocol

Enhanced QoS in MANETs using Analysis of Routing Protocol International Journal of Scientific & Engineering Research, Volume 3, Issue 11, November-2012 1 Enhanced QoS in MANETs using Analysis of Routing Protocol # K. Venkata Ramana $ P.C. Devi and * B. Chaithanya

More information

A Comparative Analysis of Energy Preservation Performance Metric for ERAODV, RAODV, AODV and DSDV Routing Protocols in MANET

A Comparative Analysis of Energy Preservation Performance Metric for ERAODV, RAODV, AODV and DSDV Routing Protocols in MANET A Comparative Analysis of Energy Preservation Performance Metric for ERAODV, RAODV, AODV and DSDV Routing Protocols in MANET Bhabani Sankar Gouda Department of Computer Science & Engineering National Institute

More information

Content. 1. Introduction. 2. The Ad-hoc On-Demand Distance Vector Algorithm. 3. Simulation and Results. 4. Future Work. 5.

Content. 1. Introduction. 2. The Ad-hoc On-Demand Distance Vector Algorithm. 3. Simulation and Results. 4. Future Work. 5. Rahem Abri Content 1. Introduction 2. The Ad-hoc On-Demand Distance Vector Algorithm Path Discovery Reverse Path Setup Forward Path Setup Route Table Management Path Management Local Connectivity Management

More information

A Review of Reactive, Proactive & Hybrid Routing Protocols for Mobile Ad Hoc Network

A Review of Reactive, Proactive & Hybrid Routing Protocols for Mobile Ad Hoc Network ShriRam College of Engineering & Management 1 A Review of Reactive, Proactive & Hybrid Routing Protocols for Mobile Ad Hoc Network M.Ramaiya Rohit Gupta Rachit Jain Head,Dept. Computer Science Dept. Computer

More information

A Comparative Study of Routing Protocols for Mobile Ad-Hoc Networks

A Comparative Study of Routing Protocols for Mobile Ad-Hoc Networks Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 3, Issue. 11, November 2014,

More information

SIMULATION AND PERFORMANCE ANALYSIS OF DSDV, OLSR, DSR AND ZRP ROUTING PROTOCOLS IN MANETs

SIMULATION AND PERFORMANCE ANALYSIS OF DSDV, OLSR, DSR AND ZRP ROUTING PROTOCOLS IN MANETs SIMULATION AND PERFORMANCE ANALYSIS OF DSDV, OLSR, DSR AND ZRP ROUTING PROTOCOLS IN MANETs Swati Saxena, Birbal Saran, Mr. Vijendra Singh ASET, Amity University Jaipur (Rajasthan), India Abstract Mobile

More information

A Study on Routing Protocols for Mobile Adhoc Networks

A Study on Routing Protocols for Mobile Adhoc Networks A Study on Routing Protocols for Mobile Adhoc Networks R.Logambal 1, Dr.K.Chitra 2 Research Scholar, Dept of Computer Science, Bharathiar University, Coimbatore, India 1 Asst. Professor, Govt Arts College,

More information

PERFORMANCE ANALYSIS OF AODV ROUTING PROTOCOL IN MANETS

PERFORMANCE ANALYSIS OF AODV ROUTING PROTOCOL IN MANETS PERFORMANCE ANALYSIS OF AODV ROUTING PROTOCOL IN MANETS AMANDEEP University College of Engineering, Punjabi University Patiala, Punjab, India amandeep8848@gmail.com GURMEET KAUR University College of Engineering,

More information

Performance Analysis of Broadcast Based Mobile Adhoc Routing Protocols AODV and DSDV

Performance Analysis of Broadcast Based Mobile Adhoc Routing Protocols AODV and DSDV INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND MOBILE APPLICATIONS IJCSMA Performance Analysis of Broadcast Based Mobile Adhoc Routing Protocols AODV and DSDV Er. Sandeep Singh Khehra 1, Er. Abhinash Singla

More information

Evaluation of Ad-hoc Routing Protocols with. Different Mobility Models for Warfield. Scenarios

Evaluation of Ad-hoc Routing Protocols with. Different Mobility Models for Warfield. Scenarios Contemporary Engineering Sciences, Vol. 7, 2014, no. 12, 559-567 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ces.2014.4436 Evaluation of Ad-hoc Routing Protocols with Different Mobility Models

More information

Routing protocols in Mobile Ad Hoc Network

Routing protocols in Mobile Ad Hoc Network Routing protocols in Mobile Ad Hoc Network Presented By :- Nitesh Jain Date:-26/10/2005 SCHOOL OF INFORMATION TECHNOLOGY INDIAN INSTITUTE OF TECHNOLOGY KHARAGPUR KHARAGPUR Types of Wireless Networks Infrastructure

More information

Performance Analysis and Enhancement of Routing Protocol in Manet

Performance Analysis and Enhancement of Routing Protocol in Manet Vol.2, Issue.2, Mar-Apr 2012 pp-323-328 ISSN: 2249-6645 Performance Analysis and Enhancement of Routing Protocol in Manet Jaya Jacob*, V.Seethalakshmi** *II MECS, Sri Shakthi Institute of Engineering and

More information

Mr. Pradip A. Chougule 1, Mr. Rajesh A. Sanadi 2, Mr. U. H.Kamble 3

Mr. Pradip A. Chougule 1, Mr. Rajesh A. Sanadi 2, Mr. U. H.Kamble 3 IOSR Journal of Computer Engineering (IOSR-JCE) ISSN: 2278-0661, ISBN: 2278-8727, PP: 01-05 www.iosrjournals.org COMPARATIVE STUDY OF TABLE DRIVEN ROUTING PROTOCOLS IN AD HOC WIRELESS NETWORKS Mr. Pradip

More information

Estimate the Routing Protocols for Internet of Things

Estimate the Routing Protocols for Internet of Things Estimate the Routing Protocols for Internet of Things 1 Manjushree G, 2 Jayanthi M.G 1,2 Dept. of Computer Network and Engineering Cambridge Institute of Technology Bangalore, India Abstract Internet of

More information

Routing in Ad Hoc Wireless Networks PROF. MICHAEL TSAI / DR. KATE LIN 2014/05/14

Routing in Ad Hoc Wireless Networks PROF. MICHAEL TSAI / DR. KATE LIN 2014/05/14 Routing in Ad Hoc Wireless Networks PROF. MICHAEL TSAI / DR. KATE LIN 2014/05/14 Routing Algorithms Link- State algorithm Each node maintains a view of the whole network topology Find the shortest path

More information

[Kamboj* et al., 5(9): September, 2016] ISSN: IC Value: 3.00 Impact Factor: 4.116

[Kamboj* et al., 5(9): September, 2016] ISSN: IC Value: 3.00 Impact Factor: 4.116 IJESRT INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY NOVEL REVIEW OF MANET ROUTING PROTOCOLS Nippun Kamboj*, Dr. Munishwar Rai Department of Computer Applications Maharishi Markandeshwar

More information

A Review paper on Routing Protocol Comparison

A Review paper on Routing Protocol Comparison A Review paper on Routing Protocol Comparison Ms. Aastha kohli 1, Mr. Sukhbir 2 1 M.Tech(CSE) (N.C College of Engineering, Israna Panipat) 2 HOD Computer Science Dept.( N.C College of Engineering, Israna

More information

A Comparative study of On-Demand Data Delivery with Tables Driven and On-Demand Protocols for Mobile Ad-Hoc Network

A Comparative study of On-Demand Data Delivery with Tables Driven and On-Demand Protocols for Mobile Ad-Hoc Network A Comparative study of On-Demand Data Delivery with Tables Driven and On-Demand Protocols for Mobile Ad-Hoc Network Humayun Bakht Research Fellow, London School of Commerce, United Kingdom humayunbakht@yahoo.co.uk

More information

Performance Comparison of Ad Hoc Routing Protocols over IEEE DCF and TDMA MAC Layer Protocols

Performance Comparison of Ad Hoc Routing Protocols over IEEE DCF and TDMA MAC Layer Protocols Performance Comparison of Ad Hoc Routing Protocols over IEEE 82.11 DCF and TDMA MAC Layer Protocols Govind. P. Gupta Computer Science Department R.K.G.I.T, Ghaziabad (India) er_gpgupta@yahoo.com A. K.

More information

A Comparative Analysis of Pro-active Routing Protocols in MANET

A Comparative Analysis of Pro-active Routing Protocols in MANET Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 3, Issue. 6, June 2014, pg.144

More information

MANET TECHNOLOGY. Keywords: MANET, Wireless Nodes, Ad-Hoc Network, Mobile Nodes, Routes Protocols.

MANET TECHNOLOGY. Keywords: MANET, Wireless Nodes, Ad-Hoc Network, Mobile Nodes, Routes Protocols. MANET TECHNOLOGY Dharna 1, Varsha Saroha 2, R. B. Dubey 3 1,2,3 Department of Electronics and Communication Engineering, Hindu College of Engineering, Sonepat, Haryana,(India) ABSTRACT Wireless technology

More information

Performance Evaluation of AODV DSDV and OLSR Routing Protocols with Varying FTP Connections in MANET

Performance Evaluation of AODV DSDV and OLSR Routing Protocols with Varying FTP Connections in MANET Performance Evaluation of AODV DSDV and OLSR Protocols with Varying FTP Connections in MANET Alok Upadhyay, Rupali Phatak Research Scholar, Asst. Professor -Department of Electronics & Communication Engineering

More information

A Survey - Energy Efficient Routing Protocols in MANET

A Survey - Energy Efficient Routing Protocols in MANET , pp. 163-168 http://dx.doi.org/10.14257/ijfgcn.2016.9.5.16 A Survey - Energy Efficient Routing Protocols in MANET Jyoti Upadhyaya and Nitin Manjhi Department of Computer Science, RGPV University Shriram

More information

Zone-based Proactive Source Routing Protocol for Ad-hoc Networks

Zone-based Proactive Source Routing Protocol for Ad-hoc Networks 2014 IJSRSET Volume i Issue i Print ISSN : 2395-1990 Online ISSN : 2394-4099 Themed Section: Science Zone-based Proactive Source Routing Protocol for Ad-hoc Networks Dr.Sangheethaa.S 1, Dr. Arun Korath

More information

Experiment and Evaluation of a Mobile Ad Hoc Network with AODV Routing Protocol

Experiment and Evaluation of a Mobile Ad Hoc Network with AODV Routing Protocol Experiment and Evaluation of a Mobile Ad Hoc Network with AODV Routing Protocol Kalyan Kalepu, Shiv Mehra and Chansu Yu, Department of Electrical and Computer Engineering Cleveland State University 2121

More information

Analysis of Routing Protocols in MANETs

Analysis of Routing Protocols in MANETs Analysis of Routing Protocols in MANETs Musica Supriya, Rashmi, Nishchitha, Ashwini C Shetty, Sharath Kumar Student, Dept. of CSE, SMVITM Bantakal, Karnataka, India Student, Dept. of CSE, SMVITM Bantakal,

More information

Figure 1: Ad-Hoc routing protocols.

Figure 1: Ad-Hoc routing protocols. Performance Analysis of Routing Protocols for Wireless Ad-Hoc Networks Sukhchandan Lally and Ljiljana Trajković Simon Fraser University Vancouver, British Columbia Canada E-mail: {lally, ljilja}@sfu.ca

More information

MANET is considered a collection of wireless mobile nodes that are capable of communicating with each other. Research Article 2014

MANET is considered a collection of wireless mobile nodes that are capable of communicating with each other. Research Article 2014 Throughput Analysis of Proactive and Reactive MANET Routing Protocols Kiranveer Kaur 1 Surinderjit Kaur 2 Vikramjit Singh 3 Department of Computer Science, University College of Engineering, Department

More information

Behaviour of Routing Protocols of Mobile Adhoc Netwok with Increasing Number of Groups using Group Mobility Model

Behaviour of Routing Protocols of Mobile Adhoc Netwok with Increasing Number of Groups using Group Mobility Model Behaviour of Routing Protocols of Mobile Adhoc Netwok with Increasing Number of Groups using Group Mobility Model Deepak Agrawal, Brajesh Patel Department of CSE Shri Ram Institute of Technology Jabalpur,

More information

A Highly Effective and Efficient Route Discovery & Maintenance in DSR

A Highly Effective and Efficient Route Discovery & Maintenance in DSR A Highly Effective and Efficient Route Discovery & Maintenance in DSR Shiva Prakash 1, Rajeev Kumar 2, Brijesh Nayak 3, Manindar Kumar Yadav 4 Department of Computer Science and Engineering, Madan Mohan

More information

Analysis of Black-Hole Attack in MANET using AODV Routing Protocol

Analysis of Black-Hole Attack in MANET using AODV Routing Protocol Analysis of Black-Hole Attack in MANET using Routing Protocol Ms Neha Choudhary Electronics and Communication Truba College of Engineering, Indore India Dr Sudhir Agrawal Electronics and Communication

More information

Analysis QoS Parameters for Mobile Ad-Hoc Network Routing Protocols: Under Group Mobility Model

Analysis QoS Parameters for Mobile Ad-Hoc Network Routing Protocols: Under Group Mobility Model 2009 International Conference on Computer Engineering and Applications IPCSIT vol.2 (2011) (2011) IACSIT Press, Singapore Analysis QoS Parameters for Mobile Ad-Hoc Network Routing Protocols: Under Group

More information

Simulation and Comparative Analysis of AODV, DSR, DSDV and OLSR Routing Protocol in MANET Abstract Keywords:

Simulation and Comparative Analysis of AODV, DSR, DSDV and OLSR Routing Protocol in MANET Abstract Keywords: Volume-9 Number-1 Jan -June 2017 pp. 16-21 available online at www.csjournalss.com Simulation and Comparative Analysis of AODV, DSR, DSDV and OLSR Routing Protocol in MANET Sachin Lalar, Arun Kumar Yadav

More information

Routing Protocols Wireless for Ad Hoc Wireless Networks: Classifications of Protocols and A review of Table Driven Protocols Abstract:

Routing Protocols Wireless for Ad Hoc Wireless Networks: Classifications of Protocols and A review of Table Driven Protocols Abstract: Routing Protocols Wireless for Ad Hoc Wireless Networks: Classifications of Protocols and A review of Table Driven Protocols Amr Ergawy aergawy@cc.hut.fi Abstract: Ad Hoc wireless networks have their own

More information

Reducing End to End per Packet Energy Consumption

Reducing End to End per Packet Energy Consumption Reducing End to End per Packet Energy Consumption N.Annapurna #1, M.V.Vijaya saradhi *2 # PG Scholar, Department of IT, Aurora s Engineering College, Bhongir, Andhra Pradesh, India # HOD, Department of

More information

Performance Comparison of AODV, DSR, DSDV and OLSR MANET Routing Protocols

Performance Comparison of AODV, DSR, DSDV and OLSR MANET Routing Protocols Performance Comparison of AODV, DSR, DSDV and OLSR MANET Routing Protocols Akshay Shankar, Lavanya Chelle Information Science Engineering RNS Institute of Technology Bangalore, India Abstract- A Mobile

More information

Keywords Mobile Ad hoc Networks, Multi-hop Routing, Infrastructure less, Multicast Routing, Routing.

Keywords Mobile Ad hoc Networks, Multi-hop Routing, Infrastructure less, Multicast Routing, Routing. Volume 4, Issue 7, July 2014 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com A Study on Various

More information

Shortcut Tree Routing using Neighbor Table in ZigBee Wireless Networks

Shortcut Tree Routing using Neighbor Table in ZigBee Wireless Networks Shortcut Tree Routing using Neighbor Table in ZigBee Wireless Networks Salmu K.P 1, Chinchu James 2 1,2 Department of Computer Science, IIET, Nellikuzhi Abstract- ZigBee is a worldwide standard for wireless

More information

Comprehensive Study and Review Various Routing Protocols in MANET

Comprehensive Study and Review Various Routing Protocols in MANET 126 Comprehensive Study and Review Various Routing Protocols in MANET Prabhjot Kaur 1, Preet Bala 2 M-Tech Student(CSE), GZS PTU CAMPUS, Bathinda Prabhjot6996@gmail.com Dr. Shaveta Rani, Dr. Paramjeet

More information

Performance Analysis of MANET Routing Protocols OLSR and AODV

Performance Analysis of MANET Routing Protocols OLSR and AODV VOL. 2, NO. 3, SEPTEMBER 211 Performance Analysis of MANET Routing Protocols OLSR and AODV Jiri Hosek Faculty of Electrical Engineering and Communication, Brno University of Technology Email: hosek@feec.vutbr.cz

More information

ANALYSIS OF DIFFERENT REACTIVE, PROACTIVE & HYBRID ROUTING PROTOCOLS: A REVIEW

ANALYSIS OF DIFFERENT REACTIVE, PROACTIVE & HYBRID ROUTING PROTOCOLS: A REVIEW ANALYSIS OF DIFFERENT REACTIVE, PROACTIVE & HYBRID ROUTING PROTOCOLS: A REVIEW Kirandeep Kaur 1, Mr.Pawan Luthra 2, Er.Gagandeep 3 1 Department of Computer Science and Engineering, Shaheed Bhagat Singh

More information

Performance Metrics of MANET in Multi-Hop Wireless Ad-Hoc Network Routing Protocols

Performance Metrics of MANET in Multi-Hop Wireless Ad-Hoc Network Routing Protocols Performance Metrics of MANET in Multi-Hop Wireless Ad-Hoc Network Routing Protocols R.Devi, B.Sumathi, T.Gandhimathi, G.Alaiyarasi 1 st year, M.Tech (Software Engineering), Department of Information Technology,

More information

LECTURE 9. Ad hoc Networks and Routing

LECTURE 9. Ad hoc Networks and Routing 1 LECTURE 9 Ad hoc Networks and Routing Ad hoc Networks 2 Ad Hoc Networks consist of peer to peer communicating nodes (possibly mobile) no infrastructure. Topology of the network changes dynamically links

More information

The General Analysis of Proactive Protocols DSDV, FSR and WRP

The General Analysis of Proactive Protocols DSDV, FSR and WRP Volume 116 No. 10 2017, 375-380 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu The General Analysis of Proactive Protocols DSDV, FSR and WRP 1 Dr.

More information

Gateway Discovery Approaches Implementation and Performance Analysis in the Integrated Mobile Ad Hoc Network (MANET)-Internet Scenario

Gateway Discovery Approaches Implementation and Performance Analysis in the Integrated Mobile Ad Hoc Network (MANET)-Internet Scenario Gateway Discovery Approaches Implementation and Performance Analysis in the Integrated Mobile Ad Hoc Network (MANET)-Internet Scenario K.Gautham 1, Nagajothi A 2 Student, Computer Science and Engineering,

More information

Design and Implementation of a Simulator for Ad Hoc Network Routing Protocols

Design and Implementation of a Simulator for Ad Hoc Network Routing Protocols Design and Implementation of a Simulator for Ad Hoc Network Routing Protocols Mudit, Sachin Chaudhary Abstract In consideration of adaptability to the environment and flexibility in protocol construction,

More information

ROUTE STABILITY MODEL FOR DSR IN WIRELESS ADHOC NETWORKS

ROUTE STABILITY MODEL FOR DSR IN WIRELESS ADHOC NETWORKS ROUTE STABILITY MODEL FOR DSR IN WIRELESS ADHOC NETWORKS Ganga S 1, Binu Chandran R 2 1, 2 Mohandas College Of Engineering And Technology Abstract: Wireless Ad-Hoc Network is a collection of wireless mobile

More information

Location Awareness in Ad Hoc Wireless Mobile Neworks

Location Awareness in Ad Hoc Wireless Mobile Neworks Location Awareness in Ad Hoc Wireless Mobile Neworks Lijuan Ai Wenyu Wang Yi Zhou 11/14/2001 Mobile Computing, Fall 2001 1 PART I INTRODUCTION TO MANET & LOCATION-AWARE COMPONENTS 11/14/2001 Mobile Computing,

More information

UCS-805 MOBILE COMPUTING Jan-May,2011 TOPIC 8. ALAK ROY. Assistant Professor Dept. of CSE NIT Agartala.

UCS-805 MOBILE COMPUTING Jan-May,2011 TOPIC 8. ALAK ROY. Assistant Professor Dept. of CSE NIT Agartala. Mobile Ad Hoc Networks: Routing TOPIC 8 UCS-805 MOBILE COMPUTING Jan-May,2011 ALAK ROY. Assistant Professor Dept. of CSE NIT Agartala Email-alakroy.nerist@gmail.com Mobile Ad Hoc Networks (MANET) Introduction

More information

Design and Implementation of a Simulator for Ad Hoc Network Routing Protocol

Design and Implementation of a Simulator for Ad Hoc Network Routing Protocol IOSR Journal of Computer Engineering (IOSR-JCE) e-issn: 2278-0661, p- ISSN: 2278-8727Volume 16, Issue 3, Ver. VII (May-Jun. 2014), PP 47-53 Design and Implementation of a Simulator for Ad Hoc Network Routing

More information

Maharishi Markandeshwar University

Maharishi Markandeshwar University RESEARCH ARTICLE OPEN ACCESS Simulation Based Performance Comparison of Adhoc Routing Protocols Kushagra Agrawal*, Shaveta Jain** *Department of Computer Science,, Mullana, Ambala agrawal_kushagra@rediffmail.com

More information

A Review Paper on Routing Protocols in Wireless Sensor Networks

A Review Paper on Routing Protocols in Wireless Sensor Networks A Review Paper on Routing Protocols in Wireless Sensor Networks Seema Pahal 1, Kusum Dalal 2 1,2 ECE Department, DCRUST MURTHAL, Haryana Abstract- This paper presents a literature review on WSN networks,

More information

Ad Hoc Networks: Issues and Routing

Ad Hoc Networks: Issues and Routing Ad Hoc Networks: Issues and Routing Raj Jain Washington University in Saint Louis Saint Louis, MO 63130 Jain@cse.wustl.edu Audio/Video recordings of this lecture are available at: http://www.cse.wustl.edu/~jain/cse574-08/

More information

STUDY AND ANALYSIS OF DSDV AND OLSR

STUDY AND ANALYSIS OF DSDV AND OLSR Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 5, Issue. 1, January 2016,

More information

Routing protocols in WSN

Routing protocols in WSN Routing protocols in WSN 1.1 WSN Routing Scheme Data collected by sensor nodes in a WSN is typically propagated toward a base station (gateway) that links the WSN with other networks where the data can

More information

Performance Analysis of AODV, DSDV and DSR by using Different Mobility Models

Performance Analysis of AODV, DSDV and DSR by using Different Mobility Models Performance Analysis of AODV, DSDV and DSR by using Different Mobility Models Sukhwinder Kumar 1, Jasndeep Kaur 2 Lecturer, Dept. of ECE, Thapar University, Patiala, Punjab, India 1 PG Student [WC], Dept.

More information

Quantitative Performance Evaluation of DSDV and OLSR Routing Protocols in Wireless Ad-hoc Networks

Quantitative Performance Evaluation of DSDV and OLSR Routing Protocols in Wireless Ad-hoc Networks Quantitative Performance Evaluation of DSDV and OLSR Routing Protocols in Wireless Ad-hoc Networks E. Suresh Babu P S V Srinivasa Rao M Srinivasa Rao C Nagaraju Assoc. Prof. of CSE K L University, Vijayawada.

More information

Performance Evaluation of Two Reactive and Proactive Mobile Ad Hoc Routing Protocols

Performance Evaluation of Two Reactive and Proactive Mobile Ad Hoc Routing Protocols www.ijcsi.org 551 Performance Evaluation of Two Reactive and Proactive Mobile Ad Hoc Routing Protocols Kashif Ibrahim Qazi Javed Ahmed Abdul Qudoos Mirza Aamir Mehmood Department of Computer Science, Balochistan

More information

International Journal of Advance Engineering and Research Development. Improved OLSR Protocol for VANET

International Journal of Advance Engineering and Research Development. Improved OLSR Protocol for VANET Scientific Journal of Impact Factor (SJIF): 4.72 International Journal of Advance Engineering and Research Development Volume 4, Issue 11, November -2017 Improved OLSR Protocol for VANET Ravi Shrimali

More information

COMPARATIVE STUDY OF ROUTING PROTOCOLS FOR MANETS

COMPARATIVE STUDY OF ROUTING PROTOCOLS FOR MANETS COMPARATIVE STUDY OF ROUTING PROTOCOLS FOR MANETS M. Palaniammal Computer Science and Engineering Bharathidasan University Trichy, India. m.palanimca@gmail.com M. Lalli Computer Science and Engineering

More information

International Journal of Scientific & Engineering Research, Volume 4, Issue 7, July ISSN

International Journal of Scientific & Engineering Research, Volume 4, Issue 7, July ISSN International Journal of Scientific & Engineering Research, Volume 4, Issue 7, July-2013 1447 A Survey cum Simulation on Routing Protocols for Mobile Ad-Hoc Network Nidhi bajpai,anuradha,rajat Dixit ABSTRACT

More information

Investigation on OLSR Routing Protocol Efficiency

Investigation on OLSR Routing Protocol Efficiency Investigation on OLSR Routing Protocol Efficiency JIRI HOSEK 1, KAROL MOLNAR 2 Department of Telecommunications Faculty of Electrical Engineering and Communication, Brno University of Technology Purkynova

More information

Performance evaluation of reactive and proactive routing protocol in IEEE ad hoc network

Performance evaluation of reactive and proactive routing protocol in IEEE ad hoc network Author manuscript, published in "ITCom 6 - next generation and sensor networks, Boston : United States (26)" DOI :.7/2.68625 Performance evaluation of reactive and proactive routing protocol in IEEE 82.

More information

A Distributed Weighted Cluster Based Routing Protocol for MANETs

A Distributed Weighted Cluster Based Routing Protocol for MANETs Wireless Sensor Network, 2011, 3, 54-60 doi:10.4236/wsn.2011.32006 Published Online February 2011 (http://www.scirp.org/journal/wsn) A Distributed Weighted Cluster Based Routing Protocol for MANETs Abstract

More information

G.Narasa Reddy, 2 A.Avanthi, 3 R.Prasanth Reddy 1

G.Narasa Reddy, 2 A.Avanthi, 3 R.Prasanth Reddy 1 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: Enhancing DSR Protocol Performance in Mobile Ad Hoc Networks

More information

A Survey on Wireless Routing Protocols (AODV, DSR, DSDV)

A Survey on Wireless Routing Protocols (AODV, DSR, DSDV) RESEARCH ARTICLE International Journal of Computer Techniques - Volume 2 Issue 1, 2015 OPEN ACCESS A Survey on Wireless Routing Protocols (AODV, DSR, DSDV) Sejal D Mello 1, Priyanka B. Patil 2, Tarannum

More information

Simulation and Analysis of AODV and DSDV Routing Protocols in Vehicular Adhoc Networks using Random Waypoint Mobility Model

Simulation and Analysis of AODV and DSDV Routing Protocols in Vehicular Adhoc Networks using Random Waypoint Mobility Model Simulation and Analysis of AODV and DSDV Routing Protocols in Vehicular Adhoc Networks using Random Waypoint Mobility Model 1 R. Jeevitha, 2 M. Chandra Kumar 1 Research Scholar, Department of Computer

More information

Review paper on performance analysis of AODV, DSDV, OLSR on the basis of packet delivery

Review paper on performance analysis of AODV, DSDV, OLSR on the basis of packet delivery IOSR Journal of Computer Engineering (IOSR-JCE) e-issn: 2278-0661, p- ISSN: 2278-8727Volume 11, Issue 1 (May. - Jun. 2013), PP 51-55 Review paper on performance analysis of AODV, DSDV, OLSR on the basis

More information

Effect of Variable Bit Rate Traffic Models on the Energy Consumption in MANET Routing Protocols

Effect of Variable Bit Rate Traffic Models on the Energy Consumption in MANET Routing Protocols Volume 1, Issue 3, October 2013 ISSN: 2320-9984 (Online) International Journal of Modern Engineering & Management Research Website: www.ijmemr.org Effect of Variable Bit Rate Traffic Models on the Energy

More information

Performance Analysis Of Qos For Different MANET Routing Protocols (Reactive, Proactive And Hybrid) Based On Type Of Data

Performance Analysis Of Qos For Different MANET Routing Protocols (Reactive, Proactive And Hybrid) Based On Type Of Data ISSN (e): 2250 3005 Volume, 08 Issue, 4 April 2018 International Journal of Computational Engineering Research (IJCER) Performance Analysis Of Qos For Different MANET Routing Protocols (Reactive, Proactive

More information

A Comparative and Performance Study of On Demand Multicast Routing Protocols for Ad Hoc Networks

A Comparative and Performance Study of On Demand Multicast Routing Protocols for Ad Hoc Networks A Comparative and Performance Study of On Demand Multicast Routing Protocols for Ad Hoc Networks P.Madhan Mohan #, J.James Johnson #, K.Murugan $ and V.Ramachandran % # Under Graduate Student $ Senior

More information

Throughput Analysis of Many to One Multihop Wireless Mesh Ad hoc Network

Throughput Analysis of Many to One Multihop Wireless Mesh Ad hoc Network Throughput Analysis of Many to One Multihop Wireless Mesh Ad hoc Network Dr.S.Senthil Kumar,Assistant Professor, Dept of Electrical and Electronics Engineering, Government College of Engineering, Salem,India

More information

A SURVEY OF ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKS

A SURVEY OF ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKS Journal homepage: www.mjret.in ISSN:2348-6953 A SURVEY OF ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKS Ms. Amruta Kodole 1, Prof. P. M. Agarkar 2 Computer Engineering Dr. D. Y. Patil School Of Engineering

More information

Mobile Communications. Ad-hoc and Mesh Networks

Mobile Communications. Ad-hoc and Mesh Networks Ad-hoc+mesh-net 1 Mobile Communications Ad-hoc and Mesh Networks Manuel P. Ricardo Faculdade de Engenharia da Universidade do Porto Ad-hoc+mesh-net 2 What is an ad-hoc network? What are differences between

More information

Performance Comparison and Analysis of Table- Driven and On-Demand Routing Protocols for Mobile Ad-hoc Networks

Performance Comparison and Analysis of Table- Driven and On-Demand Routing Protocols for Mobile Ad-hoc Networks Vol:2, No:2, 28 Performance Comparison and Analysis of Table- Driven and On-Demand Routing Protocols for Mobile Ad-hoc Networks Narendra Singh Yadav, R.P.Yadav International Science Index, Electronics

More information

Current Project Work on Routing Protocols for MANET: A Literature Survey Mr. Chethan Chandra S Basavaraddi, Smt. Geetha N.B. M.Tech.

Current Project Work on Routing Protocols for MANET: A Literature Survey Mr. Chethan Chandra S Basavaraddi, Smt. Geetha N.B. M.Tech. International Journal of Scientific & Engineering Research Volume 3, Issue 5, May-2012 1 Current Project Work on Routing Protocols for MANET: A Literature Survey Mr. Chethan Chandra S Basavaraddi, Smt.

More information

Performance Evaluation Of Ad-Hoc On Demand Routing Protocol (AODV) Using NS-3 Simulator

Performance Evaluation Of Ad-Hoc On Demand Routing Protocol (AODV) Using NS-3 Simulator Performance Evaluation Of Ad-Hoc On Demand Routing Protocol (AODV) Using NS-3 Simulator Dr. S. K. Singh Professor, Department of EC, India Dr. R. Gupta Asst. Prof. Department of EC, India Abstract: The

More information

Performance Analysis of Proactive and Reactive Routing Protocols for QOS in MANET through OLSR & AODV

Performance Analysis of Proactive and Reactive Routing Protocols for QOS in MANET through OLSR & AODV MIT International Journal of Electrical and Instrumentation Engineering, Vol. 3, No. 2, August 2013, pp. 57 61 57 Performance Analysis of Proactive and Reactive Routing Protocols for QOS in MANET through

More information

Study and Comparison of Mesh and Tree- Based Multicast Routing Protocols for MANETs

Study and Comparison of Mesh and Tree- Based Multicast Routing Protocols for MANETs Study and Comparison of Mesh and Tree- Based Multicast Routing Protocols for MANETs Rajneesh Gujral Associate Proffesor (CSE Deptt.) Maharishi Markandeshwar University, Mullana, Ambala Sanjeev Rana Associate

More information

6367(Print), ISSN (Online) Volume 4, Issue 2, March April (2013), IAEME & TECHNOLOGY (IJCET)

6367(Print), ISSN (Online) Volume 4, Issue 2, March April (2013), IAEME & TECHNOLOGY (IJCET) INTERNATIONAL International Journal of Computer JOURNAL Engineering OF COMPUTER and Technology ENGINEERING (IJCET), ISSN 0976- & TECHNOLOGY (IJCET) ISSN 0976 6367(Print) ISSN 0976 6375(Online) Volume 4,

More information

A Literature survey on Improving AODV protocol through cross layer design in MANET

A Literature survey on Improving AODV protocol through cross layer design in MANET A Literature survey on Improving AODV protocol through cross layer design in MANET Nidhishkumar P. Modi 1, Krunal J. Panchal 2 1 Department of Computer Engineering, LJIET, Gujarat, India 2 Asst.Professor,

More information

Mitigating Superfluous Flooding of Control Packets MANET

Mitigating Superfluous Flooding of Control Packets MANET Mitigating Superfluous Flooding of Control Packets MANET B.Shanmugha Priya 1 PG Student, Department of Computer Science, Park College of Engineering and Technology, Kaniyur, Coimbatore, India 1 Abstract:

More information

Performance Comparison of MANETs Routing Protocols for Dense and Sparse Topology

Performance Comparison of MANETs Routing Protocols for Dense and Sparse Topology 2012 International Conference on Information and Computer Networks (ICICN 2012) IPCSIT vol. 27 (2012) (2012) IACSIT Press, Singapore Performance Comparison of MANETs Routing Protocols for Dense and Sparse

More information