A case for tree evolution in QoS multicasting

Chakrabarti, Anirban; Manimaran, G.

doi:10.1016/j.comcom.2005.12.005

Cited by 4 publications

(3 citation statements)

References 37 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…When a GROW message travels along a link that is not in the multicast tree, we assign green to the message. 4 Only green-GROW messages may form loops, because green-GROW messages join new links to the tree while blue-GROW messages follow existing tree links.…”

Section: Breaking Loopsmentioning

confidence: 99%

“…When an on-tree node receives a green-GROW message, a loop is 4 The green-GROW message will join this link to the multicast tree.…”

Section: Breaking Loopsmentioning

confidence: 99%

“…Efficient ε-approximation solutions for QoS unicast and multicast routing are proposed in [24], but distributed implementation will have prohibitively high message overhead. Gradual migration of core-based trees (CBTs) for QoS multicasting is studied under the concept of tree evolution [4]. However, it only considers the unicast paths from group members to the cores when constructing trees.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

SoMR: A scalable distributed QoS multicast routing protocol

Chen¹,

Shavitt²

2008

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

Many Internet multicast applications such as teleconferencing and remote diagnosis have Quality-of-Service (QoS) requirements. The requirements can be additive (end-to-end delay), multiplicative (loss rate), or of a bottleneck nature (bandwidth). Given such diverse requirements, it is a challenging task to build QoS-constrained multicast trees in a large network where no global network state is available. This paper proposes a scalable QoS multicast routing protocol (SoMR) that supports all three QoS requirement types. SoMR is scalable due to small communication overhead. It achieves favorable tradeoff between routing performance and routing overhead by carefully selecting the network sub-graph in which it searches for a path that can support the QoS requirements. The scope of search is automatically tuned based on the current network conditions. An early-warning mechanism helps detect and route around the long-delay paths in the network. The operations of SoMR are completely decentralized. They rely only on the local state stored at each router.

show abstract

Section: Breaking Loopsmentioning

confidence: 99%

“…When an on-tree node receives a green-GROW message, a loop is 4 The green-GROW message will join this link to the multicast tree.…”

Section: Breaking Loopsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

SoMR: A scalable distributed QoS multicast routing protocol

Chen¹,

Shavitt²

2008

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

show abstract

Analysis of tree‐based multicast routing in wireless sensor networks with varying network metrics

Krishna

Doja²

2012

Int J Communication

View full text Add to dashboard Cite

SUMMARYWireless ad hoc and sensor networks are emerging with advances in electronic device technology, wireless communications and mobile computing with flexible and adaptable features. Routing protocols act as an interface between the lower and higher layers of the network protocol stack. Depending on the size of target nodes, routing techniques are classified into unicast, multicast and broadcast protocols. In this article, we give analysis and performance evaluation of tree‐based multicast routing in wireless sensor networks with varying network metrics. Geographic multicast routing (GMR) and its variations are used extensively in sensor networks. Multicast routing protocols considered in the analytical model are GMR, distributed GMR, demand scalable GMR, hierarchical GMR, destination clustering GMR and sink‐initiated GMR. Simulations are given with comparative analysis based on varying network metrics such as multicast group size, number of sink nodes, average multicast latency, number of clusters, packet delivery ratio, energy cost ratio and link failure rate. Analytical results indicate that wireless sensor network multicast routing protocols operate on the node structure (such as hierarchical, clustered, distributed, dense and sparse networks) and application specific parameters. Simulations indicate that hierarchical GMR is used for generic multicast applications and that destination clustering GMR and demand scalable GMR are used for distributed multicast applications. Copyright © 2012 John Wiley & Sons, Ltd.

show abstract

Core network supported multicast routing protocol for wireless sensor networks

Maddali

2015

IET wirel. sens. syst.

View full text Add to dashboard Cite

Multicast routing protocols improve the network performance by optimising the parameters such as bandwidth, channel utilisation and throughput rate. In wireless sensor network, the primary multicast routing protocol is geographic multicast routing. This study proposes core network supported multicast routing (CNSMR) protocol, a stateful-based distributed multicast routing protocol for sensor networks. The proposed protocol comprises of heterogeneous nodes such as cluster head (CH) nodes, core nodes (CNs) and sensor nodes (SNs). The distinct set of nodes known as CNs have computing, storage and energy resources more than the SNs. CH nodes and CNs form the core network, and CNs with core network and SNs form the core network supported multicast tree. SNs participate in multicast routing supported by the core network and thus save the node energy. Multicast routing in the proposed core network supported multicast trees balance the load in the network and improve the network performance as compared to the existing WSN multicast routing protocols. The proposed CNSMR protocol is compared with the existing WSN multicast routing protocols such as DCME-MR, Intelligent-MR, H-GMR and OnDemand-MR. Simulation results indicate improvements in delay latency, energy save ratio, throughput rate, end-to-end packet delay, multicast control overhead ratio and packet delivery ratio for the proposed protocol.

show abstract

A case for tree evolution in QoS multicasting

Cited by 4 publications

References 37 publications

SoMR: A scalable distributed QoS multicast routing protocol

SoMR: A scalable distributed QoS multicast routing protocol

Analysis of tree‐based multicast routing in wireless sensor networks with varying network metrics

Core network supported multicast routing protocol for wireless sensor networks

Contact Info

Product

Resources

About