Improved heuristics for multicast routing in wireless mesh networks

Multicast is a communication technique that allows a source to transmit data to a set of recipients in an efficient manner. Therefore, the primary objective of a multicast routing protocol would be to minimize number of transmissions to conserve bandwidth. The problem of computing multicast trees wi...

Full description

Saved in:
Bibliographic Details
Published in:Wireless networks Vol. 19; no. 8; pp. 1829 - 1837
Main Authors: Matam, Rakesh, Tripathy, Somanath
Format: Journal Article
Language:English
Published: Boston Springer US 01.11.2013
Springer
Springer Nature B.V
Subjects:
Access methods and protocols, osi model
Algorithms
Analysis
Applied sciences
Bandwidth
Bandwidths
Communication
Communications Engineering
Computer Communication Networks
Computer networks
Computer science; control theory; systems
Computer systems and distributed systems. User interface
Electrical Engineering
Engineering
Exact sciences and technology
Heuristic
Information retrieval. Graph
IT in Business
Military training
Multicast
Networks
Protocol
Radiocommunications
Routing
Routing (telecommunications)
Software
Studies
Telecommunications
Telecommunications and information theory
Teleprocessing networks. Isdn
Theoretical computing
Trees
Wireless networks
Multicast routing
Heuristic based algorithms
Steiner tree
Wireless mesh network
Tree(graph)
Meshed network
Worst case method
Transmission protocol
Routing
Steiner tree problem
Multicast
Bandwidth
Heuristic method
NP complete problem
Wireless network
Routing protocols
ISSN:1022-0038, 1572-8196
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Multicast is a communication technique that allows a source to transmit data to a set of recipients in an efficient manner. Therefore, the primary objective of a multicast routing protocol would be to minimize number of transmissions to conserve bandwidth. The problem of computing multicast trees with minimal bandwidth consumption is similar to Steiner tree problem and has shown to be NP-complete. So, heuristic based algorithms are suitable to approximate such bandwidth optimal trees. This paper proposes a multicast routing protocol based on minimum number of transmission trees using an heuristic approach. The simulation results show that the proposed algorithm offers better performance over existing protocols, even in the worst-case scenario when the set of multicast receivers are sparsely distributed across the network.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:1022-0038
1572-8196
DOI:10.1007/s11276-013-0575-z