Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Bordel, Borjaa | Alcarria, Ramónb; * | Martín, Diegoa | Sánchez-de-Rivera, Diegoa
Affiliations: [a] Department of Telematics Engineering, Universidad Politécnica de Madrid, Madrid, Spain | [b] Department of Topographic Engineering and Cartography, Universidad Politécnica de Madrid, Madrid, Spain
Correspondence: [*] Corresponding author: Ramón Alcarria, Department of Topographic Engineering and Cartography, Universidad Politécnica de Madrid, Madrid, Spain. E-mail: [email protected].
Abstract: In future resource constrained systems such as Industry 4.0 and Cyber-Physical Systems, thousands of resource constrained embedded devices communicate in order to reach a common objective. Information, then, is processed and transformed several times since it is acquired at physical level until it is received by user applications. Moreover, usually, each component in an current engineered system has almost no information about the other deployed modules. In that way, any malicious component may severely affect systems through the modification of operation data, as high-level applications can check the validity of received information in a hard way. Therefore, future technological components should only communicate with other trustworthy modules. Typically, solutions to address this problem are based on heavy technologies (such as certificates) which do not fulfil the requirements of embedded devices making up future systems. Thus, in this paper, a light computational solution to calculate the graph representing the trustworthy routes through which an application may obtain information is provided. Systems are represented as directed graphs, and untrustworthy branches are identified based on probability offered by a biparametric stochastic process (which is estimated by means an agent-based solution, consisting of a static and a mobile agent). Untrustworthy paths are also pruned following a hierarchical and scalable process. The proposed solution is based on the execution of some “elemental requests” whose response is known. Using the NS3 simulator, virtualization technologies and TAP bridges, the proposed algorithm is validated in a simulation scenario representing a real deployment.
Keywords: Trust, security, resource constrained environments, graphs, pruning algorithm
DOI: 10.3233/ICA-190604
Journal: Integrated Computer-Aided Engineering, vol. 27, no. 1, pp. 37-56, 2020
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]