Game Theory Based Construction Efficient Topology in Wireless Sensor Networks

Algorithm 1

Noncooperative MST algorithm.

         Data: node 's one and one-hop and two hop neighborhood list

Output: node 's power range

(1)   

(2)  Construct the undirected, complete graph over with edge weights for all

         . // Initialize each sensor node transmission power to max

(3)  Find a minimum weight spanning tree of

(4)  For all let

(5)  while:   is not strong Nash equilibrium do

(6)  

(7)  for   in ascending neighborhood list of ID do

(8)  select best individual

(9)   if   can connect by Bellman strategy the node with reverses link

(10)

(11) else  

(12) if Bellman profile strategy is NE for the game and pushes dis to join MST on

          A ranking of the sensor nodes, , an opportune moment strategy, , for

(13) endif

(14) endif

(15)

(16) endfor

(17) endwhile