Routing game in wireless network

Abstract

In this paper we have discussed about pricebased reliable routing in wireless AdHoc network. Because of the selfish behavior of the nodes in the network the path chosen is not equilibrium path. We have considered the link cost and reliability of each node. We have studied an algorithm based on link cost, reliability and selfish behavior of nodes. The pricing mechanism involved in this game is pull based routing game, which is destination driven and source mediated. This algorithm is used to find an equilibrium path, if any, taking link cost and reliability as factor. We simulated the original algorithm and analyzed the results. It was observed that source node gave equal reward to all the participating nodes. We proposed an algorithm to increase the gain of the source node by giving different rewards to participating nodes. We also compared the simulation result for both cases.