1 / 29

Multicast Routing in Multi-Radio Multi-Channel Wireless Mesh Networks

Multicast Routing in Multi-Radio Multi-Channel Wireless Mesh Networks. Tehuang Liu and Wanjiun Liao Department of Electrical Engineering National Taiwan University IEEE Transactions on Wireless Communications, vol. 9, no. 10, October 2010. 1. 3. 2. 4. Introduction. Proposed algorithm.

randall-hampton
Download Presentation

Multicast Routing in Multi-Radio Multi-Channel Wireless Mesh Networks

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Multicast Routing in Multi-Radio Multi-Channel Wireless Mesh Networks Tehuang Liu and Wanjiun Liao Department of Electrical EngineeringNational Taiwan University IEEE Transactions on Wireless Communications, vol. 9, no. 10, October 2010

  2. 1 3 2 4 Introduction Proposed algorithm Conclusion Performance Evaluation Outline

  3. Introduction • Wireless mesh networks (WMNs) have received much attention in recent years due to its • low up-front cost • easy network maintenance • robustness • reliable service coverage • Each node • forwards packets in a multi-hop fashion • is stationary and not power-constrained

  4. Introduction • This paperstudies the minimum cost multicast tree (MCMT) problem in MR-MC WMNs. • MR: multi-radio • MC: multi-channel • WMN: wireless mesh network A 1 2 1 2 B L 1 3 4 2 3 2 4 1 3 5 5 3 H J D U 5 5 5 5 assigned channel no.#

  5. Introduction • This paperstudies the minimum cost multicast tree (MCMT) problem in MR-MC WMNs. • Cost: the total consumption of radio resource is determined by the number of nodes that forward the multicast packets A 1 2 1 2 B L 1 3 4 2 3 2 4 1 3 5 5 3 H J D U 5 5 5 5 assigned channel no.#

  6. Introduction • This paperstudies the minimum cost multicast tree (MCMT) problem in MR-MC WMNs. • Cost: the total consumption of radio resource is determined by the number of nodes that forward the multicast packets A 1 2 1 2 B L 1 3 4 2 3 2 4 1 3 This problem is proved to be NP-hard. [12] R. Draves, J. Padhye, and B. Zill, “Routing in multi-radio, multi-hop WMNs,” ACM MOBICOM, 2004. 5 5 3 H J D U 5 5 5 5 assigned channel no.#

  7. Proposed Algorithm Network Model ILP Approximation Algorithm • WCTB // wireless closest terminal branching • Interference consideration • Minimize subject to: • …

  8. Proposed Algorithm – Network model • In a multi-radio Multi-Channel Wireless Mesh Network • Each node is equipped with one or multiple radios • Each radio is tuned to a non-overlapping channel • The channel assignment is given and static • Q: the set of available channels • V: the set of nodes • s: source node, sV • M: the set of terminals, MV A 1 2 1 2 B L 1 3 4 2 3 2 4 1 3 5 5 3 H J D U 5 5 5 5 assigned channel no.#

  9. Proposed Algorithm – ILP • ILP • The optimal solution

  10. Proposed Algorithm – ILP • Objective function channels nodes YA,2=1; YL,4=1; YJ,5=1; YH,5=1;

  11. Proposed Algorithm – ILP • Subject to: multicast tree solution channel assignment XA-L,2=1=cA-L,2 XA-B,2=0<1=cA-B,2

  12. Proposed Algorithm – ILP • Subject to: flow model based 3 – 1 = 2

  13. Proposed Algorithm – ILP • Subject to: flow model based 3 – 1 = 2

  14. Proposed Algorithm – ILP • Subject to: flow model based 3 – 1 = 2

  15. Proposed Algorithm – ILP • Subject to: k=5; 1*1=1 k=5,3; 1*2>1

  16. Proposed Algorithm – ILP • Subject to: YL,4=1 XL-U,4=0 XL-J,4=1

  17. Proposed Algorithm – ILP • ILP • regards the ILP as optimal solution

  18. Proposed Algorithm – Approximation algorithm • WCTB • Wireless Closest Terminal Branching

  19. Proposed Algorithm – Approximation algorithm • WCTB • Wireless Closest Terminal Branching Dijkstra’s algorithm

  20. Proposed Algorithm – Approximation algorithm • WCTB • Wireless Closest Terminal Branching

  21. Proposed Algorithm – Approximation algorithm • WCTB • Wireless Closest Terminal Branching

  22. Proposed Algorithm – Approximation algorithm • Interference consideration weight of interference

  23. Proposed Algorithm – Approximation algorithm • Interference consideration Q w wP-Q,2=2wP-Q,3=1 Dijkstra’s algorithm

  24. Area: 1000 m x 1000 m Source node and terminals are randomly selected Each node has three radios Transmission range: 300m Interference range: 600m Performance Evaluation

  25. |S| :number of multicast sessions = 20 |V| : number of nodes = 31 |M| : number of receivers = 5~30 |Q| : number of channels = 7 Performance Evaluation

  26. |S| :number of multicast sessions = 20 |V| : number of nodes = 21~41 |M| : number of receivers = 15 |Q| : number of channels = 7 Performance Evaluation

  27. |S| :number of multicast sessions = 20 |V| : number of nodes = 31 |M| : number of receivers = 15 |Q| : number of channels = 5~11 Performance Evaluation

  28. |S| :number of multicast sessions = 5~30 |V| : number of nodes = 41 |M| : number of receivers = 10 |Q| : number of channels = 7 Performance Evaluation

  29. Conclusion • This paper tackles the MCMT problem with the consideration of interference between multicast trees in MR-MC WMNs. • ILP • MCTB • Interference consideration T h e E N D Thanks for your attention !

More Related