Rashmi Sharma¹, Nitin Nitin², Deepak Dahiya^3,*

CMC-Computers, Materials & Continua, Vol.72, No.3, pp. 5197-5213, 2022, DOI:10.32604/cmc.2022.025059

Abstract Failure is a systemic error that affects overall system performance and may eventually crash across the entire configuration. In Real-Time Systems (RTS), deadline is the key to successful completion of the program. If tasks effectively meet the deadline, it means the system is working in pristine order. However, missing the deadline means a systemic fault due to which the system can crash (hard RTS) or degrade inclusive performance (soft RTS). To fine-tune the RTS, tolerance is the critical issue and must be handled with extreme care. This article explains the context of fault tolerance with improvised Joint EDF-RMS algorithm in… More >

Adel Rajab^*

Intelligent Automation & Soft Computing, Vol.32, No.3, pp. 1743-1761, 2022, DOI:10.32604/iasc.2022.021922

Abstract Wireless sensor networks (WSN) deploy many nodes over an extended area for traffic surveillance, environmental monitoring, healthcare, tracking wildlife, and military sensing. Nodes of the WSN have a limited amount of energy. Each sensor node collects information from the surrounding area and forwards it onto the cluster head, which then sends it on to the base station (BS). WSNs extend the lifetime of the network through clustering techniques. Choosing nodes with the greatest residual energy as cluster heads is based on the idea that energy consumption is periodically distributed between nodes. The sink node gathers information from its environment that… More >

Neha Malhotra^1,2,*, Manju Bala³

CMC-Computers, Materials & Continua, Vol.70, No.3, pp. 5269-5284, 2022, DOI:10.32604/cmc.2022.020920

Abstract Nodes in a mobile computing system are vulnerable to clone attacks due to their mobility. In such attacks, an adversary accesses a few network nodes, generates replication, then inserts this replication into the network, potentially resulting in numerous internal network attacks. Most existing techniques use a central base station, which introduces several difficulties into the system due to the network's reliance on a single point, while other ways generate more overhead while jeopardising network lifetime. In this research, an intelligent double hashing-based clone node identification scheme was used, which reduces communication and memory costs while performing the clone detection procedure.… More >

Neha Malhotra^1,2,*, Manju Bala³

Intelligent Automation & Soft Computing, Vol.30, No.3, pp. 945-960, 2021, DOI:10.32604/iasc.2021.019082

Abstract In mobile computing systems, nodes in the network take checkpoints to survive failures. Certain characteristics of mobile computing systems such as mobility, low bandwidth, disconnection, low power consumption, and limited memory make these systems more prone to failures. In this paper, a novel minimum process communication-induced checkpointing algorithm that makes full use of the computation ability and implementation of effective stable storage in a mobile computing system is proposed. The said approach initiates by taking spontaneous checkpoints by each node in phase 1 using a logistic function that is specifically used to estimate the time interval between two checkpoints and… More >

Yihuai Liang, Yan Li, Byeong-Seok Shin^*

CMC-Computers, Materials & Continua, Vol.68, No.3, pp. 2825-2842, 2021, DOI:10.32604/cmc.2021.016682

Abstract A centralized trusted execution environment (TEE) has been extensively studied to provide secure and trusted computing. However, a TEE might become a throughput bottleneck if it is used to evaluate data quality when collecting large-scale data in a crowdsourcing system. It may also have security problems compromised by attackers. Here, we propose a scheme, named dTEE, for building a platform for providing distributed trusted computing by leveraging TEEs. The platform is used as an infrastructure of trusted computations for blockchain-based crowdsourcing systems, especially to securely evaluate data quality and manage remuneration: these operations are handled by a TEE group. First,… More >

Nandhini Jembu Mohanram^1,2,*, Gnanasekaran Thangavel³, N. M. Jothi Swaroopan⁴

Computer Systems Science and Engineering, Vol.38, No.2, pp. 215-228, 2021, DOI:10.32604/csse.2021.015027

Abstract Fault tolerance (FT) schemes are intended to work on a minimized and static amount of physical resources. When a host failure occurs, the conventional FT frequently proceeds with the execution on the accessible working hosts. This methodology saves the execution state and applications to complete without disruption. However, the dynamicity of open cloud assets is not seen when taking scheduling choices. Existing optimization techniques are intended in dealing with resource scheduling. This method will be utilized for distributing the approaching tasks to the VMs. However, the dynamic scheduling for this procedure doesn’t accomplish the objective of adaptation of internal failure.… More >

Adnan A. Hnaif^*, Abdelfatah A. Tamimi, Ayman M. Abdalla, Iqbal Jebril

CMC-Computers, Materials & Continua, Vol.68, No.1, pp. 505-519, 2021, DOI:10.32604/cmc.2021.016123

Abstract Many routing protocols, such as distance vector and link-state protocols are used for finding the best paths in a network. To find the path between the source and destination nodes where every node is visited once with no repeats, Hamiltonian and Hypercube routing protocols are often used. Nonetheless, these algorithms are not designed to solve the problem of a node failure, where one or more nodes become faulty. This paper proposes an efficient modified Fault-free Hamiltonian Cycle based on the Hypercube Topology (FHCHT) to perform a connection between nodes when one or more nodes become faulty. FHCHT can be applied… More >

Shayesteh Tabatabaei^1,∗

Computer Systems Science and Engineering, Vol.35, No.6, pp. 477-494, 2020, DOI:10.32604/csse.2020.35.477

Abstract In recent years, the application of WSNs has been remarkably increased and notable developments and advances have been achieved in this regard. In particular, thanks to smart, cheaper and smaller nodes, different types of information can be detected and gathered in different environments and under different conditions. As the popularity of WSNs has increased, the problems and issues related to networks are examined and investigated. As a case in point, routing issue is one of the main challenges in this regard which has a direct impact on the performance of sensor networks. In WSN routing, sensor nodes send and receive… More >

Vankamamidi S. Naresh^1,∗,†, Suryateja S. Pericherla^2,‡, Pilla Sita Rama Murty^3,§, Sivaranjani Reddi^4,¶

Computer Systems Science and Engineering, Vol.35, No.6, pp. 411-421, 2020, DOI:10.32604/csse.2020.35.411

Abstract Healthcare, the largest global industry, is undergoing significant transformations with the genesis of a new technology known as the Internet of Things (IoT). Many healthcare leaders are investing more money for transforming their services to harness the benefits provided by IoT, thereby paving the way for the Internet of Medical Things (IoMT), an extensive collection of medical sensors and associated infrastructure. IoMT has many benefits like providing remote healthcare by monitoring health vitals of patients at a distant place, providing healthcare services to elderly people, and monitoring a large group of people in a region or country for detection and… More >

Huanrong Tang, Yaojing Sun, Jianquan Ouyang^*

Journal of Cyber Security, Vol.2, No.4, pp. 167-182, 2020, DOI:10.32604/jcs.2020.011341

Abstract With the rapid development of blockchain technology, more and more people are paying attention to the consensus mechanism of blockchain. Practical Byzantine Fault Tolerance (PBFT), as the first efficient consensus algorithm solving the Byzantine Generals Problem, plays an important role. But PBFT also has its problems. First, it runs in a completely closed environment, and any node can't join or exit without rebooting the system. Second, the communication complexity in the network is as high as O(n2), which makes the algorithm only applicable to small-scale networks. For these problems, this paper proposes an Optimized consensus algorithm, Excellent Practical Byzantine Fault… More >