With the ever-increasing popularity of Internet of Things(IoT),massive enterprises are attempting to encapsulate their developed outcomes into various lightweight Web Application Programming Interfaces(APIs)that can b...With the ever-increasing popularity of Internet of Things(IoT),massive enterprises are attempting to encapsulate their developed outcomes into various lightweight Web Application Programming Interfaces(APIs)that can be accessible remotely.In this context,finding and writing a list of existing Web APIs that can collectively meet the functional needs of software developers has become a promising approach to economically and easily develop successful mobile applications.However,the number and diversity of candidate IoT Web APIs places an additional burden on application developers’Web API selection decisions,as it is often a challenging task to simultaneously ensure the diversity and compatibility of the final set of Web APIs selected.Considering this challenge and latest successful applications of game theory in IoT,a Diversified and Compatible Web APIs Recommendation approach,namely DivCAR,is put forward in this paper.First of all,to achieve API diversity,DivCAR employs random walk sampling technique on a pre-built“API-API”correlation graph to generate diverse“API-API”correlation subgraphs.Afterwards,with the diverse“API-API”correlation subgraphs,the compatible Web APIs recommendation problem is modeled as a minimum group Steiner tree search problem.A sorted set of multiple compatible and diverse Web APIs are returned to the application developer by solving the minimum group Steiner tree search problem.At last,a set of experiments are designed and implemented on a real dataset crawled from www.programmableweb.com.Experimental results validate the effectiveness and efficiency of our proposed DivCAR approach in balancing the Web APIs recommendation diversity and compatibility.展开更多
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.展开更多
Internet of Things (IoT) refers to an infrastructure which enables the forms of com- munication and collaboration between people and things, and between things themselves. In order to improve its performance, we pre...Internet of Things (IoT) refers to an infrastructure which enables the forms of com- munication and collaboration between people and things, and between things themselves. In order to improve its performance, we present a tradeoff between bandwidth and energy con- sumption in the loT in this paper. A service providing model is built to find the relation- ship between bandwidth and energy consump- tion using a cooperative differential game mo- del. The game solution is gotten in the condi- tion of grand coalition, feedback Nash equili- brium and intermediate coalitions and an allo- cation policy is obtain by Shapley theory. The results are shown as follows. Firstly, the per- formance of IoT decreases with the increasing of bandwidth cost or with the decreasing of en- ergy cost; secondly, all the nodes in the IoT com- posing a grand coalition can save bandwidth and energy consumption; thirdly, when the fac- tors of bandwidth cost and energy cost are eq- ual, the obtained number of provided services is an optimised value which is the trade-off between energy and bandwidth consumption.展开更多
言语行为理论是哲学和语言学,特别是语言哲学和语用学的重要理论之一。与言语行为理论有关的诸多著作中,最重要最经典的是奥斯汀的How to Do Things with Words。然而这不是一本易读的书,为此作者分析了该书的脉络,给准备精读该书的读...言语行为理论是哲学和语言学,特别是语言哲学和语用学的重要理论之一。与言语行为理论有关的诸多著作中,最重要最经典的是奥斯汀的How to Do Things with Words。然而这不是一本易读的书,为此作者分析了该书的脉络,给准备精读该书的读者提供一些参考。展开更多
IEEE 802.11ah is a new Wi-Fi standard for sub-1Ghz communications,aiming to address the challenges of the Internet of Things(IoT).Significant changes in the legacy 802.11 standards have been proposed to improve the ne...IEEE 802.11ah is a new Wi-Fi standard for sub-1Ghz communications,aiming to address the challenges of the Internet of Things(IoT).Significant changes in the legacy 802.11 standards have been proposed to improve the network performance in high contention scenarios,the most important of which is the Restricted Access Window(RAW)mechanism.This mechanism promises to increase the throughput and energy efficiency by dividing stations into different groups.Under this scheme,only the stations belonging to the same group may access the channel,which reduces the collision probability in dense scenarios.However,the standard does not define the RAW grouping strategy.In this paper,we develop a new mathematical model based on the renewal theory,which allows for tracking the number of transmissions within the limited RAW slot contention period defined by the standard.We then analyze and evaluate the performance of RAW mechanism.We also introduce a grouping scheme to organize the stations and channel access time into different groups within the RAW.Furthermore,we propose an algorithm to derive the RAW configuration parameters of a throughput maximizing grouping scheme.We additionally explore the impact of channel errors on the contention within the time-limited RAW slot and the overall RAW optimal configuration.The presented analytical framework can be applied to many other Wi-Fi standards that integrate periodic channel reservations.Extensive simulations using the MATLAB software validate the analytical model and prove the effectiveness of the proposed RAW configuration scheme.展开更多
针对数据量剧增的配电物联网中存在的带宽利用率低和业务数据服务质量(quality of service,QoS)难以满足通信需求等问题,提出一种多优先级排队论的带宽分配方法。首先,对感知终端到边缘物联网关的业务数据传输过程进行改进,改进后的传...针对数据量剧增的配电物联网中存在的带宽利用率低和业务数据服务质量(quality of service,QoS)难以满足通信需求等问题,提出一种多优先级排队论的带宽分配方法。首先,对感知终端到边缘物联网关的业务数据传输过程进行改进,改进后的传输过程可根据不同业务数据对QoS的不同要求进行数据优先级的划分,对不同优先级数据设置不同的服务机制;然后,对业务数据传输中的马尔科夫过程进行分析,基于改进后的数据传输过程建立以带宽利用率为目标,丢包率和延时时间为约束的多优先级排队论带宽分配模型;并将所提出的带宽分配方法与传统方法进行对比。结果表明:QoS指标有所改善,而且带宽利用率比传统不分优先级带宽分配方法高9.73%,比弹性系数法高31.17%。最后,探究多优先级排队论带宽分配方法的动态性能,结果表明适当地提高带宽可以改善QoS指标,但要注意带宽增大时所带来的带宽利用率减小问题。合理的带宽分配可以避免资源的浪费。展开更多
Currently,important privacy data of the Internet of Things(IoT)face extremely high risks of leakage.Attackers persistently engage in continuous attacks on terminal devices to obtain private data of crucial importance....Currently,important privacy data of the Internet of Things(IoT)face extremely high risks of leakage.Attackers persistently engage in continuous attacks on terminal devices to obtain private data of crucial importance.Although significant progress has been made in recent years in deep reinforcement learning defense strategies,most defense methods still face problems such as low defense resource allocation efficiency and insufficient defense coordination capabilities.To solve the above problems,this paper constructs a novel adversarial security scenario and proposes a security game model that integrates defense resource allocation and patrol inspection.Regarding the above game model,this paper designs a deep reinforcement learning algorithm named SDSA to calculate its security defense strategy.SDSA calculates the allocation strategy of the best patrolling strategy that is most suitable for the defender by searching the policy on a multi-dimensional discrete action space,and enables multiple defense agents to cooperate efficiently by training a multi-intelligent Dueling Double Deep Q-Network(D3QN)with prioritized experience replay.Finally,the experimental results show that the SDSA-learned security defense strategy can provide a feasible and effective security protection strategy for defenders against attacks compared to the MADDPG and OptGradFP methods.展开更多
文摘With the ever-increasing popularity of Internet of Things(IoT),massive enterprises are attempting to encapsulate their developed outcomes into various lightweight Web Application Programming Interfaces(APIs)that can be accessible remotely.In this context,finding and writing a list of existing Web APIs that can collectively meet the functional needs of software developers has become a promising approach to economically and easily develop successful mobile applications.However,the number and diversity of candidate IoT Web APIs places an additional burden on application developers’Web API selection decisions,as it is often a challenging task to simultaneously ensure the diversity and compatibility of the final set of Web APIs selected.Considering this challenge and latest successful applications of game theory in IoT,a Diversified and Compatible Web APIs Recommendation approach,namely DivCAR,is put forward in this paper.First of all,to achieve API diversity,DivCAR employs random walk sampling technique on a pre-built“API-API”correlation graph to generate diverse“API-API”correlation subgraphs.Afterwards,with the diverse“API-API”correlation subgraphs,the compatible Web APIs recommendation problem is modeled as a minimum group Steiner tree search problem.A sorted set of multiple compatible and diverse Web APIs are returned to the application developer by solving the minimum group Steiner tree search problem.At last,a set of experiments are designed and implemented on a real dataset crawled from www.programmableweb.com.Experimental results validate the effectiveness and efficiency of our proposed DivCAR approach in balancing the Web APIs recommendation diversity and compatibility.
文摘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.
基金ACKNOWLEDGEMENT We gratefully acknowledge anonymous revie- wers who read drafts and made many helpful suggestions. This work was supported by the National Natural Science Foundation of China under Grant No. 61202079 the China Post- doctoral Science Foundation under Grant No. 2013M530526+2 种基金 the Foundation of Beijing En- gineering the Fundamental Research Funds for the Central Universities under Grant No. FRF-TP-13-015A and the Technology Centre for Convergence Networks and Ubiquitous Services.
文摘Internet of Things (IoT) refers to an infrastructure which enables the forms of com- munication and collaboration between people and things, and between things themselves. In order to improve its performance, we present a tradeoff between bandwidth and energy con- sumption in the loT in this paper. A service providing model is built to find the relation- ship between bandwidth and energy consump- tion using a cooperative differential game mo- del. The game solution is gotten in the condi- tion of grand coalition, feedback Nash equili- brium and intermediate coalitions and an allo- cation policy is obtain by Shapley theory. The results are shown as follows. Firstly, the per- formance of IoT decreases with the increasing of bandwidth cost or with the decreasing of en- ergy cost; secondly, all the nodes in the IoT com- posing a grand coalition can save bandwidth and energy consumption; thirdly, when the fac- tors of bandwidth cost and energy cost are eq- ual, the obtained number of provided services is an optimised value which is the trade-off between energy and bandwidth consumption.
基金supported by the Spanish Ministry of Science,Education and Universities,the European Regional Development Fund and the State Research Agency,Grant No.RTI2018-098156-B-C52.
文摘IEEE 802.11ah is a new Wi-Fi standard for sub-1Ghz communications,aiming to address the challenges of the Internet of Things(IoT).Significant changes in the legacy 802.11 standards have been proposed to improve the network performance in high contention scenarios,the most important of which is the Restricted Access Window(RAW)mechanism.This mechanism promises to increase the throughput and energy efficiency by dividing stations into different groups.Under this scheme,only the stations belonging to the same group may access the channel,which reduces the collision probability in dense scenarios.However,the standard does not define the RAW grouping strategy.In this paper,we develop a new mathematical model based on the renewal theory,which allows for tracking the number of transmissions within the limited RAW slot contention period defined by the standard.We then analyze and evaluate the performance of RAW mechanism.We also introduce a grouping scheme to organize the stations and channel access time into different groups within the RAW.Furthermore,we propose an algorithm to derive the RAW configuration parameters of a throughput maximizing grouping scheme.We additionally explore the impact of channel errors on the contention within the time-limited RAW slot and the overall RAW optimal configuration.The presented analytical framework can be applied to many other Wi-Fi standards that integrate periodic channel reservations.Extensive simulations using the MATLAB software validate the analytical model and prove the effectiveness of the proposed RAW configuration scheme.
文摘针对数据量剧增的配电物联网中存在的带宽利用率低和业务数据服务质量(quality of service,QoS)难以满足通信需求等问题,提出一种多优先级排队论的带宽分配方法。首先,对感知终端到边缘物联网关的业务数据传输过程进行改进,改进后的传输过程可根据不同业务数据对QoS的不同要求进行数据优先级的划分,对不同优先级数据设置不同的服务机制;然后,对业务数据传输中的马尔科夫过程进行分析,基于改进后的数据传输过程建立以带宽利用率为目标,丢包率和延时时间为约束的多优先级排队论带宽分配模型;并将所提出的带宽分配方法与传统方法进行对比。结果表明:QoS指标有所改善,而且带宽利用率比传统不分优先级带宽分配方法高9.73%,比弹性系数法高31.17%。最后,探究多优先级排队论带宽分配方法的动态性能,结果表明适当地提高带宽可以改善QoS指标,但要注意带宽增大时所带来的带宽利用率减小问题。合理的带宽分配可以避免资源的浪费。
基金supported by the National Natural Science Foundation of China(62172377,61872205)the Shandong Provincial Natural Science Foundation(ZR2019MF018)the Startup Research Foundation for Distinguished Scholars(202112016).
文摘Currently,important privacy data of the Internet of Things(IoT)face extremely high risks of leakage.Attackers persistently engage in continuous attacks on terminal devices to obtain private data of crucial importance.Although significant progress has been made in recent years in deep reinforcement learning defense strategies,most defense methods still face problems such as low defense resource allocation efficiency and insufficient defense coordination capabilities.To solve the above problems,this paper constructs a novel adversarial security scenario and proposes a security game model that integrates defense resource allocation and patrol inspection.Regarding the above game model,this paper designs a deep reinforcement learning algorithm named SDSA to calculate its security defense strategy.SDSA calculates the allocation strategy of the best patrolling strategy that is most suitable for the defender by searching the policy on a multi-dimensional discrete action space,and enables multiple defense agents to cooperate efficiently by training a multi-intelligent Dueling Double Deep Q-Network(D3QN)with prioritized experience replay.Finally,the experimental results show that the SDSA-learned security defense strategy can provide a feasible and effective security protection strategy for defenders against attacks compared to the MADDPG and OptGradFP methods.