Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.
About 116 papers for “Distance Vector Multicast Routing Protocol”
2008
Abstract — Disaster relief, education, and military are common situations where mobile nodes need to communicate in areas without any preexisting infrastructure. In these situations, MANETs (Mobile Ad-Hoc Networks) are used. When these nodes need one-to-many or many-to-many communication then multicasting is employed. Two of the best multicast protocols,
Cited by 0
Yuan‐Cheng Lai, Ying‐Dar Lin, Wei-Che Yu · International Journal of Communication Systems · 1998
In this paper we propose an enhancement to the Distance Vector Multicast Routing Protocol (DVMRP), called ‘Group Membership Near First DVMRP’ (GMNF-DVMRP), to decrease the network cost (NC) of the multicast tree formed by DVMRP. A simulation is implemented to compare our enhanced version and the original DVMRP. We find that our method saves about 5%–7% of NC of the multicast tree formed by DVMRP. © 1998 John Wiley & Sons, Ltd.
Cited by 1
E.M. Royer, Charles E. Perkins · 1999
An ad-hoc network is the cooperative engagement of a collection of (typically wireless) mobile nodes without the required intervention of any centralized access point or existing infrastructure.
Cited by 1,123Open access
Elizabeth M. Royer, Charles E. Perkins · 1999
The authors present an extension to the Ad-hoc On-demand Distance Vector (AODV) routing protocol [6], which can be used to establish dynamic, self-starting networks among mobile devices. While AODV, like other ad-hoc routing protocols, already supports unicast and broadcast, the extension adds a novel multicast capability which can build and maintain multicast trees as needed.
Cited by 0
Chee‐Onn Chow, Hiroshi Ishii · 2007
We tackle the problem of video multicast over mobile ad hoc networks in this paper using multiple trees multicast routing protocol. More specifically, we propose an extension to the Multicast Ad Hoc On-Demand Distance Vector (MAODV) to construct two highly-disjoint trees in a single routine; we called it Multiple-Tree Multicast Ad Hoc On-Demand Distance Vector (MT-MAODV) routing protocol. By using Multiple Description Coding (MDC) scheme for video coding, the video is divided into two independent sub-streams and is transmitted separately along these trees. This technique is believed to improve the overall quality for best-effort video. Preliminary simulation shows that the proposed MT- MAODV routing protocol provides better video quality as compared to the conventional video multicast using single tree.
Cited by 5
Chee‐Onn Chow, Hiroshi Ishii · IEICE Transactions on Communications · 2008
Video multicast over wireless medium has gained increasing popularity in a wide range of applications, such as video-on-demand and group video conferencing. With mobile ad hoc networks emerging as a promising solution for future ubiquitous communications, supporting reliable video multicast over mobile ad hoc networks is a timely research topic. In this paper we tackle this issue by using multiple tree multicast routing protocol. Specifically, we introduce an extension to the Multicast Ad Hoc On-demand Distance Vector (MAODV) routing protocol to construct two optimally disjoint trees in a single routine. The extended protocol is called Multiple Tree Multicast Ad Hoc On-demand Distance Vector (MT MAODV) routing protocol. In order to distribute the video evenly and independently between these disjoint trees, the Multiple Description Coding (MDC) scheme is used for video coding. Simulation shows that the proposed protocol demonstrates video multicast with better quality than the conventional video multicast using a single tree only.
Cited by 23
Quanxin Zhang, Zhendong Niu, Jianjun Zheng et al. · 2008
The multicast routing protocols used in wire network, such as distance vector multicast routing protocol(DVMRP), multicast open shortest path first(MOSPF), core based tree(CBT), do not run very well in ad hoc network because the dynamic net topology may destroy the distribution tree. Besides, distribution tree usually needs global routing structure. Which produces extra processing cost because the dynamic topology will introduce frequent exchange of routing vector or routing state between nodes. To deal with these problems multicast forwarding group routing protocol (MFGRP) which is based on route grid is designed on basis of dynamic source routing protocol (DSR). MFGRP ensures the multicast packets are sent to destination through dynamic topology network using multicast route grid.
Cited by 1
Shalu Sraw, Gurpreet Singh · 2016
The paper contrast a Multicasting network using PIM-DM (Protocol Independent Multicast- Dense Mode), DVMRP (Distance Vector Multicast Routing Protocol),
Cited by 0
S. Uemo, T. Kato, Kenji Suzuki · 2002
Recently audio and video delivery services are widely spread in the Internet. In order to deliver these data to multiple receivers at the same time, the multicast technologies are indispensable. In such a situation, the performance analysis of multicast traffic will be important in order to design and operate the Internet. Multicast traffic is controlled by its own routing protocol and the multicast routing protocol is more complex than conventional unicast routing protocols. In this paper we propose a new multicast performance analyzer considering distance vector multicast routing protocol (DVMRP) and protocol independent multicast-sparse mode (PIM-SM) routing protocols. It captures messages of a multicast routing protocol as well as multicast IP datagrams. It also analyzes DVMRP and PIM-SM messages in order to investigate the behaviors of multicast IP datagrams and measures the statistics of multicast traffic in detail. This paper describes the detailed design of the multicast performance analyzer and the results of analyzing multicast datagrams transmitted over networks.
Cited by 17
Mustapha Guezouri, Ali Kaddouri · International Journal of Computer Network and Information Security · 2012
This paper focuses on the multicast routing in wireless mesh networks under the 802.11s standard. This standard defines the HWMP (hybrid mesh network protocol) as the protocol of the routing but only unicast and broadcast. Such the standard defines the multicast routing as a goal among several and that the HWMP don't handle multicast messages, this reason motivates us to think about a solution to make the HWMP able to handle multicast routing. We try to resolve the problem by using the bases of MAODV (Multicast Ad-hoc on-demand Distance Vector) protocol for the reason that the HWMP is inspired from AODV (Ad-hoc On-demand Distance Vector) and the MAODV is just an extension of the AODV. The result shows that the scalability of the routing using different number of nodes in the network is excellent. For the mobility it can be agreed since the routers in mesh topology is almost static. Whereas, the rate of message control generated is still very high. In all, the HWMP become able to handle up the multicast messages.
Cited by 1Open access
Chee‐Onn Chow, Hiroaki Nishikawa, Hiroshi Ishii · 2007
Recently, video multicast over wireless medium has gained increasing popularity in a wide range of applications, such as video-on-demand and group video conferencing. As mobile ad hoc networks emerge as a promising solution for future ubiquitous communication, it is a timely research topic to propose a reliable video multicast framework over these networks. In this paper we tackle this issue by using multiple tree multicast routing protocol. Specifically, we introduce an extension to the Multicast Ad Hoc On-Demand Distance Vector (MAODV) to construct two optimally-disjoint trees for a multicast group in a single routine; it is called Multiple Tree Multicast Ad Hoc On-Demand Distance Vector (MT-MAODV) routing protocol. Besides, the video is coded into independent video streams using the Multiple Description Coding (MDC) scheme in order to distribute the encoded video independently between these disjoint trees. Simulation study shows that our proposed routing protocol demonstrates video multicast with better quality than conventional model using single tree.
Cited by 4
Chuck Semeria, Thomas A. Maufer · 1997
The first part of this paper describes the benefits of multicasting, the MBONE, Class D addressing, and the operation of the Internet Group Management Protocol (IGMP). The second section explores a number of different algorithms that may potentially be employed by multicast routing protocols: - Flooding - Spanning Trees - Reverse Path Broadcasting (RPB) - Truncated Reverse Path Broadcasting (TRPB) - Reverse Path Multicasting (RPM) - Core Based Trees The third part contains the main body of the paper. It describes how the previous algorithms are implemented in multicast routing protocols available today. - Distance Vector Multicast Routing Protocol (DVMRP) - Multicast OSPF (MOSPF) - Protocol-Independent Multicast (PIM) Table of Contents Section 1 . . . . . . . . . . . . . . . . . . . . . . . . .
Cited by 56
Fclay Jjg, Clay Shields, J. J. Garcia-luna-aceves · 1997
This paper presents a new protocol, the Ordered Core Based Tree (OCBT) protocol, which remedies several shortcomings of the Core Based Tree (CBT) multicast protocol. We show that the CBT protocol can form loops during periods of routing instability, and that it can consistently fail to build a connected multicast tree, even when the underlying routing is stable. The OCBT protocol provably eliminates these deficiencies and reduces the latency of tree repair following a link or core failure. OCBT also improves scalability by allowing flexible placement of the cores that serve as points of connection to a multicast tree. Simulation results show that the amount of control traffic in OCBT is comparable to that in CBT. 1 Introduction Multicast routing protocols build routing trees for the dissemination of messages to a select group of other stations. In some protocols, such as the Distance Vector Multicast Routing Protocol (DVMRP) [1] and the Protocol Independent Multicast-Dense Mode (PIM-...
Cited by 0
Clay Shields Garcia-Luna-Aceves · 1997
This paper presents a new protocol, the Ordered Core Based Tree (OCBT) protocol, which remedies several shortcomings of the Core Based Tree (CBT) multicast protocol. We show that the CBT protocol can form loops during periods of routing instability, and that it can consistently fail to build a connected multicast tree, even when the underlying routing is stable. The OCBT protocol provably eliminates these deficiencies and reduces the latency of tree repair following a link or core failure. OCBT also improves scalability by allowing flexible placement of the cores that serve as points of connection to a multicast tree. Simulation results show that the amount of control traffic in OCBT is comparable to that in CBT. 1 Introduction Multicast routing protocols build routing trees for the dissemination of messages to a select group of other stations. In some protocols, such as the Distance Vector Multicast Routing Protocol (DVMRP) [1] and the Protocol Independent Multicast-Dense Mode (PIM-...
Cited by 0
Srinivas Sethi, Siba K. Udgata · 2010
Many networking applications such as video-on-demand services, video conferencing, and distributed database replications require multicast communications. Providing scalable and reliable multicast are basic requirements to develop a better routing protocols which is used for disaster management, emergency relief, mobile conferencing among many other applications. As mobile host changes its access point over a time interval, multicast routes have to be updated frequently. This poses several challenges to provide an efficient multicast routing. In this paper, we propose a Scalable Reliable Multicast Ad hoc On Demand Distance Vector (SRMAODV) protocol based on Ad hoc On Demand Distance Vector (AODV) and Multicast AODV (MAODV) protocol to support scalability and reliability for online routing of delivery-guaranteed multicasts. Exhaustive simulation experiments reveal that Packet Delivery Ratio (PDR) which is an important measure of reliability for SRMAODV is much better together with improved end-to-end delay.
Cited by 7
R. Manoharan, E. Ilavarasan · 2011
The advent of ubiquitous computing and the proliferation of portable computing devices have raised the importance of mobile ad-hoc network. A major challenge lies in adapting multicast communication into such environments where mobility and link failures are inevitable. The purpose of this paper is to study impact of mobility models in performance of multicast routing protocols in MANET. In this work, three widely used mobility models such as Random Way Point, Reference Point Group and Manhattan mobility models and three popular multicast routing protocols such as On-Demand Multicast Routing Protocol, Multicast Ad hoc On-demand Distance Vector Routing protocol and Adaptive Demand driven Multicast Routing protocol have been chosen and implemented in NS2. Several experiments have been carried out to study the relative strengths, weakness and applicability of multicast protocols to these mobility models.
Cited by 0
Sami Dahlman · Trepo - Institutional Repository of Tampere University · 2007
Introduction ............................................................................................................................................. 1 1.1 Context of the study........................................................................................................................... 1 2. IP Multicasting ........................................................................................................................................ 2 2.1 Types of multicasting ........................................................................................................................ 5 2.2 Group Management ........................................................................................................................... 5 2.3 Routing .............................................................................................................................................. 6 2.3.1 Distance Vector Multicast Routing Protocol (DVMRP) .........................
Cited by 1Open access
A Suruliandi, T. Sampradeepraj · ICTACT Journal on Communication Technology · 2015
Multicast is a process used to transfer same message to multiple receivers at the same time. This paper presents the simulation and analysis of the performance of six different multicast routing protocols for Wireless Sensor Network (WSN). They are On Demand Multicast Routing Protocol (ODMRP), Protocol for Unified Multicasting through Announcement (PUMA), Multicast Adhoc On demand Distance Vector Protocol (MAODV), Overlay Boruvka-based Adhoc Multicast Protocol (OBAMP), Application Layer Multicast Algorithm (ALMA) and enhanced version of ALMA (ALMA-H) for WSN. Among them, ODMRP, MAODV and PUMA are reactive protocols while OBAMP, ALMA and ALMA-H are proactive protocols. This paper compares the performance of these protocols with common parameters such as Throughput, Reliability, End-to-End delay and Packet Delivery Ratio (PDR) with increasing the numbers of nodes and increasing the speed of the nodes. The main objective of this work is to select the efficient multicast routing protocol for WSN among six multicast routing protocol based on relative strength and weakness of each protocol. The summary of above six multicast routing protocols is presented with a table of different performance characteristics. Experimental result shows that ODMRP attains higher throughput, reliability and higher packet delivery ratio than other multicast routing protocol, while incurring far less end-to-end delay.
Cited by 4Open access
Ola Ashour Mohammed Mohammed · 2024
Current Mobile Ad-hoc Network (MANET) multicasting approaches either suffer from low Packet Delivery Ratio (PDR) or high overhead.These methods rely on metrics like hop count to find the optimal path to the destination.Once the path is selected, all packets are sent over the same path as long as it is available.However, a path that is deemed optimal at a specific instance of time may not retain its optimality at a subsequent moment due to node mobility.Moreover, using a metric like hop count that does not consider link quality can lead to poor PDR, as it can favor an unreliable path over a reliable one just because it is the shortest.To tackle these concerns, Q-Learning Adaptive -Multicast Ad hoc On-Demand Distance Vector Routing (QLA-MAODV) protocol is proposed.It is an adaptive and bandwidthefficient multicast routing protocol based on Q-learning.Unlike traditional methods, QLA-MAODV prioritizes link reliability over simple metrics like hop count, aiming to build a more stable multicast tree.The protocol utilizes the periodic Group Hello (GRPH) messages to explore the environment, identifying alternative paths for use in case of path degradation.The protocol continuously updates path costs, facilitating proactive switching to more reliable paths.Simulations in Network Simulator 3 (NS-3) reveal the protocol's superiority over the traditional Multicast Ad-hoc On-demand Distance Vector (MAODV) protocol.Additionally, it outperforms a modified version, MAODV-Route Reliability (MAODV-RR), that uses link reliability as the routing metric, demonstrating improvement in PDR and reduced multicast-related overhead.Acronyms AMRIS Ad-hoc Multicast Routing protocol utilizing Increasing id-numberS.10 AMRoute Ad-hoc Multicast Routing protocol.10 AODV Ad hoc On-Demand Distance Vector.78 BER Bit Error Rate.35, 36 CAMP Core-Assisted Mesh Protocol.10
Cited by 0Open access
A. Suruliandi, T. Sampradeepraj · SHILAP Revista de lepidopterología · 2015
Multicast is a process used to transfer same message to multiple receivers at the same time. This paper presents the simulation and analysis of the performance of six different multicast routing protocols for Wireless Sensor Network (WSN). They are On Demand Multicast Routing Protocol (ODMRP), Protocol for Unified Multicasting through Announcement (PUMA), Multicast Adhoc On demand Distance Vector Protocol (MAODV), Overlay Boruvka-based Adhoc Multicast Protocol (OBAMP), Application Layer Multicast Algorithm (ALMA) and enhanced version of ALMA (ALMA-H) for WSN. Among them, ODMRP, MAODV and PUMA are reactive protocols while OBAMP, ALMA and ALMA-H are proactive protocols. This paper compares the performance of these protocols with common parameters such as Throughput, Reliability, End-to-End delay and Packet Delivery Ratio (PDR) with increasing the numbers of nodes and increasing the speed of the nodes. The main objective of this work is to select the efficient multicast routing protocol for WSN among six multicast routing protocol based on relative strength and weakness of each protocol. The summary of above six multicast routing protocols is presented with a table of different performance characteristics. Experimental result shows that ODMRP attains higher throughput, reliability and higher packet delivery ratio than other multicast routing protocol, while incurring far less end-to-end delay.
Cited by 0Open access