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

MAC Layer Multicast: Theory, Approaches and Protocols

TL;DR: Simulation based performance evaluations demonstrate significant improvement in system performance as compared to existing MAC layer multicast strategies.
Proceedings ArticleDOI

AM-SRL: Adaptive Multicast operation of the Supernode-based Reverse Labeling algorithm

TL;DR: The supernode-based reverse labeling algorithm, a quality of service (QoS) routing algorithm for mobile ad hoc networks (MANET), is extended to provide adaptive multicast service and adaptively builds an on-demand multicast mesh by exploiting the hierarchical structure of SRL.
Proceedings ArticleDOI

Geographic multicast routing based sleep scheduling

TL;DR: This paper proposed a novel geographic multicast routing protocol to solve the problem of computational cost, minimize the dissipation of energy and reduce the bandwidth consumption.
Journal ArticleDOI

Delay Guaranteed Bandwidth-Efficient Multicast Routing in Wireless Multi-hop Networks

TL;DR: This paper provides an integer linear programming formulation to minimize the number of transmissions with a guaranteed hop count and preprocessing to solve the aforementioned problem and provides an explanation of the proposed heuristic algorithm and shows its performance and results.
Proceedings ArticleDOI

Weapon and communication systems: modeling the wireless network architecture of land warrior

TL;DR: The input analysis conducted to determine probability distributions used to generate message traffic is described and the development of the simulation model used to determine the scalability of the Land Warrior communications architecture is described.
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)