Extensive game model for concurrent routing in wireless sensor network

Abstract

In this paper, we propose a non-cooperative, dynamic and extensive game model for routing in a wireless sensor network (WSN). We treat each sensor node as a player who has a strategy to choose from in order to find the route that meets certain objective functions. A multi-hop routing is performed concurrently between multiple source and multiple destination nodes considering signal-to-noise-interference ratio (SINR) as the constraint. The goal to be achieved by each of the player in the game is to minimize the (i) energy consumption and (ii) delay in routing towards the sink nodes. The players choose their strategies independently and selfishly to optimize the energy and delay in routing through the optimal routing path that is guided by SINR values. An experimental study on the SINR values manifests the effect of noise and integrity in communication with varying network conditions. With varying node density, we study the performance of our proposed routing game in terms of packet reception ratio (PRR) and network lifetime. The effectiveness of the dynamic routing game in its extensive regime is also highlighted and the self-imposed Nash equilibrium is ascertained.