2007
DOI: 10.1109/mcom.2007.4378324
|View full text |Cite
|
Sign up to set email alerts
|

Multicast Routing in Wireless Mesh Networks: Minimum Cost Trees or Shortest Path Trees?

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
46
0

Year Published

2008
2008
2016
2016

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 75 publications
(46 citation statements)
references
References 6 publications
0
46
0
Order By: Relevance
“…The performance of LMTR 9 was compared with conventional Shortest Path Tree (SPT) 24 and Wireless Closest Terminal Branching (WCTB) 23 algorithms in grid and random topology networks. The traditional algorithms use hop-count as routing metric without considering the problem of load balancing.…”
Section: Lmtrmentioning
confidence: 99%
“…The performance of LMTR 9 was compared with conventional Shortest Path Tree (SPT) 24 and Wireless Closest Terminal Branching (WCTB) 23 algorithms in grid and random topology networks. The traditional algorithms use hop-count as routing metric without considering the problem of load balancing.…”
Section: Lmtrmentioning
confidence: 99%
“…For multicast routing, Nguyen and Xu [14] systematically compared the conventional minimum spanning trees or shortest path trees in wireless meshes. Novel approaches customized for wireless meshes have also been proposed [16] [21] [20].…”
Section: Related Workmentioning
confidence: 99%
“…It is simply the union of the shortest path constructed by Dijkstra's algorithm for each source-destination pair. In [9], the procedure and the shape of the SPT are explained. SPT can be easily exploited in protocols and algorithms because simple request and reply packet flows can detect the shortest path of every node pair.…”
Section: Introductionmentioning
confidence: 99%
“…Recently, [3,9,12,13] suggested that reduction of bandwidth consumption in wireless networks is another key factor to affect the performance of multicast routing trees. Bandwidth consumption can be measured by counting the number of transmissions in a network and each transmission has its own bandwidth requirement.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation