Multicast routing is one of the most important services in Multi Radio Multi Channel (MRMC) Wireless Mesh Networks (WMN). Multicast routing performance in WMNs could be improved by choosing the best routes and the routes that have minimum interference to reach multicast More
Multicast routing is one of the most important services in Multi Radio Multi Channel (MRMC) Wireless Mesh Networks (WMN). Multicast routing performance in WMNs could be improved by choosing the best routes and the routes that have minimum interference to reach multicast receivers. In this paper we want to address the multicast routing problem for a given channel assignment in WMNs. The channels that are assigned to the network graph are given to the algorithm as an input. To reduce the problem complexity and decrease the problem size, we partition the network to balanced clusters. Fuzzy logic is used as a tool for clustering in our method. After clustering and electing most suitable nodes as cluster head, we take a mathematical method to solve the multicast tree construction problem. We conducted several simulations to verify the performance of our method and the simulation results demonstrated that our proposed method outperforms CAMF algorithm in terms of throughput and end to end delay.
Manuscript profile
Many appealing multicast services such as on-demand TV, teleconference, online games and etc. can benefit from high available bandwidth in multi-radio multi-channel wireless mesh networks. When multiple simultaneous transmissions use a similar channel to transmit data p More
Many appealing multicast services such as on-demand TV, teleconference, online games and etc. can benefit from high available bandwidth in multi-radio multi-channel wireless mesh networks. When multiple simultaneous transmissions use a similar channel to transmit data packets, network performance degrades to a large extant. Designing a good multicast tree to route data packets could enhance the performance of the multicast services in such networks. In this paper we want to address the problem of multicast routing in multi-radio multi-channel wireless mesh networks aiming at minimizing intermediate nodes. It is assumed that channel assignment is known at prior and channels are assigned to the links in advance. Aiming at constructing multicast tree with minimum number of intermediate nodes and minimum number of interfered nodes we propose a heuristic algorithm called Maximum Multicast Group Nodes (MMGN). Simulation results demonstrated that our proposed method outperforms LC-MRMC algorithm in terms of throughput and packet delivery ratio.
Manuscript profile
