scispace - formally typeset
Proceedings ArticleDOI

On-demand multicast routing protocol

Reads0
Chats0
TLDR
The protocol, termed ODMRP (on-demand multicast routing protocol), is a mesh-based, rather than a conventional tree-based multicast scheme and uses a forwarding group concept (only a subset of nodes forwards the multicast packets via scoped flooding).
Abstract
This paper presents a novel multicast routing protocol for mobile ad hoc wireless networks. The protocol, termed ODMRP (on-demand multicast routing protocol), is a mesh-based, rather than a conventional tree-based multicast scheme and uses a forwarding group concept (only a subset of nodes forwards the multicast packets via scoped flooding). It applies on-demand procedures to dynamically build routes and maintain multicast group membership. ODMRP is well suited for ad hoc wireless networks with mobile hosts where bandwidth is limited, topology changes frequently, and power is constrained. We evaluate ODMRP's scalability and performance via simulation.

read more

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

Scalable multicasting: the core-assisted mesh protocol

TL;DR: This paper presents the Core-Assessment Mesh Protocol, which uses meshes for data forwarding, and avoids flooding by generalizing the notion of core-based trees introduced for internet multicasting.

Performance Analysis of MANET Routing Protocols in Different Mobility Models

TL;DR: It is suggested that AODV routing protocol can be used under high mobility since it outperforms DSDV, TORA and DSR protocols.
Journal ArticleDOI

An adaptive mesh-based protocol for geocast routing

TL;DR: This paper presents a Geocast Adaptive Mesh Environment for Routing (GAMER) which provides geocast communication in an ad hoc network and concludes that both versions of GAMER improve the transmission accuracy significantly, without increasing the load on the network significantly, when compared to non-adaptive mesh-based geocasts routing approaches.
Journal ArticleDOI

Analyzing control traffic overhead versus mobility and data traffic activity in mobile Ad-Hoc network protocols

TL;DR: A general, parameterized model for analyzing protocol control overhead in mobile ad-hoc networks and allows accurate predictions of which protocol will yield the lowest overhead depending on the node mobility and traffic activity pattern is proposed.

Performance analysis of random-based mobility models in MANET routing protocol.

TL;DR: This research has studied the effect of the different mobile node movement pattern in random-based mobility model group (Random Waypoint Mobility Model, Random Walk Mobility Model and Random Direction Mobility Model) on the performance of Ad hoc On-demand Distance Vector (AODV).
References
More filters
Book

Wireless Communications: Principles and Practice

TL;DR: WireWireless Communications: Principles and Practice, Second Edition is the definitive modern text for wireless communications technology and system design as discussed by the authors, which covers the fundamental issues impacting all wireless networks and reviews virtually every important new wireless standard and technological development, offering especially comprehensive coverage of the 3G systems and wireless local area networks (WLANs).

Dynamic Source Routing in Ad Hoc Wireless Networks.

TL;DR: In this article, the authors present a protocol for routing in ad hoc networks that uses dynamic source routing, which adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently.
Book ChapterDOI

Dynamic Source Routing in Ad Hoc Wireless Networks

TL;DR: This paper presents a protocol for routing in ad hoc networks that uses dynamic source routing that adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently.
Proceedings ArticleDOI

A performance comparison of multi-hop wireless ad hoc network routing protocols

TL;DR: The results of a derailed packet-levelsimulationcomparing fourmulti-hopwirelessad hoc networkroutingprotocols, which cover a range of designchoices: DSDV,TORA, DSR and AODV are presented.
Journal ArticleDOI

An efficient routing protocol for wireless networks

TL;DR: WRP reduces the number of cases in which a temporary routing loop can occur, which accounts for its fast convergence properties and its performance is compared by simulation with the performance of the distributed Bellman-Ford Algorithm, DUAL, and an Ideal Link-state Algorithm.
Related Papers (5)