Research On Incentive Scheme Based On Social Group Utility Maximization Game In Mobile Networks

With the rapid development of mobile network,people can do a lot of things on their terminal equipment through mobile networks.Mobile users can cooperate with each other to finish tasks.The rapid development of mobile communication technology makes it possible for mobile users to optimize the cooperation among nodes.For example,Device-to-Device(D2D)communication allows to have higher transmission rate and system capacity than traditional transmission techniques so that mobile users can use it to make their interactions more efficiently or help other accomplish tasks.However,considering the resource consumption,mobile users have the selfish nature,which makes them behave selfishly when making choices.They choose the best strategy which maximizes their own utility,leading to poor utility of the whole network.The traditional method forces the users to cooperate with each other by specifying strategies for them.However,this method does not take the users,selfish characteristics into consideration.Therefore,it needs an incentive scheme to enable users to cooperate with each other and maximize network utility while considering the selfish nature of mobile nodes.This work considers two scenarios in mobile networks.One is the caching strategy selection problem for mobile users in D2D network.Cache candidates need incentives to serve for caching.The other problem is choosing the head vehicle in the platoon.Vehicles with good driving manners are motivated to be the platoon head for the safety of the platoon as well as reducing the delay of forming a platoon.This work proposes an incentive scheme to encourage the mobile nodes to participate in the optimization process.This work exerts physical distance and social relationship between mobile users to define their social groups and social group utility functions for each vehicle.The social goup utility maximization(SGUM)game model is also established for this problem,and it shows the existence of Nash equilibrium solution in the game by proving our SGUM is a potential game.It designs a heuristic algorithm to obtain the Nash equilibrium solution.The algorithm gets the optimal result by comparing the nodes'utility under different strategies.Then it evaluates the proposed algorithm and compare it with other schemes with respect to delay,successful ratio and social group utility.The numerical results show that title proposed scheme performs the best with respect to different indexes and it improves 54%social group utility than the selfish scheme.