期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Optimal Overbooking Mechanism in Data Plan Sharing
1
作者 Yaxin Zhao Guangsheng Feng +2 位作者 Bingyang Li Chengbo Wang haibin lv 《国际计算机前沿大会会议论文集》 2019年第1期169-171,共3页
For mobile devices users, the inconvenience caused by the fixed data plans becomes a popular issue. With the help of personal hotspot (pH), however, the smartphone users can share network connection with other users n... For mobile devices users, the inconvenience caused by the fixed data plans becomes a popular issue. With the help of personal hotspot (pH), however, the smartphone users can share network connection with other users nearby. In this paper a data plan sharing platform with reservation mechanism is proposed. The users on this platform can sell their surplus data plan traffic to make profit. A Markov decision process model was formulated and analyzed for data plan sharing platform revenue management through overbooking mechanism. The results of experiment and simulation show that the platform revenue has a considerable growth using this model. 展开更多
关键词 Data-plan SHARING Markov decision process Revenue management OVERBOOKING RESERVATION MECHANISM Dynamic programming
下载PDF
Game theory in network security for digital twins in industry
2
作者 Hailin Feng Dongliang Chen +1 位作者 haibin lv Zhihan lv 《Digital Communications and Networks》 SCIE 2024年第4期1068-1078,共11页
To ensure the safe operation of industrial digital twins network and avoid the harm to the system caused by hacker invasion,a series of discussions on network security issues are carried out based on game theory.From ... To ensure the safe operation of industrial digital twins network and avoid the harm to the system caused by hacker invasion,a series of discussions on network security issues are carried out based on game theory.From the perspective of the life cycle of network vulnerabilities,mining and repairing vulnerabilities are analyzed by applying evolutionary game theory.The evolution process of knowledge sharing among white hats under various conditions is simulated,and a game model of the vulnerability patch cooperative development strategy among manufacturers is constructed.On this basis,the differential evolution is introduced into the update mechanism of the Wolf Colony Algorithm(WCA)to produce better replacement individuals with greater probability from the perspective of both attack and defense.Through the simulation experiment,it is found that the convergence speed of the probability(X)of white Hat 1 choosing the knowledge sharing policy is related to the probability(x0)of white Hat 2 choosing the knowledge sharing policy initially,and the probability(y0)of white hat 2 choosing the knowledge sharing policy initially.When y0?0.9,X converges rapidly in a relatively short time.When y0 is constant and x0 is small,the probability curve of the“cooperative development”strategy converges to 0.It is concluded that the higher the trust among the white hat members in the temporary team,the stronger their willingness to share knowledge,which is conducive to the mining of loopholes in the system.The greater the probability of a hacker attacking the vulnerability before it is fully disclosed,the lower the willingness of manufacturers to choose the"cooperative development"of vulnerability patches.Applying the improved wolf colonyco-evolution algorithm can obtain the equilibrium solution of the"attack and defense game model",and allocate the security protection resources according to the importance of nodes.This study can provide an effective solution to protect the network security for digital twins in the industry. 展开更多
关键词 Digital twins Industrial internet of things Network security Game theory Attack and defense
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部