Technology For Decreasing Transmission Latency In MR~2-MC WMNs

Wireless Mesh Networks (WMNs) develop from the vehicle Ad Hoc Networks(VANET). WMNs have been widely used in people’s production and life. At thesame time, the issues of the study for the WMNs are increasing rapidly. Because ofa large number of researches about WMNs focus in the channel assignment, andchannel assignment is produced from the wireless network characteristics wirelesstransmission. This research is concerning WMNs multicast issue which couldtransform the disadvantage into advantage. This paper about the MR2-MC WMNsmulticast model aims to decrease the total transmission latency to improve theoverall transmission performance.Studies about the MR2-MC multicast latency are generally split into threeclasses of issues: routing policy, channel assignment, multicast scheduling.Difficulty of routing policy lies in a characteristic that in this model the highertransmission rate has a faster attenuation of the signal and a smaller transmissionrange which make researchers to weigh transmission rate and transmission range. Ifthe higher transmission rate with the smaller transmission range bound is chosen,the number of nodes covered is less and the choice affects the transmissionperformance. But the lower transmission rate also impacts the transmissionperformance. The previous researches presented the MO, MD and other outstandingrouting algorithms whose result is a multicast tree. But the resulting which is amulticast tree is too unbalanced, so there is much space for improvement. In thispaper routing tree optimization algorithm (MTOP) for the multicast treeoptimization is proposed. MTOP make the multicast tree more balance to increasethe parallelism and decrease the total latency. This paper presents a multicastscheduling strategy whose input is a channel assigned multicast tree, calledcolor-based multicast tree scheduling policy (CBMTS).Finally, by using the C++, a simulation system of the algorithm is programmed.The system gives the simulation of the existing routing and scheduling strategy, andimplementation of the proposed CBMTS MTOP simulation. The simulation resultcompared the overall latency and the average latency of each node to prove theadvantages of the algorithm in this essay. The article also gives the analysis about inwhich the circumstances the pair of algorithms can play greater advantage.