PIAGENG 2013: Intelligent Information, Control, and Communication Technology for Agricultural Engineering 2013
DOI: 10.1117/12.2019687
|View full text |Cite
|
Sign up to set email alerts
|

Comparison and analysis of several non-rearranged dynamic multicast routing algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2014
2014
2018
2018

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 0 publications
0
1
0
Order By: Relevance
“…A dynamic multicast height adjusted gathering key assertion (DMHBGKA) that permits a client in a multicast gathering to productively and progressively make the group key and safely convey multicast information from a multicast source to the next multicast source users in wireless ad hoc networks [4]. A dynamic multicast routing and routing optimization criteria have been described by comparing and analysing the advantages and disadvantages of several non-rearranged dynamic multicast algorithms [5].…”
Section: Introductionmentioning
confidence: 99%
“…A dynamic multicast height adjusted gathering key assertion (DMHBGKA) that permits a client in a multicast gathering to productively and progressively make the group key and safely convey multicast information from a multicast source to the next multicast source users in wireless ad hoc networks [4]. A dynamic multicast routing and routing optimization criteria have been described by comparing and analysing the advantages and disadvantages of several non-rearranged dynamic multicast algorithms [5].…”
Section: Introductionmentioning
confidence: 99%