2015
DOI: 10.1016/j.adhoc.2015.05.007
|View full text |Cite
|
Sign up to set email alerts
|

i-QCA: An intelligent framework for quality of service multicast routing in multichannel multiradio wireless mesh networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
23
0
1

Year Published

2016
2016
2019
2019

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 21 publications
(24 citation statements)
references
References 37 publications
0
23
0
1
Order By: Relevance
“…In [43], the authors proposed an I-QCA algorithm to overcome such problem by solving both the multicast routing and channel allocation conjointly based on genetic algorithm. The aim of the scheme is to find a multicast tree with minimum bound interference and the lowest multicast tree.…”
Section: • Distributed Polynomial-time Priority-aware Channel Assignmentmentioning
confidence: 99%
See 2 more Smart Citations
“…In [43], the authors proposed an I-QCA algorithm to overcome such problem by solving both the multicast routing and channel allocation conjointly based on genetic algorithm. The aim of the scheme is to find a multicast tree with minimum bound interference and the lowest multicast tree.…”
Section: • Distributed Polynomial-time Priority-aware Channel Assignmentmentioning
confidence: 99%
“…For the second category, both channel assignment and multicast routing are solved jointly. Most of jointly approaches utilized the evolutionary optimization methods such as tabu-search [52,77], simulated anneal [77] and genetic algorithm [43,74,77]. Their solutions depend on the initial solution and fitness function which is used to compute channel-allocation multicast tree.…”
Section: • Summary Of Joint Multicast Routing With Channel Assignmentmentioning
confidence: 99%
See 1 more Smart Citation
“…More recently, various intelligent computational methods‐based (genetic algorithms, simulated annealing, Tabu search, and particle swarm optimization) QoS multicast routing algorithms have been proposed to find optimal solutions for minimum cost multicast routing problem with more than one constraints …”
Section: Related Workmentioning
confidence: 99%
“…More recently, various intelligent computational methods-based (genetic algorithms, simulated annealing, Tabu search, and particle swarm optimization) QoS multicast routing algorithms have been proposed to find optimal solutions for minimum cost multicast routing problem with more than one constraints. [20][21][22][23][24][25] Another way of classifying multicast routing protocols is whether they are source based or center based. Sourcebased routing protocols either construct SPT rooted at the sender such that the unique path from the sender to a terminal node is the shortest path or build an approximate Steiner tree.…”
Section: Related Workmentioning
confidence: 99%