期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Optimal control of Hilfer fractional stochastic integrodifferential systems driven by Rosenblatt process and Poisson jumps
1
作者 k.ramkumar k.Ravikumar E.M.Elsayed 《Journal of Control and Decision》 EI 2023年第4期538-546,共9页
In this work,the optimal control for a class of Hilfer fractional stochastic integrodifferential systems driven by Rosenblatt process and Poisson jumps has been discussed in infinite dimensional space involving the Hi... In this work,the optimal control for a class of Hilfer fractional stochastic integrodifferential systems driven by Rosenblatt process and Poisson jumps has been discussed in infinite dimensional space involving the Hilfer fractional derivative.First,we study the existence and uniqueness of mild solution results are proved by the virtue of fractional calculus,successive approximation method and stochastic analysis techniques.Second,the optimal control of the proposed problem is presented by using Balder’s theorem.Finally,an example is demonstrated to illustrate the obtained theoretical results. 展开更多
关键词 Hilfer fractional derivative stochastic integrodifferential systems Rosenblatt process Poisson jumps successive approximation optimal control
原文传递
Key Management Using Chebyshev Polynomials for Mobile Ad Hoc Networks 被引量:1
2
作者 k.R.ramkumar Raman Singh 《China Communications》 SCIE CSCD 2017年第11期237-246,共10页
A dedicated key server cannot be instituted to manage keys for MANETs since they are dynamic and unstable. The Lagrange's polynomial and curve fitting are being used to implement hierarchical key management for Mo... A dedicated key server cannot be instituted to manage keys for MANETs since they are dynamic and unstable. The Lagrange's polynomial and curve fitting are being used to implement hierarchical key management for Mobile Ad hoc Networks(MANETs). The polynomial interpolation by Lagrange and curve fitting requires high computational efforts for higher order polynomials and moreover they are susceptible to Runge's phenomenon. The Chebyshev polynomials are secure, accurate, and stable and there is no limit to the degree of the polynomials. The distributed key management is a big challenge in these time varying networks. In this work, the Chebyshev polynomials are used to perform key management and tested in various conditions. The secret key shares generation, symmetric key construction and key distribution by using Chebyshev polynomials are the main elements of this projected work. The significance property of Chebyshev polynomials is its recursive nature. The mobile nodes usually have less computational power and less memory, the key management by using Chebyshev polynomials reduces the burden of mobile nodes to implement the overall system. 展开更多
关键词 chebyshev polynomials INTERPOLATION secret sharing key management
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部