The Community for Technology Leaders
RSS Icon
Issue No.01 - January (2010 vol.21)
pp: 86-99
Guokai Zeng , Michigan State University, East Lansing
Bo Wang , Michigan State University, East Lansing
Yong Ding , Michigan State University, East Lansing
Li Xiao , Michigan State University, East Lansing
Matt W. Mutka , Michigan State University, East Lansing
The wireless mesh network is an emerging technology that provides high quality service to end users as the "last mile” of the Internet. Furthermore, multicast communication is a key technology for wireless mesh networks. Multicast provides efficient data distribution among a group of nodes. However, unlike other wireless networks, such as sensor networks and MANETs, where multicast algorithms are designed to be energy efficient and to achieve optimal route discovery among mobile nodes, wireless mesh networks need to maximize throughput. This paper proposes two multicast algorithms: the Level Channel Assignment (LCA) algorithm and the Multichannel Multicast (MCM) to improve the throughput for multichannel and multi-interface mesh networks. The algorithms build efficient multicast trees by minimizing the number of relay nodes and total hop count distances of the trees. The algorithms use dedicated channel assignment strategies to reduce the interference to improve the network capacity. We also demonstrate that using partially overlapping channels can further diminish the interference. Furthermore, additional interfaces help to increase the bandwidth, and multiple gateways can further shorten the total hop count distance. Simulations show that those algorithms greatly outperform the single-channel multicast algorithm. We also observe that MCM achieves better throughput and shorter delay while LCA can be realized in distributed manner.
Wireless mesh networks, multicast, multichannel, multi-interface, channel assignment.
Guokai Zeng, Bo Wang, Yong Ding, Li Xiao, Matt W. Mutka, "Efficient Multicast Algorithms for Multichannel Wireless Mesh Networks", IEEE Transactions on Parallel & Distributed Systems, vol.21, no. 1, pp. 86-99, January 2010, doi:10.1109/TPDS.2009.46
[1] , 2009.
[2] http:/, 2009.
[3] J. So and N. Vaidya, “Multi-Channel Mac for Ad Hoc Networks: Handling Multi-Channel Hidden Terminals Using a Single Transceiver,” Proc. ACM MobiHoc, 2004.
[4] K. Ramachandran, E.M. Belding, K. Almeroth, and M. Buddhiko, “Interference-Aware Channel Assignment in Multi-Radio Wireless Mesh Networks,” Proc. IEEE INFOCOM, 2006.
[5] J. Tang, G. Xue, and W. Zhang, “Maximum Throughput and Fair Bandwidth Allocation in Multi-Channel Wireless Mesh Networks,” Proc. IEEE INFOCOM, 2006.
[6] A. Mishra, E. Rozner, S. Banerjee, and W. Arbaugh, “Exploiting Partially Overlapping Channels in Wireless Networks: Turning a Peril into an Advantage,” Proc. ACM/USENIX Internet Measurement Conf., 2005.
[7] A. Mishra, V. Shrivastava, and S. Banerjee, “Partially Overlapped Channels Not Considered Harmful,” Proc. ACM SIGMETRICS/Performance, 2006.
[8] P. Li, N. Scalabrino, Y. Fang, E. Gregori, and I. Chlamtac, “Channel Interference in IEEE 802.11b Systems,” Proc. IEEE Global Telecomm. Conf. (GLOBECOM), 2007.
[9] T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Instroduction to Algorithms. The MIT Press, 2001.
[10], 2009.
[11] E. Royer and C. Perkins, “Multicast Operation of the Ad-Hoc on Demand Distance Vector Routing Protocol,” Proc. ACM MobiCom, 1999.
[12] J. Jetcheva and D.B. Johnson, “Adaptive Demand-Driven Multicast Routing in Multi-Hop Wireless Ad Hoc Networks,” Proc. ACM MobiHoc, 2001.
[13] S. Lee, M. Gerla, and C. Chiang, “On Demand Multicast Routing Protocol,” Proc. IEEE Wireless Comm. and Networking Conf. (WCNC '99), pp. 1313-1317, Aug. 1999.
[14] J.J. Garcia-Luna-Aceves and E.L. Madruga, “The Core-Assisted Mesh Protocol,” IEEE J. Selected Areas in Comm., vol. 17, no. 8, pp.1380-1394, Aug. 1999.
[15] S. Das, B. Manoj, and C. Murthy, “A Dynamic Core Based Multicast Routing Protocol,” Proc. ACM MobiHoc, 2002.
[16] L. Ji and M.S. Corson, “Differential Destination Multicast-A Manet Multicast Routing Protocol for Small Groups,” Proc. IEEE INFOCOM '01, pp. 1192-1201, Apr. 2001.
[17] K. Chen and K. Nahrstedt, “Effective Location-Guided Overlay Multicast in Mobile Ad Hoc Networks,” Int'l J. Wireless and Mobile Computing (IJWMC), vol. 3, 2005.
[18] M. Mauve, H. Fuler, J. Widmer, and T. Lang, “Position-Based Multicast Routing for Mobile Ad Hoc Networks,” Proc. ACM MobiHoc '03, June 2003.
[19] P. Bahl, R. Chandra, and J. Dunagan, “Ssch: Slotted Seeded Channel Hopping for Capacity Improvement in IEEE 802.11 Ad-Hoc Wireless Networks,” Proc. ACM MobiCom, 2004.
[20] Y. Liu and E. Knightly, “Opportunistic Fair Scheduling over Multiple Wireless Channels,” Proc. IEEE INFOCOM, 2003.
[21] A. Tzamaloukas and J.J. Garcia-Luna-Aceves, “A Receiver Initiated Collision-Avoidance Protocol for Multi-Channel Networks,” Proc. IEEE INFOCOM, 2001.
[22] M. Kodialam and T. Nandagopal, “Characterizing the Capacity Region in Multi-Radio Multi-Channel Wireless Mesh Networks,” Proc. ACM MobiCom, 2005.
[23] B. Raman, “Channel Allocation in 802.11-Based Mesh Networks,” Proc. IEEE INFOCOM, 2006.
[24] A. Raniwala, K. Gopalan, and T.-c. Chiueh, “Centralized Channel Assignment and Routing Algorithms for Multi-Channel Wireless Mesh Networks,” ACM Mobile Computing and Comm. Rev., vol. 8, no. 2, pp. 50-65, 2004.
[25] A. Raniwala and T. cker Chiueh, “Architecture and Algorithms for an IEEE 802.11-Based Multi-Channel Wireless Mesh Network,” Proc. IEEE INFOCOM, 2005.
[26] M. Alicherry, R. Bhatia, and L. Li, “Joint Channel Assignment and Routing for Throughput Optimization in Multiradio Wireless Mesh Networks,” Proc. ACM MobiCom, 2005.
[27] R. Draves, J. Padhye, and B. Zill, “Routing in Multi-Radio, Multi-Hop Wireless Mesh Networks,” Proc. ACM MobiCom, 2004.
[28] S. Roy, D. Koutsonikolas, S. Das, and Y.C. Hu, “Highthroughput Multicast Routing Metrics in Wireless Mesh Networks,” Proc. 26th IEEE Int'l Conf. Distributed Computing Systems (ICDCS), 2006.
[29] M. Rabbat, R. Nowak, and M. Coates, “Multiple Source, Multiple Destination Network Tomography,” Proc. IEEE INFOCOM, 2004.
[30] P.N. Klein, “Multiple-Source Shortest Paths in Planar Graphs,” Proc. 16th Ann. ACM-SIAM Symp. Discrete Algorithms, 2005.
[31] D. Eppstein, G.F. Italiano, R. Tamassia, R.E. Tarjan, J. Westbrook, and M. Yung, “Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph,” J. Algorithms, vol. 13, pp. 33-54, 1992.
31 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool