排序方式: 共有7条查询结果,搜索用时 15 毫秒
1
1.
2.
3.
To fulfill their safety requirements, modern embedded systems are increasingly often expected to deliver a guaranteed minimum level of functionality at all times. In practice, such fail-operational systems are often based on fault tolerance mechanisms that are inadequate for use in cost-driven environments such as the automotive domain. In this work, we consider safety-critical embedded systems with a certain degree of spare resources at the system level and propose a cost-efficient fault tolerance approach that protects a pair of execution units from severe hardware faults. The concept requires no replication of an execution unit. Instead, it employs a state-preserving proxy unit that communicates with low-level devices such as sensors or actuators and handles faults of one execution unit by dynamically migrating the safety-critical portion of its functionality to the redundant counterpart. Based on the application of this concept to an example scenario from the automotive domain, we analyze the resource overhead of the proxy unit and evaluate both the achieved fault handling time and the generated computational overhead experimentally. 相似文献
4.
Physical Unclonable Function (PUF) generates a unique identifier of a device, based on variations during a manufacturing process. Such identifier is difficult to predict or clone. It is used usually as a cipher key. Its weakness is, in general, a high sensitivity to changes in environmental conditions. In order to ensure stability, post-processing methods with error correction codes are usually applied. Unfortunately, these methods reveal, in many cases, sensitive data. We present a novel way to apply error correction code for the PUF. It is called Code Word Masking construction. This construction allows to generate PUF response in more secure way. Helper data are formed just by properly selecting PUF response bits. Therefore, helper data do not leak sensitive information. The selection is performed according to code words of the error correction code used. The method can be used for any type of weak PUF and many types of error correction codes. The error correction capability of the construction depends only on the capability of the error correction code. We describe this construction, and present an example of the PUF implementation based on the non-initialized values of the static random access memory using a 32-bit microcontroller. The implementation is more secure and has lower entropy loss compared to existing solutions. The reliability of the solution was proved through measurements under various environmental conditions. The implementation is improved by identifying and excluding the unreliable (’dark’) bits. 相似文献
5.
影响核辐射监测站点辐射监测HPIC剂量率实时数据准确性的组成因素多且复杂,如自然因素的降雨、温湿度、风向及太阳辐射等,客观因素的设备异常及放射性状况等;以致在实际应用中发现辐射监测状态异常时,很难分析出是什么原因导致的监测数据偏离.结合ERMS海量历史辐射序列监测数据,深入挖掘降雨、温湿度、气压、风向、太阳辐射天顶方向电子量及周边各站点辐射数值等特征因子集,基于Gradient Boosting算法(简称GB算法)建立起HPIC剂量率辐射数据的在线预测模型,有效融合自然特征因子,降低了自然因子对HPIC剂量率辐射监测数值异常的分析及判读的干扰作用,提高了对ERMS辐射异常发现的辅助判断能力及维保效率. 相似文献
6.
Several applications of Internet of Things (IoT) have hundreds of nodes, and the expansibility and flexibility of the network can be greatly improved if the nodes can address themselves automatically and dynamically.Existing nodes addressing methods are mainly based on the logical relationships between nodes and routers. In this paper, the automatic geographic-sensing addressing method is studied for end-node (sensor/actuator) without satellite positioning device (such as global positioning system or Beidou system) for the application of IoT deployed in a linear area. The nodes ID is determined by its geographical location, which is very important for location-based routing and transmitting strategies. First, a sniffer method is designed to realize automatic addressing in an ideal state. Then, according to the actual application scenario, two distributed ID estimation algorithms based on received signal strength indicator(RSSI) and ranging are proposed. Through the deployment of LoRa-2.4 GHz wireless node for testing, results show that when the deployment distance between nodes is greater than twice the ranging error, the reliability of our algorithm can be guaranteed. 相似文献
7.
1