×
The submission system is temporarily under maintenance. Please send your manuscripts to
Go to Editorial ManagerEnergy consumption problems in wireless sensor networks are an essential aspect of our days where advances have been made in the sizes of sensors and batteries, which are almost very small to be placed in the patient's body for remote monitoring. These sensors have inadequate resources, such as battery power that is difficult to replace or recharge. Therefore, researchers should be concerned with the area of saving and controlling the quantities of energy consumption by these sensors efficiently to keep it as long as possible and increase its lifetime. In this paper energy-efficient and fault-tolerance strategy is proposed by adopting the fault tolerance technique by using the self-checking process and sleep scheduling mechanism for avoiding the faults that may cause an increase in power consumption as well as energy-efficient at the whole network. this is done by improving the LEACH protocol by adding these proposed strategies to it. Simulation results show that the recommended method has higher efficiency than the LEACH protocol in power consumption also can prolong the network lifetime. In addition, it can detect and recover potential errors that consume high energy.
Blockchain innovation is gaining attention in fields like monetary exchange, edge computing, medical care, and datasecurity. Consortium chains, using lightweight consensus algorithms like PBFT, offer alternatives to proof-based mechanisms while maintaining decentralization, security, and scalability. However, it also has some limitations and challenges that need to be addressed to improve its performance and scalability. PBFT is a classical algorithm with high complexity due to three-stage broadcasting and arbitrary selection of master nodes. Its communication efficiency is low, and scalability issues arise when nodes are large, causing significant delays and performance degradation in unstable networks. Furthermore, the requirement for every node to bundle, check, and broadcast the exchange list in the pre-prepared, prepared and commit stages diminishes the efficiency of consensus and performance between nodes and comes down on network correspondence. The research proposes a new methodology for the consensus algorithm, focusing on high-trust nodes to protect the network from malicious actors and reducing computational overhead and latency by eliminating Byzantian nodes and grouping the remaining nodes into groups, each of which has a main node selected based on a higher trust score. According to the results, the suggested methodology leads to significant improvements in communication complexity and Byzantine fault tolerance compared to standard PBFT networks and previous works. This indicates a substantial enhancement in network efficiency and scalability, offering promising prospects for blockchain applications in various fields.