(The text models the WSN that supports the coalition game according to coalition game theory. Use the characteristic function to describe the revenue and resource expenditure in the process of sending data by the nodes in the alliance. For large design of possible solution space, the greedy strategy algorithm is used to find the approximate optimal coalition structure according to the characteristic function, and it is concluded that the approximate solution obtained by the algorithm is designed with an acceptable error. The experimental results show that the routing alliance game model proposed in this paper)
收藏
