Improved security and routing path learning in MANETs using Beer–Quiche game theoritical model in cloud computing

Abstract

In anAdhoc Cloud as a Service (Adhoc Cloud is used over MANETs), 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, Beer–Quiche theoretical routing model is utilized for stochastic multipath routing in MANETs. 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 to provide an attack. Depending on such selection, the optimal paths are selected by the source node for broadcasting the packets. This is selected using a proper switching mechanism in multiple paths which is established between the source and destination. Further, an optimal routing selection policy is proposed to broadcast the packet to its destination node during each stage of the Beer–Quiche game. The numerical analysis proves that the proposed scheme attains better performance than AODV, AOMDV, CA-AOMDV, FS and MR in terms of reduced end-to-end delay, better residual bandwidth utilization, routing overhead, packet delivery ratio and increased path security. The results shows that the packet transmission has increased nearly to 68%, with 17% reduction in packet delay transmission. This has resulted in reducing the overhead by 25% than the AODV method.