A matching algorithm for multichannel Ad Hoc medium access control protocol

It is effective to increase the throughput and reduce the delay of ad hoc by concurrently transmitting different packets through distinct channels. Compared with other multichannel medium access control (MAC) protocols, Multiple Rendezvous is more flexible since there are no requirements of external hardware and time synchronization. Considering that as the overloads of handling deadlock, waiting and matching increase, the performance of multichannel ad hoc network is reduced by broadcasting, Matching Algorithm for Multiple Rendezvous (MAMR) is proposed. According to broadcast requirements, it is converged to a stable state without collision or deadlock. It has the characteristics that only broadcast nodes' degrees are greater than 1, and there exists no edge between broadcast nodes. It is proved that the algorithm stabilizes at most 4m moves on a network with m edges. Under the condition that the set of broadcast nodes is presented before the initial state, a maximal match is reached; under the condition of no broadcast node, the algorithm is equivalent to Hsu and Huang's self-stabilizing algorithm for maximal matching. Simulation results show that the performance of MAXimal Matching multichannel (MAXM) and Busy Tone Multichannel (BTMC) protocols are increased by 10% by using MAMR when 5% of transmission packets are required for broadcasting.