Preemptive Multicast Routing in Mobile Ad-hoc Networks
|
|
- Agatha Skinner
- 5 years ago
- Views:
Transcription
1 Preemptive Multicast Routing in Mobile Ad-hoc Networks Uyen Trang Nguyen and Xing Xiong Department of Computer Science and Engineering York University, Toronto, Ontario Canada, M3J 1P3 {utn, Abstract Preemptive routing has been used for point-to-point (unicast) communications in mobile ad-hoc networks (MANETs) to minimize route breakage and end-to-end delay. In this paper, we present design and implementation issues of preemptive multicast routing. We then describe a preemptive multicast routing protocol based on ODMRP, which we call PMR (Preemptive Multicast Routing). Compared with ODMRP, PMR protocol offers higher packet delivery ratio and better scalability with less overhead. These advantages of PMR have been confirmed by simulation results. 1 Introduction Mobile ad-hoc networks (MANETs) require no fixed infrastructure or central administration. Mobile nodes in an ad-hoc network work not only as hosts but also as routers, and communicate with each other via packet radios. Characteristics particular to mobile ad-hoc networks are frequent changes of topology due to hosts mobility, limited energy, low bandwidth and unreliable communication. Mobile ad-hoc networks support many important applications such as search and rescue, disaster recovery, emergency support, tactical military, as well as group communication such as communication set-up in exhibitions, conferences, presentations, meetings, and lectures. Unicast routing protocols in MANETs can be classified as table-driven or on-demand. In both types of algorithms, an alternate path is sought only after the primary path fails. The consequences of this practice include packet losses resulting from link breakage and long delays before the failure is detected and a new path is established. Preemptive route maintenance allows detection of potential link breakage and establishment of an alternate path before the 1
2 disconnection occurs. This may prevent an actual route break and thus minimizes packet loss. When a route break cannot be avoided, the latency of new path establishment is reduced. Preemptive route maintenance has been shown to improve the performance of unicast routing [1, 2, 3]. In this paper we extend the concept of preemptive routing to multicast routing. Wireless ad-hoc networks are well suited for multicast because of their inherent broadcast capability. Multicast routing protocols designed for wired networks may fail to keep up with node mobility and frequent topology changes in a MANET. Those protocols also require node to store routing information, for which mobile hosts would not have sufficient storage or energy. Many multicast routing protocols have been proposed specifically for MANETs. They can be classified into two main groups: tree-based and mesh-based. Examples of tree-based protocols are AMRIS [4], MAODV [5], and LAM [6]. Studies have shown that tree-based protocols are not necessarily best suited for multicast in MANETs where network topology changes frequently. Mesh-based protocols have been shown to outperform tree-based protocols thanks to alternative paths which allow routing after primary paths fail. Among existing mesh-based protocols such as ODRMP [7], CAMP [8], and FGMP [9], ODMRP is the simplest protocol yet offers high packet delivery ratio and adapts well to high mobility of nodes. The main disadvantage of ODMRP is overhead caused by the flooding of join requests and join replies. This in turn affects the scalability of ODMRP. The traffic overhead and scalability problems of ODMRP can be remedied using preemptive routing. To reduce the overhead of flooding, the refresh interval should be increased (i.e., the frequency of flooding should be reduced). However, less frequent flooding will result in more route breaks, and an increase in packets lost. Preemptive routing is thus used to detect potential route breaks and, after detection, initiates a new route discovery using a join request. That is, between refresh messages, route discovery is initiated only when a potential route break is detected. Preemptive routing applied to ODMRP results in better performance due to: Reducing overhead of join requests by reducing the frequency of flooding Reducing the number of collisions of data packets that would have been caused by join requests in the original ODMRP. The result is less packet loss with less overhead. In this paper we describe a preemptive multicast routing protocol based on ODMRP, which we call PMR (Preemptive Multicast Routing). Compared with ODMRP, PMR protocol offers higher packet delivery ratio and better 2
3 scalability with less overhead. These advantages of PMR have been confirmed by simulation results. The concept of preemptive routing can also be applied to other multicast routing protocols in MANETs to improve their performance. In section 3, we provide, as examples, suggestions to add preemptive routing to CAMP and AMRIS protocols. This paper is organized as follows. Section 2 gives an overview of ODMRP, preemptive routing, and PMR protocol. Section 3 describes PMR in detail. Experimental results are presented in Section 4 to validate the effectiveness and performance of PMR. Section 5 concludes the paper. 2 Overview This section provides an overview of ODMRP, preemptive routing, and PMR protocol. 2.1 ODMRP Overview ODMRP creates a mesh of nodes (the forwarding group ) which forward multicast packets via flooding (within the mesh), thus providing path redundancy. In ODMRP, group membership and multicast routes are established and updated by the source on demand. When multicast sources have data to send, but do not have routing or membership information, they flood a JOIN DATA packet. When a node receives a non-duplicate JOIN DATA, it stores the upstream node ID (i.e., backward learning) and rebroadcasts the packet. When the JOIN_DATA packet reaches a multicast receiver, the receiver creates a JOIN TABLES and broadcasted to the neighbors. When a node receives a JOIN TABLE, it checks if the next node ID of one of the entries matches its own ID. If it does, the node realizes that it is on the path to the source and thus is part of the forwarding group. It then broadcasts its own JOIN TABLE built upon matched entries. The JOIN TABLE is thus propagated by each forwarding group member until it reaches the multicast source via the shortest path. This process constructs (or updates) the routes from sources to receivers and builds a mesh of nodes, the forwarding group. Multicast senders refresh the membership information and update the routes by sending JOIN DATA periodically. 3
4 2.2 Preemptive Unicast Routing Preemptive route maintenance allows a routing algorithm maintains connectivity by preemptively switching to a higher quality path when the quality of the currently used path is deemed suspicious. Preemptive routing initiates recovery action early by detecting that a link is likely to be broken soon and searching for a new path before the current path actually breaks. Specifically, a preemptive routing algorithm consists of two components: (1) detecting that a path is likely to be broken soon; (2) searching for a new path and switch to it. A critical design issue of a preemptive routing protocol is to determine when a path should be replaced (which triggers the search for a new path). The quality of a path can be evaluated based on several factors such as signal strength, hop count, the age of the path, and traffic load. The algorithm in [1] uses the signal strength of received packets as the primary criterion with the hop count being used as the second measure. The protocol in [2] also uses signal strength, more specifically the SNR (signal-to-noise ratio), as a measure of path quality. In MANETs most route breaks are caused by link failures due to node mobility. Therefore the signal strength is the most direct indication of how well mobile hosts can communicate with each other. We thus use signal strength as a measure of path quality in the PMR protocol. 2.3 Preemptive Route Maintenance for Multicast: Design Issues Implementing preemptive route maintenance with multicast is not a trivial task due to multiple senders/receivers, and the broadcast nature of ad-hoc data transmission. The most serious problem is feedback implosion. The problem of feedback implosion is best explained using a tree structure (although the underlying routing structure can be a mesh, as in the case of ODMRP). If the routing structure is viewed as a logical tree, we can define the following relationships between any two nodes, A and B, with respect to the source and the logical tree in the routing mesh [10]: Direct: packets are routed trough A before reaching B. Indirect: packets that reach A and B share some common path from the source. No relationship: packets that reach A and B do not share in any common paths from the source. 4
5 S Figure 1: A logical tree in the routing mesh In Figure 1, nodes 10 and 11, for example, have a direct relationship. If link (9, 10) is a bout to break, both nodes 10 and 11 (and 12) would detect this fact and generate two different warning messages. However, only one warning, for example from node 10, would be sufficient. Nodes 6 and 8 have an indirect relationship. If both links (5,6) and (7,8) are about to break, nodes 6 and 8 would both send different warning messages one right after another, while only one warning would suffice to inform the source of both potential breakages. Feedback implosion has two implications when applying preemptive route maintenance to multicast. The first implication is high traffic overhead caused by warning messages. To overcome this problem, there must be a feedback suppression mechanism to minimize the number of warning messages traveling in the network. Without a feedback suppression mechanism, several warning messages caused by the same broken link would cause a sender to flood the network with several duplicate route refresh messages, consuming resources unnecessarily and causing collision: this is the second implication of the feedback implosion problem. Nodes 2 and 10 have no relationship. It may happen that two nodes with no relationship send warning messages to a source and the two warning messages arrive at the source one right after another. The source would then send out two refresh messages one right after another, although only one refresh message should take care of both warnings. Thus in this case, we also need to make sure that (unrelated) warning messages arriving at a source at a high frequency are suppressed properly to avoid unnecessary flooding that could be worse than the flooding of refresh messages in the original ODMRP algorithm. 5
6 In preemptive unicast routing, the receiver estimates channel condition based on the signal strength of the receive packet, and sends a warning message to the source if needed. In multicast, a route break may affect several receivers. Thus a potential route break should be relayed to the source as quickly as possible: instead of letting receivers estimate channel condition and send feedback, a forwarding (intermediate) node can do that when it detects a potential route break. In summary, when preemptive route maintenance is applied to multicast, the following design issues must be considered: (1) feedback implosion; (2) high frequency of (unrelated) route refresh messages; (3) detection of potential route breaks by intermediate nodes for early feedback. In the next section we describe the PRM protocol that addresses the above design issues. 3 The PMR Protocol In this section we present a preemptive multicast routing protocol based on ODMRP [7]. We chose ODMRP because it is simple yet offers high packet delivery ratio and adapts well to high mobility of nodes. The main disadvantage of ODMRP is high overhead, and thus scalability, caused by the flooding of join requests and join replies. Preemptive routing is exploited to minimize the overhead and improve the scalability of ODMRP. Although preemptive routing is described in the context of ODMRP, it can be applied to other multicast routing algorithms to minimize overhead and/or improve their performance, as will be discussed on Section??. The main idea of applying preemptive routing to ODMRP is to reducing the frequency of flooding the network with JOIN_QUERY packets. Since the interval between route refreshments is now longer, more route breaks and thus packet loss may happen between route refreshments. Potential route breaks will be taken care of by PRM to prevent actual breakage and packet loss. If very few or no route breaks occur, we save overhead on unsent JOIN_QUERY packets. If several route breaks occur between route refreshments, the PRM algorithm is designed so that the frequency of route re-building is the same as the frequency of flooding in the original ODMRP. Thus in the worst-case scenario (e.g., high mobility), the overhead of PRM is similar to that of the original ODMRP. Similar to a preemptive unicast routing protocol, in PRM, when a node receives a data packet, it compares the signal strength from the packet against a threshold value. If the signal 6
7 strength is lower than the threshold, a warning message may be generated and sent to the source. Unlike a preemptive unicast routing protocol, PRM allows intermediate (forwarding) nodes to detect potential route breaks and send warning messages. The reason is to inform the source of the potential route break as early as possible since an actual route break in a multicast group may affect many receivers. We now describe how to solve the problems of feedback implosion and high frequency of unrelated route refresh messages at the source, using the aforementioned examples illustrated by Figure 1. Direct relationship: Link (9, 10) is about to break. Node 10 sends a warning message to the source, and forwards the data packet to 11. Since the signal strength is weak, node 11 would also send a warning message to the source, and so would node 12. To suppress the warnings from 11 and 12, node 10 sets a bit "WarningGenerated" in the header of the data packet. Before nodes 11 and 12 attempt to send a warning, they check the bit and will not send if the bit is set. Indirect relationship: Links (5, 6) and (7, 8) are about to break. Nodes 6 and 8 send warnings to the source. Node 4 will see both messages. If the warnings are received sufficiently far apart, node 4 will forward both to the source. If they arrive soon one after another, the warning message arrives later will be suppressed. That is, if at least MinRefreshInterval seconds has elapsed since the last warning was forwarded to the source S, the current warning is forwarded to S; otherwise it is discarded. No relationship: Links (1,2) and (9,10) are about to break. Nodes 2 and 10 send warnings to the source. The source receives both warning messages. If the warnings are received sufficiently far apart, the source will send a JOIN_QUERY for each warning. If they arrive soon one after another, the warning message arrives later will be ignored. That is, if at least MinRefreshInterval seconds has elapsed since the last JOIN_QUERY was sent by the source, a new JOIN_QUERY is sent in response to the current warning; otherwise the current warning is ignored. Therefore if MinRefreshInterval is set to the value of the JOIN_QUERY refresh interval of ODMRP, then in the worst case scenario (i.e., high mobility and thus many route breaks) route establishment of PRM behaves as the flooding of JOIN_QUERY packets in ODMRP. Following is the detailed description of the PRM protocol that is built on top of ODMRP operations. 7
8 Each data message has a bit WarningGenerated. Each node has a bit SentWarning S for each multicast source S. Each source node has a bit SentJoinRefresh for each multicast group. A sender sends a join query when a timer expires (e.g., every 12 seconds), or when it receives a warning message and its SentJoinRefresh = FALSE. When a node receives a data message from source S with a receiving power below a threshold SignalThreshold, o If SentWarning S = FALSE and WarningGenerated = FALSE, the node (1) creates a control warning message and unicasts to S (using the route defined by the routing tables); (2) sets SentWarning S and WarningGenerated to TRUE; (3) forwards the message to the next nodes. o If SentWarning S = TRUE and WarningGenerated = FALSE, this means that the node just sent a warning to S some short time ago. Thus the node simply sets WarningGenerated to TRUE and forwards the message to the next nodes. o If SentWarning S = FALSE and WarningGenerated = TRUE, this means that another node upstream has sent a warning to S. The current node thus simply sets SentWarning S to TRUE and forwards the message to the next nodes. o If SentWarning S = TRUE and WarningGenerated = TRUE, the node simply forwards the message to the next nodes. When a node receives a warning message destined for a source S, o If SentWarning S = FALSE, the node unicasts the warning message upstream towards the source using its routing table. o If SentWarning S = TRUE, the node simply ignores and discards the warning message (because it just forwarded a warning message to S just some short time ago). When a source S receives a warning message destined for it, o If SentJoinRefresh = FALSE, the source broadcasts a JOIN_REFRESH message and sets SentJoinRefresh to TRUE. o Otherwise, it simply ignores the current warning (since it just sent a JOIN_REFRESH just some short time ago). 8
9 Whenever a node in the forwarding mesh receives a non-duplicated data message or a join refresh, it updates its entries in the routing table. (Note that ODMRP only updates routing table when a join query is received.) The purpose is to keep routing tables up to date, because routing tables are used by both join replies and warning messages. A non-sender node will set its bit SentWarning S to FALSE every MinRefreshInterval seconds (e.g., MinRefreshInterval = 3), OR after a join refresh is received. A sender will set its bit SentJoinRefresh to FALSE every MinRefreshInterval seconds, OR after a join refresh is sent. The next section presents experimental results that show the effectiveness and performance of PRM in comparison with ODMRP. 4 Experimental Results Our experiments are carried out under GloMoSim environment, which provides scalable simulations for wireless networks. We compare the performance of PRM and ODMRP. The refresh intervals of ODMRP are 3 and 30 seconds respectively. In PMR, the minimum warning interval is 6 seconds and the maximum refresh interval is 30 seconds. We have used the following metrics in the comparison: Packet delivery ratio: the ratio of the number of data packets actually delivered to the receivers versus the number of data packets supposed to be received. This metric indicates the effectiveness of a protocol. Total number of packets (control and data) transmitted per data packet delivered: this measure shows the efficiency in terms of channel access. The smaller the value is, the less contention a protocol would cause. We measure the above metrics a functions of node mobility, the number of senders, and the network load. The experiment setting is similar to that in [11]. We used similar setting in order to reproduce the experiments in [11] for verification, and to make a fair comparison of PRM with ODMRP. Specifically, in all the experiments, we modeled a network of 50 mobile hosts placed randomly within a 1,000m x 1,000m area. Radio propagation range for each node was 250m, and channel capacity was 2 Mbps. Each node has an average number of neighbors of 6.8. The duration of each simulation was 600 seconds. Each experiment was run several times using 9
10 different seed numbers, and collected statistics were averaged over those runs. Members of a multicast group were selected with uniform probability among the 50 mobile hosts. The members join the multicast group at the beginning of the simulation and stay until the whole group is terminated. The senders of a multicast group were chosen randomly among the multicast group members, and transmitted at a constant bit rate. The packet size excluding the header size is 512 bytes. The channel and radio model and the medium access control protocol are as described in [11]. 4.2 Mobility Speed In each experiment, the nodes moved constantly with the predefined speed. The speeds were varied from 0 m/sec to 20 m/sec. Moving directions of the nodes were selected randomly; when they reached the simulated terrain boundary, they bounced back and continued to move. In the following experiments, 20 nodes are multicast members and 5 senders each transmit packets at a rate of 2 packets/sec. The results are shown in Figures 2 and 3 and provide the following observations: Fig. 2 10
11 Fig. 3 When mobility is low, PMR and ODMRP_30 give similar delivery rates. The frequency of sending JOIN_QUERY does not make a big difference when node mobility is low. As we expected, PMR has a higher delivery rate than ODMRP_30 when mobility is high, because PMR sends JOIN_QUERY more frequently, when potential route breaks are identified. Unexpectedly, PMR even offers a higher delivery rate than ODMRP_3. The reason is that ODMRP_3 sends a large number of JOIN_QUERY packets, many of which may be unnecessary. These unnecessary JOIN_QUERY packets do not help improve delivery rate, but cause more packets collisions. From Fig. 3, we can see that ODMRP_3 transmits much more packets than PMR, a lot of which are control packets. The ratio R = Total number of packets transmitted per data packet delivered of PMR is a bit higher than that of ODMRP_30. That is due to warning and route refresh packets. But that is the cost for a higher packet delivery ratio PMR gives over ODMRP_ Number of Senders The multicast group size in these experiments is 20 nodes and node mobility speed is at set at 15 m/sec. The network traffic load is controlled at 10 packets/sec. We varied the number of senders in the multicast group from 1 to 20. The simulation results are shown in Figures 4 and 5. 11
12 We can see that PMR offers a higher delivery ratio than ODMRP_3, while the overhead in terms of number of control packets is significantly lower. The packet delivery ratio and overhead of PMR is comparable to those of ODMRP_30. Fig. 4 Fig. 5 12
13 4.4 Traffic Load In this experiment, there were 20 multicast group members, five of which were senders. There was no mobility; thus packet drops were only caused by collision, congestion and buffer overflow. The network traffic load was varied between 1 packet/sec and 50 packets/sec. The results are given in Figure 6. 5 Summary Figure 6 We present design principles for incorporating preemptive route maintenance to a multicast routing protocol. The most important issue is to solve the feedback implosion problem. We apply design principles to built a preemptive multicast routing protocol, PMR, that works in conjunction with ODMRP. Experimental results show that PMR improves the packet delivery ration while reducing the overhead incurred by ODMRP. References [1] Tom Goff, Nael B. Abu-Ghazaleh, Dhananjay S. Phatak, and Ridvan Kahvecioglu, Preemptive Routing in Ad Hoc Networks, Mobile Computing and Networking, [2] Yih-Chun Hu and David B. Johnson, Design And Demonstration Of Live Audio And Video Over Multihop Wireless Ad Hoc Networks, MILCOM
14 [3] P. Abhilash, Srinath Perur and Sridhar Iyer, Router Handoff: An Approach for Preemptive Route Repair in Mobile Ad Hoc Networks, Proc. of High Performance Computing, [4] C. Wu and Y. Tay, AMRIS: A Multicast Protocol for Ad hoc Wireless Networks, Proceedings of IEEE MILCOM '99, Atlantic City, NJ, Nov [5] E. Royer and C. Perkins, Multicast Ad hoc On- Demand Distance Vector (MAODV) Routing, IETF, Intemet Draft: draft-ietf-manet-maodv-00.txt, [6] LAM [7] ODRMP [8] CAMP [9] FGMP [10] B.N. Levine and J.J. Garcia-Luna-Aceves, ``Improving Internet Multicast with Routing Labels, 'Proc. IEEE ICNP '97, Atlanta, Georgia, Oct [11] ODMR comparison paper 14
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 informationEfficient Hybrid Multicast Routing Protocol for Ad-Hoc Wireless Networks
Efficient Hybrid Multicast Routing Protocol for Ad-Hoc Wireless Networks Jayanta Biswas and Mukti Barai and S. K. Nandy CAD Lab, Indian Institute of Science Bangalore, 56, India {jayanta@cadl, mbarai@cadl,
More information3. Evaluation of Selected Tree and Mesh based Routing Protocols
33 3. Evaluation of Selected Tree and Mesh based Routing Protocols 3.1 Introduction Construction of best possible multicast trees and maintaining the group connections in sequence is challenging even in
More informationE-ODMRP: Enhanced ODMRP with Motion Adaptive Refresh
E-: Enhanced with Motion Adaptive Refresh Soon Y. Oh, Joon-Sang Park, and Mario Gerla Computer Science Department, University of California, Los Angeles {soonoh, jspark, gerla}@cs.ucla.edu Abstract On
More informationPerformance Evaluation of Mesh - Based Multicast Routing Protocols in MANET s
Performance Evaluation of Mesh - Based Multicast Routing Protocols in MANET s M. Nagaratna Assistant Professor Dept. of CSE JNTUH, Hyderabad, India V. Kamakshi Prasad Prof & Additional Cont. of. Examinations
More informationMulticast over Vehicle Ad Hoc Networks
1 Multicast over Vehicle Ad Hoc Networks Alberto Gordillo Muñoz Abstract Vehicular networks may improve the safety and efficiency of road travel but there are many challenges that still need to be overcome.
More informationQoS Routing By Ad-Hoc on Demand Vector Routing Protocol for MANET
2011 International Conference on Information and Network Technology IPCSIT vol.4 (2011) (2011) IACSIT Press, Singapore QoS Routing By Ad-Hoc on Demand Vector Routing Protocol for MANET Ashwini V. Biradar
More informationStudy 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 informationContent. 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 informationPerformance Comparison of MANET (Mobile Ad hoc Network) Protocols (ODMRP with AMRIS and MAODV)
Performance Comparison of MANET (Mobile Ad hoc Network) Protocols (ODMRP with AMRIS and MAODV) Aparna K Lecturer, Dept. of Master of Computer Applications BMS Institute of Technology, Bangalore, India.
More informationG.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 informationMulticasting in Ad-Hoc Networks: Comparing MAODV and ODMRP
Multicasting in Ad-Hoc Networks: Comparing MAODV and ODMRP Thomas Kunz and Ed Cheng Carleton University tkunz@sce.carleton.ca Abstract. Multicasting can efficiently support a variety of applications that
More informationUnicast 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 informationROUTE 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 informationA 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 informationPresenting a multicast routing protocol for enhanced efficiency in mobile ad-hoc networks
Presenting a multicast routing protocol for enhanced efficiency in mobile ad-hoc networks Mehdi Jalili, Islamic Azad University, Shabestar Branch, Shabestar, Iran mehdijalili2000@gmail.com Mohammad Ali
More information6. Node Disjoint Split Multipath Protocol for Unified. Multicasting through Announcements (NDSM-PUMA)
103 6. Node Disjoint Split Multipath Protocol for Unified Multicasting through Announcements (NDSM-PUMA) 6.1 Introduction It has been demonstrated in chapter 3 that the performance evaluation of the PUMA
More informationA REVERSE AND ENHANCED AODV ROUTING PROTOCOL FOR MANETS
A REVERSE AND ENHANCED AODV ROUTING PROTOCOL FOR MANETS M. Sanabani 1, R. Alsaqour 2 and S. Kurkushi 1 1 Faculty of Computer Science and Information Systems, Thamar University, Thamar, Republic of Yemen
More informationA 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 informationChapter 7 CONCLUSION
97 Chapter 7 CONCLUSION 7.1. Introduction A Mobile Ad-hoc Network (MANET) could be considered as network of mobile nodes which communicate with each other without any fixed infrastructure. The nodes in
More informationE-ODMRP:Enhanced ODMRP with Motion. Adaptive Refresh
E-ODMRP:Enhanced ODMRP with Motion Adaptive Refresh Soon Y. Oh a,, Joon-Sang Park b, Mario Gerla a a Department of Computer Science, University of California, Los Angeles Los Angeles, CA 90095,USA b Department
More information#$% * #$%+ $ (% Enables community-centric applications: Military and law enforcement. Search and rescue applications.
Enables communitycentric applications: Military and law enforcement Search and rescue applications Foad Hamidi Amir Ali Ghadiri Online gaming Possibly email and file transfer! Limited radio propagation
More informationAODV-PA: AODV with Path Accumulation
-PA: with Path Accumulation Sumit Gwalani Elizabeth M. Belding-Royer Department of Computer Science University of California, Santa Barbara fsumitg, ebeldingg@cs.ucsb.edu Charles E. Perkins Communications
More informationA 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 informationMULTICASTING IN MANET USING THE BEST EFFECTIVE PROTOCOLS
MULTICASTING IN MANET USING THE BEST EFFECTIVE PROTOCOLS 1 R. INDIRANI, 2 ARUCHAMY RAJINI 1 M. Phil Research Scholar, 2 Associate Professor 1&2 PG & Research Department of Computer Science, 1&2 Hindusthan
More informationGateway 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 informationIMPACT OF MOBILITY SPEED ON PROACTIVE AND REACTIVE ROUTING PROTOCOLS IN MOBILE ADHOC NETWORKS
IMPACT OF MOBILITY SPEED ON PROACTIVE AND REACTIVE ROUTING PROTOCOLS IN MOBILE ADHOC NETWORKS E. Gnanamanoharan and R. Bensraj Department of Electrical Engineering, Annamalai University, Tamil Nadu, India
More informationA New Energy Efficient and Scalable Multicasting Algorithm for Hierarchical Networks
International Journal of Engineering Research and Development ISSN: 2278-067X, Volume 1, Issue 5 (June 2012), PP.12-17 www.ijerd.com A New Energy Efficient and Scalable Multicasting Algorithm for Hierarchical
More informationRouting 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 informationApplication Layer Multicasting for Mobile Ad-Hoc Networks with Network Layer Support
Application Layer Multicasting for Mobile Ad-Hoc Networks with Network Layer Support Jayanta Biswas and S. K. Nandy CAD Lab, Indian Institute of Science Bangalore, 0 0, India {jayanta@cadl, nandy@serc}.iisc.ernet.in
More informationA Reliable Broadcast Algorithm with Selected Acknowledgements in Mobile Ad Hoc Networks
A Reliable Broadcast Algorithm with Selected Acknowledgements in Mobile Ad Hoc Networks Wei Lou and Jie Wu Department of Computer Science and Engineering Florida Atlantic University Boca Raton, FL 3343
More informationOn-Demand Multicast Routing Protocol with Multipoint Relay (ODMRP-MPR) in Mobile Ad-Hoc Network
On-Demand Multicast Routing Protocol with Multipoint Relay (ODMRP-MPR) in Mobile Ad-Hoc Network Yao Zhao, Leiming Xu, Meilin Shi Tsinghua University of Computer Science and Technology Email: zyao, xlming,
More informationAnalysis 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 informationRouting 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 informationLECTURE 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 informationPerformance Comparison of Different Multicast Routing Protocols in Mobile Ad-hoc Networks
Performance Comparison of Different Multicast Routing Protocols in Mobile Ad-hoc Networks B. Ravi Prasad Dr.A.Damodaram Dr.G.Venkateswara Rao Research Scholar, CSE Department Professor in CSE Associate
More informationPerformance 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 informationThroughput 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 informationAMRIS: A Multicast Protocol for Ad hoc Wireless Networks
of AMRIS: A Multicast Protocol for Ad hoc Wireless Networks C.W. Wu, Y.C. Tay National University of Singapore wuchunwei@alum.comp.nus.edu.sg,tay@acm.org Abstract This paper introduces AMRIS, a new multicast
More informationMulticast Routing in Wireless Mesh Networks: Minimum Cost Trees or Shortest Path Trees?
Multicast Routing in Wireless Mesh Networks: Minimum Cost Trees or Shortest Path Trees? Uyen Trang Nguyen, Jin Xu Department of Computer Science and Engineering York University, Toronto, Ontario M3J P3,
More informationA Performance Comparison of Multicast Routing Protocols In Ad hoc Networks
A Performance Comparison of Multicast Routing Protocols In Ad hoc Networks Hasnaa MOUSTAFA and Houda LABIOD ENST - INFRES Department - 46 Rue Barrault 75634 Paris cedex 3 Paris - France Tel: +33 ().45.8.74.36
More informationEfficient On-Demand Routing for Mobile Ad-Hoc Wireless Access Networks
Efficient On-Demand Routing for Mobile Ad-Hoc Wireless Access Networks Joo-Han Song, Vincent Wong and Victor Leung Department of Electrical and Computer Engineering The University of British Columbia 56
More informationEvaluating the Performance of a Demand-Driven Multicast Routing Scheme in Ad-Hoc Wireless Networks
Evaluating the Performance of a Demand-Driven Multicast Routing Scheme in Ad-Hoc Wireless Networks Krishna Paul S.Bandyopadhyay & A.Mukherjee D.Saha Cognizant Technology Solutions PricewaterhouseCoopers
More informationPerformance 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 informationQoS-aware Multicast Ad hoc On-Demand Distance Vector Routing
QoS-aware Multicast Ad hoc On-Demand Distance Vector Routing Vida Lashkari. O., Mehdi Dehghan Abstract Ad hoc networking will become a major technology for wireless connectivity beside the multimedia necessity
More informationProbabilistic Mechanism to Avoid Broadcast Storm Problem in MANETS
, pp.479-486 http://dx.doi.org/1.14257/astl.217.147.67 Probabilistic Mechanism to Avoid Broadcast Storm Problem in MANETS G Parimala 1, B Suvarna 2, N Rajeswari 3 and Venkatesulu Dondeti 4 VFSTR University,
More informationA 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 informationPower aware Multi-path Routing Protocol for MANETS
Power aware Multi-path Routing Protocol for MANETS Shruthi P Murali 1,Joby John 2 1 (ECE Dept, SNGCE, India) 2 (ECE Dept, SNGCE, India) Abstract: Mobile Adhoc Network consists of a large number of mobile
More informationVolume 3, Issue 6, June 2015 International Journal of Advance Research in Computer Science and Management Studies
Volume 3, Issue 6, June 2015 International Journal of Advance Research in Computer Science and Management Studies Research Article / Survey Paper / Case Study Available online at: www.ijarcsms.com Analysis
More informationFigure 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 informationOn-Demand Multicast Routing Protocol in Multihop Wireless Mobile Networks
Mobile Networks and Applications 7, 441 453, 2002 2002 Kluwer Academic Publishers. Manufactured in The Netherlands. On-Demand Multicast Routing Protocol in Multihop Wireless Mobile Networks SUNG-JU LEE,
More informationA Protocol for Reducing Routing Overhead in Mobile Ad Hoc Networks
A Protocol for Reducing Routing Overhead in Mobile Ad Hoc Networks Radhu.R.Nair #1 T. K Parani *2 # Student, M.E Communication Systems engineering, Anna University DSCE Coimbatore, India *Assistant professor,
More informationTECHNICAL RESEARCH REPORT
TECHNICAL REEARCH REPORT Multicast Routing in Mobile Ad Hoc Networks Using ource Grouped Flooding by Karthikeyan Chandrashekar, John. Baras CHCN TR 00-6 (IR TR 00-) The Center for atellite and Hybrid Communication
More informationCMPE 257: Wireless and Mobile Networking
CMPE 257: Wireless and Mobile Networking Katia Obraczka Computer Engineering UCSC Baskin Engineering Lecture 10 CMPE 257 Spring'15 1 Student Presentations Schedule May 21: Sam and Anuj May 26: Larissa
More informationEfficient & Robust Multicast Routing Protocol in Mobile Adhoc Network
Efficient & Robust Multicast Routing Protocol in Mobile Adhoc Network Ishwari Singh Rajput Department of Computer Science and Engineering Amity School of Engineering & Technology, Amity University, Noida,
More informationA Performance Study of Reactive Multicast Routing Protocols in Virtual Class Room Using Mobile Ad Hoc Network
Journal of Computer Science 5 (11): 788-793, 2009 ISSN 1549-3636 2009 Science Publications A Performance Study of Reactive Multicast Routing Protocols in Virtual Class Room Using Mobile Ad Hoc Network
More information[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 informationRouting 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 informationHybrid gateway advertisement scheme for connecting mobile ad hoc networks to the Internet
* gateway advertisement scheme for connecting mobile ad hoc networks to the Internet Jeongkeun Lee (), Dongkyun Kim (2), J.J.Garcia-Luna-Aceves (3), Yanghee Choi (), Jihyuk Choi (4), Sangwoo Nam (4) ()
More informationEnhancing the Performance of Mobile Ad Hoc Networks with the Aid of Internet Gateways 1
Enhancing the Performance of Mobile Ad Hoc Networks with the Aid of Internet Gateways 1 Shiv Mehra and Chansu Yu Department of Electrical and Computer Engineering Cleveland State University E-mail: {s.mehra,c.yu91}@csuohio.edu
More informationMobile & Wireless Networking. Lecture 10: Mobile Transport Layer & Ad Hoc Networks. [Schiller, Section 8.3 & Section 9] [Reader, Part 8]
192620010 Mobile & Wireless Networking Lecture 10: Mobile Transport Layer & Ad Hoc Networks [Schiller, Section 8.3 & Section 9] [Reader, Part 8] Geert Heijenk Outline of Lecture 10 Mobile transport layer
More informationKeywords: AODV, MANET, WRP
Performance Analysis of AODV and WRP in MANET Sachchida Nand Singh*, Surendra Verma**, Ravindra Kumar Gupta*** *(Pursuing M.Tech in Software Engineering, SSSIST Sehore(M.P), India, Email: sesachchida@gmail.com)
More informationComparison of MANET Multicast Routing Protocols by Varying Number of Nodes
Comparison of MANET Multicast Routing Protocols by Varying Number of Nodes S.Gayathri Devi Research scholar, PG and Research Department of Computer Science, Governments Arts College (Autonomous), Coimbatore,
More informationMulticasting in Delay Tolerant Networks: Semantic Models and Routing Algorithms
Multicasting in Delay Tolerant Networks: Semantic Models and Routing Algorithms Wenrui Zhao, Mostafa Ammar and Ellen Zegura College of Computing, Georgia Institute of Technology, Atlanta, Georgia 3332
More informationRouting 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 informationCOMPARATIVE STUDY AND ANALYSIS OF AODTPRR WITH DSR, DSDV AND AODV FOR MOBILE AD HOC NETWORK
International Journal of Information Technology and Knowledge Management July-December 2011, Volume 4, No. 2, pp. 531-538 COMPARATIVE STUDY AND ANALYSIS OF AODTPRR WITH DSR, DSDV AND AODV FOR MOBILE AD
More informationEfficient On-Demand Routing for Mobile Ad-Hoc Wireless Access Networks
Efficient On-Demand Routing for Mobile Ad-Hoc Wireless Access Networks Joo-Han Song, Vincent W. S. Wong and Victor C. M. Leung Department of Electrical and Computer Engineering The University of British
More informationBandwidth-Efficient Multicast Routing for Multihop, Ad-Hoc Wireless Networks *
Bandwidth-Efficient Multicast Routing for Multihop, Ad-Hoc Wireless Networks * Tomochika Ozaki Multimedia Systems R & D Division Hitachi, Ltd. 292 Yoshida-cho, Totsuka-ku, Yokohama 244, Japan phone: 81-45-881-1241,
More informationPerformance 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 informationExperiment 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 information1 Multipath Node-Disjoint Routing with Backup List Based on the AODV Protocol
1 Multipath Node-Disjoint Routing with Backup List Based on the AODV Protocol Vahid Zangeneh i and Shahriar Mohammadi ii * ABSTRACT In recent years, routing has been the most focused area in ad hoc networks
More informationANewRoutingProtocolinAdHocNetworks with Unidirectional Links
ANewRoutingProtocolinAdHocNetworks with Unidirectional Links Deepesh Man Shrestha and Young-Bae Ko Graduate School of Information & Communication, Ajou University, South Korea {deepesh, youngko}@ajou.ac.kr
More information28 IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. 5, NO. 1, JANUARY Exploring Mesh and Tree-Based Multicast Routing Protocols for MANETs
28 IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. 5, NO. 1, JANUARY 2006 Exploring Mesh and Tree-Based Multicast Routing Protocols for MANETs Kumar Viswanath, Katia Obraczka, Member, IEEE, and Gene Tsudik
More informationMobility-Aware Ad Hoc Routing Protocols for Networking Mobile Robot Teams
Mobility-Aware Ad Hoc Routing Protocols for Networking Mobile Robot Teams Saumitra M. Das, Member, IEEE, Y. Charlie Hu, Member, IEEE, C. S. George Lee, Fellow, IEEE, and Yung-Hsiang Lu, Member, IEEE 1
More informationPerformance of Routing Protocols in Very Large-Scale Mobile Wireless Ad Hoc Networks
Performance of Routing Protocols in Very Large-Scale Mobile Wireless Ad Hoc Networks Xin Zhang, George F. Riley Department of ECE Georgia Institute of Technology Atlanta, GA 3332-25 xinzhang, riley@ece.gatech.edu
More informationA 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 informationA Novel Rebroadcast Technique for Reducing Routing Overhead In Mobile Ad Hoc Networks
IOSR Journal of Computer Engineering (IOSR-JCE) e-issn: 2278-0661, p- ISSN: 2278-8727Volume 12, Issue 6 (Jul. - Aug. 2013), PP 01-09 A Novel Rebroadcast Technique for Reducing Routing Overhead In Mobile
More informationHigh-Throughput Multicast Routing Metrics in Wireless Mesh Networks
High-Throughput Multicast Routing Metrics in Wireless Mesh Networks Sabyasachi Roy Dimitrios Koutsonikolas Saumitra Das Y. Charlie Hu TR-ECE-05-7 September, 2005 School of Electrical and Computer Engineering
More informationWITH the increase in the bandwidth of wireless channels
2 IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, VOL. 17, NO. 1, JANUARY 2007 Multiple Tree Video Multicast Over Wireless Ad Hoc Networks Wei Wei and Avideh Zakhor, Fellow, IEEE Abstract
More informationPerformance Comparison of Two On-demand Routing Protocols for Ad-hoc Networks based on Random Way Point Mobility Model
American Journal of Applied Sciences 5 (6): 659-664, 2008 ISSN 1546-9239 2008 Science Publications Performance Comparison of Two On-demand Routing Protocols for Ad-hoc Networks based on Random Way Point
More informationPerformance 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 informationOn multicast routing in wireless mesh networks
Available online at www.sciencedirect.com Computer Communications 31 () 135 1399 www.elsevier.com/locate/comcom On multicast routing in wireless mesh networks Uyen Trang Nguyen * Department of Computer
More informationSimulation & 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 informationPerformance 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 informationAn Efficient Group Communication Protocol for Mobile Robots
Proceedings of the 25 IEEE International Conference on Robotics and Automation Barcelona, Spain, April 25 An Efficient Group Communication Protocol for Mobile Robots Saumitra M. Das, Y. Charlie Hu, C.S.
More informationREVIEW 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 informationPoonam kori et al. / International Journal on Computer Science and Engineering (IJCSE)
An Effect of Route Caching Scheme in DSR for Vehicular Adhoc Networks Poonam kori, Dr. Sanjeev Sharma School Of Information Technology, RGPV BHOPAL, INDIA E-mail: Poonam.kori@gmail.com Abstract - Routing
More informationNEIGHBOR ATTACK AND DETECTION MECHANISM IN MOBILE AD-HOC NETWORKS
NEIGHBOR ATTACK AND DETECTION MECHANISM IN MOBILE AD-HOC NETWORKS S. Parthiban 1, A. Amuthan 2, N.Shanmugam 3, K.Suresh Joseph 4 1Sr. Tech. Asst., Department of Computer Science,Pondicherry University
More informationRouting 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 informationAn Efficient Routing Approach and Improvement Of AODV Protocol In Mobile Ad-Hoc Networks
An Efficient Routing Approach and Improvement Of AODV Protocol In Mobile Ad-Hoc Networks Tejomayee Nath #1 & Suneeta Mohanty *2 # School of Computer Engineering, KIIT University Bhubaneswar,, India Abstract
More informationComputation of Multiple Node Disjoint Paths
Chapter 5 Computation of Multiple Node Disjoint Paths 5.1 Introduction In recent years, on demand routing protocols have attained more attention in mobile Ad Hoc networks as compared to other routing schemes
More informationPerformance 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 informationA Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols
A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols By Josh Broch, David A. Maltz, David B. Johnson, Yih- Chun Hu, Jorjeta Jetcheva Presentation by: Michael Molignano Jacob
More informationEnergy-Efficient Coverage and Prolongs Networks Lifetime of MANNET using MTMP
Research Journal of Applied Sciences, Engineering and Technology 6(21): 43-48, 213 ISSN: 24-7459; e-issn: 24-7467 Maxwell Scientific Organization, 213 Submitted: January 25, 213 Accepted: March 21, 213
More informationINTERNATIONAL JOURNAL OF PURE AND APPLIED RESEARCH IN ENGINEERING AND TECHNOLOGY
INTERNATIONAL JOURNAL OF PURE AND APPLIED RESEARCH IN ENGINEERING AND TECHNOLOGY A PATH FOR HORIZING YOUR INNOVATIVE WORK COMPARISON OF MANET REACTIVE ROUTING PROTOCOLS USING OPNET SIMULATOR SANGEETA MONGA
More informationPERFORMANCE 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 informationMobile Ad-Hoc Networks & Routing Algorithms
Mobile Ad-Hoc Networks & Routing Algorithms EMMANOUIL G. SPANAKIS, PhD. spanakis@csd.uoc.gr COLLABORATING RESEARCHER, COMPUTATIONAL BIOMEDICINE LABORATORY, FORTH-ICS VISITING LECTURER, COMPUTER SCIENCE
More informationSurvey on Multicast Routing Protocols in MANETs
Survey on Multicast Routing Protocols in MANETs A Viswanath, Dept of CSE, Sree Vidyanikethan Engineering College, Tirupati, AP, India. N Papanna, M.Tech, Assistant Professor, Sree Vidyanikethan Engineering
More informationImpact of Node Velocity and Density on Probabilistic Flooding and its Effectiveness 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. 12, December 2014,
More informationA Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols. Broch et al Presented by Brian Card
A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols Broch et al Presented by Brian Card 1 Outline Introduction NS enhancements Protocols: DSDV TORA DRS AODV Evaluation Conclusions
More information