针对车联网无线链路中网络节点容易受到攻击和欺骗的问题,提出了一种基于开放式最短路径优先(Open shortest path first,OSPF)的新型安全链路状态路由协议(Secure link state routing protocol,SLSRP)算法。构建了基于动态贝叶斯网络的...针对车联网无线链路中网络节点容易受到攻击和欺骗的问题,提出了一种基于开放式最短路径优先(Open shortest path first,OSPF)的新型安全链路状态路由协议(Secure link state routing protocol,SLSRP)算法。构建了基于动态贝叶斯网络的信任量模型,用于实现节点的身份验证和完整性评价。在标准OSPF的基础上进行了可信化改进,引入了基于组合公钥(Combined public key,CPK)的安全认证技术,实现了新的安全链路状态路由协议。研究结果表明,所提出的算法在网络遭受攻击时,能够及时获取节点可信度的变化,在同等环境中具有更好的动态适应性和时效性,有利于用户选择更安全可信的信息传输路径。展开更多
The exponential growth in the scale of power systems has led to a significant increase in the complexity of dispatch problem resolution,particularly within multi-area interconnected power grids.This complexity necessi...The exponential growth in the scale of power systems has led to a significant increase in the complexity of dispatch problem resolution,particularly within multi-area interconnected power grids.This complexity necessitates the employment of distributed solution methodologies,which are not only essential but also highly desirable.In the realm of computational modelling,the multi-area economic dispatch problem(MAED)can be formulated as a linearly constrained separable convex optimization problem.The proximal point algorithm(PPA)is particularly adept at addressing such mathematical constructs effectively.This study introduces parallel(PPPA)and serial(SPPA)variants of the PPA as distributed algorithms,specifically designed for the computational modelling of the MAED.The PPA introduces a quadratic term into the objective function,which,while potentially complicating the iterative updates of the algorithm,serves to dampen oscillations near the optimal solution,thereby enhancing the convergence characteristics.Furthermore,the convergence efficiency of the PPA is significantly influenced by the parameter c.To address this parameter sensitivity,this research draws on trend theory from stock market analysis to propose trend theory-driven distributed PPPA and SPPA,thereby enhancing the robustness of the computational models.The computational models proposed in this study are anticipated to exhibit superior performance in terms of convergence behaviour,stability,and robustness with respect to parameter selection,potentially outperforming existing methods such as the alternating direction method of multipliers(ADMM)and Auxiliary Problem Principle(APP)in the computational simulation of power system dispatch problems.The simulation results demonstrate that the trend theory-based PPPA,SPPA,ADMM and APP exhibit significant robustness to the initial value of parameter c,and show superior convergence characteristics compared to the residual balancing ADMM.展开更多
现有存储型网络隐蔽信道的研究主要根据不同协议中不同字段来隐藏信息。在众多协议中,例如TCP、UDP协议,对其研究较多,而OSFP使用广泛却在国内研究较少。针对OSPF协议下的Hello报文进行分析可以构建网络隐蔽信道的字段。从所有可能字段...现有存储型网络隐蔽信道的研究主要根据不同协议中不同字段来隐藏信息。在众多协议中,例如TCP、UDP协议,对其研究较多,而OSFP使用广泛却在国内研究较少。针对OSPF协议下的Hello报文进行分析可以构建网络隐蔽信道的字段。从所有可能字段中选择Authentication、Router Dead Interval和Neighbor三个字段分别使用随机值模式、值调制模型和序列模式进行构建三种隐蔽信道,利用微协议技术优化信道,并将三种隐蔽信道组合成一个传输速率更高的隐蔽信道模型。经过验证,该模型具有一定的可行性和隐蔽性,可为存储型网络隐蔽信道构建技术提供一定的理论支持和技术支撑。展开更多
文摘针对车联网无线链路中网络节点容易受到攻击和欺骗的问题,提出了一种基于开放式最短路径优先(Open shortest path first,OSPF)的新型安全链路状态路由协议(Secure link state routing protocol,SLSRP)算法。构建了基于动态贝叶斯网络的信任量模型,用于实现节点的身份验证和完整性评价。在标准OSPF的基础上进行了可信化改进,引入了基于组合公钥(Combined public key,CPK)的安全认证技术,实现了新的安全链路状态路由协议。研究结果表明,所提出的算法在网络遭受攻击时,能够及时获取节点可信度的变化,在同等环境中具有更好的动态适应性和时效性,有利于用户选择更安全可信的信息传输路径。
基金funded by Guangxi Science and Technology Base and Talent Special Project,grant number GuiKeAD20159077Foundation of Guilin University of Technology,grant number GLUTQD2018001.
文摘The exponential growth in the scale of power systems has led to a significant increase in the complexity of dispatch problem resolution,particularly within multi-area interconnected power grids.This complexity necessitates the employment of distributed solution methodologies,which are not only essential but also highly desirable.In the realm of computational modelling,the multi-area economic dispatch problem(MAED)can be formulated as a linearly constrained separable convex optimization problem.The proximal point algorithm(PPA)is particularly adept at addressing such mathematical constructs effectively.This study introduces parallel(PPPA)and serial(SPPA)variants of the PPA as distributed algorithms,specifically designed for the computational modelling of the MAED.The PPA introduces a quadratic term into the objective function,which,while potentially complicating the iterative updates of the algorithm,serves to dampen oscillations near the optimal solution,thereby enhancing the convergence characteristics.Furthermore,the convergence efficiency of the PPA is significantly influenced by the parameter c.To address this parameter sensitivity,this research draws on trend theory from stock market analysis to propose trend theory-driven distributed PPPA and SPPA,thereby enhancing the robustness of the computational models.The computational models proposed in this study are anticipated to exhibit superior performance in terms of convergence behaviour,stability,and robustness with respect to parameter selection,potentially outperforming existing methods such as the alternating direction method of multipliers(ADMM)and Auxiliary Problem Principle(APP)in the computational simulation of power system dispatch problems.The simulation results demonstrate that the trend theory-based PPPA,SPPA,ADMM and APP exhibit significant robustness to the initial value of parameter c,and show superior convergence characteristics compared to the residual balancing ADMM.
文摘现有存储型网络隐蔽信道的研究主要根据不同协议中不同字段来隐藏信息。在众多协议中,例如TCP、UDP协议,对其研究较多,而OSFP使用广泛却在国内研究较少。针对OSPF协议下的Hello报文进行分析可以构建网络隐蔽信道的字段。从所有可能字段中选择Authentication、Router Dead Interval和Neighbor三个字段分别使用随机值模式、值调制模型和序列模式进行构建三种隐蔽信道,利用微协议技术优化信道,并将三种隐蔽信道组合成一个传输速率更高的隐蔽信道模型。经过验证,该模型具有一定的可行性和隐蔽性,可为存储型网络隐蔽信道构建技术提供一定的理论支持和技术支撑。
