Download presentation
Presentation is loading. Please wait.
Published byZoe Johns Modified over 9 years ago
1
1 Maximizing Broadcast and Multicast Traffic Load through Link-Rate Diversity in Wireless Mesh Networks Bao Hua Liu and Chun Tung Chou University of New South Wales, Sydney, Australia Archan Misra IBM T. J. Watson Research Center, Hawthorne, New York, USA ACM WoWMoM 2007
2
2 Outline Introduction Related Works Broadcast and Multicast Algorithm Simulation Conclusion
3
3 Introduction Low deployment cost and greater fault tolerance in Wireless Mesh Networks (WMNs) Traffic load transportable over a multi- hop wireless path continues to be a significant bottleneck IP-TV, streaming of rich sensor feeds from security/traffic cameras and multi- player games are broadcast/multicast consumer applications
4
4 Related Works Title : Low-Latency Broadcast in Multirate Wireless Mesh Networks Authors: C. Chou, A. Misra and J. Qadir From: IEEE JSAC 2006
5
5 Related Works Transmission rate (Mbps)Transmission range (m) 1.0483 2.0370 5.5351 11283
6
6 Related Works
7
7 Related Works _ Topology Construction C = {1} (1,1)=1/1*1=1 (1,8)=1/8*2=0.25 C = {1,7} (1,8)=1/8*2=0.25 (7,1)=1/1*1=1 (7,2)=1/2*2=1 C = {1,7,3} (1,8)=1/8*2=0.25 (7,2)=1/2*2=1 (3,1)=1/1*1=1 (3,8)=1/8*1=0.125 C = {1,7,3,2,4} (1,8)=1/8*2=0.25 (3,8)=1/8*1=0.125 C = {1,7,3,2,4,5,6} (3,8)=1/8*1=0.125 C = {1,7,3,2,4,5,6,8} 2 1 3 4 5 7 6 8 1 8 8 2 28 1 1
8
8 Related Works _ Topology Construction 1 8 8 2 28 1 2 1 3 4 5 7 6 8
9
9 1 8 8 2 28 2 (1,1)=11 (1,8)=8 (7,2)=10 {(1,1)}{(1,1)},{(7,2)} (1,8)=8 (3,8)=8 (1,8)=8 (3,8)=8 {(1,1)},{(7,2)},{(1,8),(3,8)} 2 1 3 4 5 7 6 8
10
10 Goals Multiple broadcast or multicast flows present in a single-channel WMN
11
11 Broadcast and Multicast Algorithm Broadcast Algorithm Four type of weight Greedy Multicast Algorithm
12
12 Broadcast and Multicast Algorithm_ definition V i’ V1 V2 V3 R1 V1,V2,V3 rate ViVi V4 V6 V5
13
13 Broadcast Algorithm V i’ V1 V2 V3 R1 ViVi V4 V6 V5 F j = 10Mbps = 50Mbps = Transmission time fraction(TTF)
14
14 Broadcast Algorithm Each node can transmit at one of the available rates, residual transmission time fraction (RTTF) (1)
15
15 Broadcast Algorithm Weighted Coverage Maximization Algorithm (WCMA) (2) Weighted Maximum RTTF Algorithm (WMRA) (3) RTTF-Aware Coverage Algorithm (RCA) (4)
16
16 Broadcast Algorithm V i’ V1 V2 V3 ViVi V4 V6 V5
17
17 Rate and Contention Aware Multicast V i’ V1 V2 V3 R1 ViVi V4 V6 V5 Cumulative Transmission Time Fraction (CTTF) = 1 if: (v m is a transmitting node for tree T l ) ^ (v m or at least one of the receivers in N(v m, F l ) is within the interference range of v i )
18
18 Rate and Contention Aware Multicast the higher the rate for the edge (va, vb), the smaller should be the link cost 2 3 i’i’ 5 6 4 i 1 7
19
19 Rate and Contention Aware Multicast 2 3 i’i’ 5 6 4 i 1 7
20
20 Simulation
21
21 Simulation
22
22 Simulation
23
23 Simulation
24
24 Simulation
25
25 Simulation
26
26 Simulation SPT is shortest path tree
27
27 Simulation SPT is shortest path tree
28
28 Simulation SPT is shortest path tree
29
29 Simulation SPT is shortest path tree
30
30 Simulation SPT is shortest path tree
31
31 Conclusion combined consideration of link-rate diversity and channel interference can increase the amount of broadcast/multicast traffic load.
Similar presentations
© 2025 SlidePlayer.com. Inc.
All rights reserved.