Research On Service Content Deployment Based On Incentive In Mobile Environment

Mobile ad hoc networks can enhance the network performance and improve quality of service on the basis of forwarding packets by cooperation between nodes.However,the limitations of the wireless signal coverage,the power storage capacity and the mobility characteristics of the terminal devices lead to lots of uncertainty of their data acquisition ability.In networks,if the service content is deployed in the appropriate location,the success rate of node data acquisition will be improved.But in reality because nodes are rational,most of nodes will not cooperate with other nodes in deploying service content in the situation of absence of benefits.Therefore,it is necessary to design an effective incentive mechanism to encourage selfish nodes to deploy services content for improving network performance.How to design an effective incentive mechanism,and reduce the cost of deploying service content,and improve the efficiency of user data acquisition,become the research emphasis in this thesis.In this thesis the proposed incentive methods of service content deployment mainly include two aspects:1.With global information,we suggest a virtual credit based incentive method to motivate selfish nodes involved in service content deployment effectively.In this method,each node is in one of two states: busy or idle.And the node will change the state from busy to idle by incentives.On the basis of solving problems of UKM(uncapacitated k-median)and UFL(uncapacitated facility location),we can determine the optimal location and the quantity of service content.2.With local information,we use the method of iterative optimization in r-hops to solve the problems of local UKM and UFL by utilizing the local network topology and node requirements,and determine the quantity and location of service content.Considering the characteristics of node selfishness,and the problem of energy consumption when the node forwarding service content,a reward function based on energy consumption is suggested to reduce the cost of service content deployment during migrating service content as much as possible.Finally,the method for the case of global information is tested in the E-R random graph model,and the method for the case of local information is tested in the E-R random graph model and B-A scale-free random graph model respectively.The experimental results show that the proposed methods can reduce the cost of deploying service content on nodes significantly,promote the cooperation between nodes,and improve the performance of the network.