Efficient Multicast Tree Construction in Wireless Mesh Networks

다국어 초록 (Multilingual Abstract)

Multicast routing algorithms designed for wireline networksare not suitable for wireless environments since they cannotefficiently exploit the inherent characteristics of wireless networkssuch as the broadcast advantage. There are many routing protocolstrying to use these advantages to decrease the number of requiredtransmissions or increase the reception probability of data(e.g., opportunistic routing).Reducing the number of transmissionsin a multicast tree directly decreases the bandwidth consumptionand interference and increases the overall throughput of the network.
In this paper, we introduce a distributed multicast routingprotocol for wireless mesh networks called NCast which take intoaccount the data delivery delay and path length when constructingthe tree. Furthermore, it effectively uses wireless broadcast advantageto decrease the number of forwarding nodes dynamicallywhen a new receiver joins the tree.Our simulation results show thatNCast improves network throughput, data delivery ratio and datadelivery delay in comparison with on demand multicast routingprotocol. It is also comparable with multichannel multicast eventhough it does not use channeling technique which eliminates theinterference inherently.

참고문헌 (Reference)

1 N. Nandiraju, "Wireless mesh networks : Current challenges and future directions of web-in-the-sky" 14 : 79-89, 2007

2 W. L. Yang, "The study of interference-free multicast using non-orthogonal channels for multi-radio and multi-channel wireless mesh networks" 547-552, 2010

3 K. Fall, "The ns Manual"

4 R. Novak, "Steiner tree based distributed multicast routing in networks" 1-25, 2000

5 B. Y. Wu, "Spanning trees and optimization problems" CRC Press 65-74, 2003

6 S. Biswas, "Opportunistic routing in multi-hop wireless networks" 34 : 69-74, 2004

7 S. J. Lee, "On-demand multicast routing protocol" 1298-1302, 1999

8 U. T. Nguyen, "On multicast routing in wireless mesh networks" 31 : 1385-1399, 2008

9 S. Sengupta, "Network coding-aware routing in wireless networks" 18 : 1158-1170, 2010

10 D. Mills, "Network Time Protocol Version 4: Protocol and Algorithms Specification" RFC 2010

11 T. Liu, "Multicast routing in multi-radio multi-channel wireless mesh networks" 3031-3039, 2010

12 J. Xu, "Multicast in wireless mesh networks, Master thesis" York Univ 2006

13 N. A. Gdoura, "MeshCAST: A multi-channel mult-interface multicast protocol for mesh networks" 349-354, 2010

14 W. Wang, "MT3-DA: Multicast optimization mechanism based on transmission time and interference minimization inWMNs" 344-349, 2010

15 H. L. Nguyen, "High-performance multicast routing in multi-channel multi-radio wireless mesh networks" 1-6, 2010

16 G. W. Zeng, "Efficient multicast algorithms formultichannel wireless mesh networks" 86-99, 2010

17 A. KHreishah, "Distributed network coding-based opportunistic routing for multicast" 115-124, 2012

18 H. S. Chiu, "Bandwidth-guaranteed multicast in multi-channel multiinterface wireless mesh networks" 1-5, 2009

19 P.M. Ruiz, "Approximating optimal multicast trees in wireless multihope networks" 686-691, 2005

20 A. Zelikovsky, "An 11/6-Approximation Algorithm for the Network Steiner Problem" 9 : 463-470, 1993

21 S. Fellah, "A multicast routing protocol adapted to the characteristics of wireless mesh networks" 174-179, 2010

22 A. S. Akyurek, "A low complexity distributed algorithm for computing minimum-depth multicast trees in wireless networks" 770-783, 2010