Survey of Media Access Control (MAC) and Routing Technologies of WiFi-MESH wireless Network <s> BATMAN-adv Routing Protocol and Its Improvement Technologies. <s> In this paper, we describe the performance of the B.A.T.M.A.N advanced (Batman-adv) protocol on an indoor Mesh Potato (MP) test bed. The MPs are small devices used for voice communications over the wireless medium but also supports data. The Batman-adv protocol is designed for ad hocwireless networks. We measure delay, packet loss in order to understand the MPs network performance. The experiments used packets of varying sizes over multiple hops. We analyze the data to see if the network latency for up to four hops is within the recommended boundaries set by ITU Recommendation G. 114. We also observe the how thenetwork's performance is affected by the varying packet sizes. Finally the experiments also reveal the common issues found on the wireless medium and also indoor testbeds. <s> BIB001 </s> Survey of Media Access Control (MAC) and Routing Technologies of WiFi-MESH wireless Network <s> BATMAN-adv Routing Protocol and Its Improvement Technologies. <s> The performance of Wireless Mesh Networks under realistic conditions is not well understood. Given the huge design and parameter space for these networks, all-encompassing performance evaluations are unfeasible. We follow a practical approach and perform a targeted, in-depth investigation of the current state of the BATMAN Advanced (batman-adv) protocol in a realistic office environment, using the thoroughly studied AODV protocol as a baseline. In particular, we study the reachability, packet loss, delay and throughput of the network. We identify the main parameters influencing the routing performance and demonstrate failure modes of the studied protocols. <s> BIB002
BATMAN-adv is a new routing protocol introducing collective intelligence. The basic idea is to counter the boundary effect caused by the network fluctuation and compensate the instability, the new aspect is that the network topology information is maintained by all nodes in the network, and it is very suitable to be applied on the instable wireless mesh network. Many scholars have done practical tests  BIB001  on this routing protocol and compared it with other open source routing protocols. The analysis of such tests proves that this arithmetic performs well in packet loss rate, time delay and network throughput and owns better stability in comparison with HWMP  BIB002 . However, this routing protocol has the problem of slow convergence after the change of the network topology   . Improvement schemes are listed as follows: (1) Optimizing Sending Interval of Originator Message The default setting of OGM sending interval is 1 seconds. Reducing the interval time can speed up the path finding, but it can reduce the bandwidth of the two terminal. It has been found that when sending interval is set to 0.2 seconds  , the tradeoff between convergence and bandwidth would be established. (2) Optimizing Slide Window Mechanism Researchers have found that when the latest serial number of this node has not been completed, if the OGM message is received, the difference between the OGM message and the latest serial number recorded by the node of the node will be calculated to generate error in the window range, and slide window would reset and go into protection period and abandon OGM messages. This phenomenon lowers the rate of convergence. Literature  adds up a switch in charge of checking nodes and the list of local neighborhood. When the list is vacant, close the window protection mechanism; when new neighbors exist, open the mechanism. This method avoid the delay caused by renewing lists of source nodes and raises up the convergence speed of routing process. (3) Optimizing Transmit Quality The fast convergence can be achieved by improving the local TQ, transmission TQ and global TQ calculation method   . In addition, the convergence speed can also be optimized by improving the signal strength and improving the message processing mechanism.