Assessment of Beer-Quiché Algorithm with Minmax-Q for Stochastic Multipath Routing in Mobile Ad-Hoc Network

摘要

In an Adhoc, the attackers try to interrupt the data packets being broadcasted in the network between the nodes, which travels from source to destination. To solve this problem, analysis has been made between Beer-Quiche and Minmax-Q theoretical routing model utilized for stochasticmultipath routing in MANETs. In Beer-Quiche initially, the path setup and route selection is regulated using proposed approach. During each stage, the source node tracks the available paths, path residual bandwidth and policy of the attackers, who gathers information from previous stage toprovide an attack. Depending on such selection, the optimal paths are selected by the source node for broadcasting the packets. Further, an optimal routing selection policy is proposed to broadcast the packet to its destination node during each stage of the Beer-Quiche game. In Markov routingmethod multiple paths has been computed between source–destination pairs and selects an energy-efficient path stochastically from those paths to forward the data packets. In addition, this protocol also secures data flow in the network as the packets are forwarded through random pathsfrom the source node to the destination node. The performance analysis and numerical results shows that Beer-Quiche achieves significant performance gains in terms of energy consumption, delay, throughput and security than of Minimax-Q learning based routing.