DocumentCode
3499449
Title
Reducing Multicast Redundancy and Latency in Wireless Mesh Networks
Author
Han, Kai ; Guo, Qingyu
Author_Institution
Sch. of Comput. Sci., Zhongyuan Univ. of Technol., Zhengzhou
Volume
1
fYear
2009
fDate
7-8 March 2009
Firstpage
1075
Lastpage
1079
Abstract
In wireless mesh networks, each node can be equipped with multiple network interface cards tuned to different channels. In this paper, we study the problem of collision-free multicast in multi-interface multi-channel wireless mesh networks. The concept of interface redundancy´s proposed as a new criterion for the multicast redundancy in wireless mesh networks, and we prove that building a multicast tree with the minimum interface redundancy is a NPhard problem. We also prove that the minimum-latency multicasting problem in multi-channel wireless mesh networks is NP-hard. We present two heuristic-based algorithms which jointly reduce the interface redundancy and the multicast latency. Finally, the simulation results prove the effectiveness of our approach.
Keywords
computational complexity; multicast communication; radio networks; NPhard problem; collision-free multicast; heuristic-based algorithms; minimum interface redundancy; minimum-latency multicasting problem; multiinterface multichannel wireless mesh networks; multiple network interface cards; Computer science; Delay; Educational technology; Electronic mail; Heuristic algorithms; Multicast algorithms; Routing; Scheduling algorithm; Throughput; Wireless mesh networks; interface redundancy; latency; multi-channel; multi-interface; multicast; wireless mesh networks;
fLanguage
English
Publisher
ieee
Conference_Titel
Education Technology and Computer Science, 2009. ETCS '09. First International Workshop on
Conference_Location
Wuhan, Hubei
Print_ISBN
978-1-4244-3581-4
Type
conf
DOI
10.1109/ETCS.2009.245
Filename
4958949
Link To Document