Multiaccess edge computing (MEC) network, as one of the key infrastructures of IoT, provides cloud computing capabilities at the edge of the radio access network (RAN) by integrating telecommunication and IT services....
详细信息
Multiaccess edge computing (MEC) network, as one of the key infrastructures of IoT, provides cloud computing capabilities at the edge of the radio access network (RAN) by integrating telecommunication and IT services. Integrating blockchain into the MEC network can provide users with secure, private, and traceable edge computing services at the near end, thereby improving IoT security, privacy, and automated use of resources. Due to some characteristics of the MEC network, there are still some challenges to integrate blockchain and edge computing into one system, especially the consensus algorithm of blockchain. The resources of edge computing nodes are limited, and the scale of the network is constantly expanding. Therefore, the blockchain consensus algorithm for the MEC network should occupy as little computing resources as possible, be green, and be permissionless. This article proposes a permissionless and scalable consensus algorithm "Hedera" for MEC network, which has the advantages of permissionless, security, decentralization, scalability, and greenness. The Hedera consensus algorithm is a hybrid blockchain consensus algorithm that combines the permissionless Proof-of-Capacity algorithm and the permissioned asynchronous Byzantine algorithm. This article tests the fairness, throughput, scalability, latency, and resource consumption of the algorithm by developing and deploying a prototype system. The experimental results show that the Hedera algorithm proposed in this article is fair, the throughput reaches 13986.3 TPS, and the resource consumption is much lower than the PoW consensus. By analyzing its security and liveness, it can resist the sybil attack, nothing-at-stake attack, selfish mining attack, and message hijacking attack, and has good liveness.
A public blockchain network ensures security, performance, and integrity through its consensus algorithm. However, most public blockchain consensus algorithms require intensive resources such as;energy, CPU, stake, an...
详细信息
A public blockchain network ensures security, performance, and integrity through its consensus algorithm. However, most public blockchain consensus algorithms require intensive resources such as;energy, CPU, stake, and memory. Further, the incentive mechanisms of most permissionless consensus algorithms are biased towards the miners having the most resources. This paper proposes a novel, resource-efficient, and fair rewarding consensus algorithm called Proof of Fit (PoF). The PoF consensus algorithm replaces the resource-intensive computation in Proof of Work (PoW) with massage-based resource-efficient computation called fitting-competition. We estimated the average computation time by developing a peer-to-peer messaging and computing network. Then we customized a public blockchain simulation framework to assess the performance parameters of the consensus algorithm. We did several experiments and compared the simulation results of PoF with PoW, Proof of Activity (PoA), Proof of Stake (PoS), and Poof of Capacity (PoC). The simulation result shows that the PoF consensus algorithm improves throughput by 1257%, 69%, 35%, and 18%, respectively;besides, it improves security, resource efficiency, and incentive distribution.
Blockchain technology, which was originally created for cryptocurrencies, has significant research gaps when applied to the healthcare domain. This paper tackles two important research gaps concerning blockchain imple...
详细信息
ISBN:
(纸本)9798331511425;9798331511432
Blockchain technology, which was originally created for cryptocurrencies, has significant research gaps when applied to the healthcare domain. This paper tackles two important research gaps concerning blockchain implementation in healthcare: consensus algorithm and network design. While public blockchains are often undesirable for healthcare due to their inherent characteristics, private blockchains provide a more acceptable option. The major goal of this study is to offer an improved consensus algorithm and a blockchain network design that is tailored to healthcare requirements. The suggested system attempts to increase security, scalability, and decentralisation while tackling the unique constraints of maintaining sensitive patient data across a distributed network.
The concern for privacy and scalability has motivated a paradigm shift to decentralized energy management methods in microgrids. The absence of a central authority brings significant challenges to promote trusted coll...
详细信息
The concern for privacy and scalability has motivated a paradigm shift to decentralized energy management methods in microgrids. The absence of a central authority brings significant challenges to promote trusted collaboration and avoid collusion. To address these issues, this paper proposes a blockchain-empowered microgrid energy management framework, which adopts a novel consensus-based algorithm with a collusion prevention mechanism. Aiming at social welfare maximization, the energy management problem is formulated into a convex and decomposable form, which can be solved in a decentralized manner. To prevent the collusion between malicious agents, we propose a random information transmission mechanism empowered by the blockchain smart contract to replace the time-invariant communication topology. The consensus-based algorithm is extended to obtain the optimal solution of the energy management problem on the random and time-varying communication topology. We theoretically proved that the proposed algorithm converges to the global optimal solution with a probability of 1, without violating the physical constraints of individual agents. The effectiveness of the proposed method was validated by multiple experiments, both within the simulation environment and on a hardware system.
The paper proposes the method of uniform flow loading the improved consensus algorithm to achieve obstacle avoidance for multi-UAV with 3-D formation. In view of that the flow function is generally only applicable to ...
详细信息
The paper proposes the method of uniform flow loading the improved consensus algorithm to achieve obstacle avoidance for multi-UAV with 3-D formation. In view of that the flow function is generally only applicable to two dimensional flow field, dimension reduction is to treat multi-UAV formation as each UAV flows around along the circular surface of the projected cylinder of spherical obstacle at its different heights. To formation guaranteeing the smooth realization of obstacle avoidance of multi-UAV formation centered on the leader, it is used the tactics of virtually expanding the radius of these static or moving equivalent cylindrical obstacles to reserve a certain space. The innovation of this strategy is to further reduce the possibility of collision between UAV formation and the edge of obstacles, meanwhile the problem of multi-UAV formation avoiding obstacles is transformed into the problem of collision avoidance navigation for the leader treated as a particle. It is considered collision avoidance for multi-UAV formation under three scenarios assumed are the most common situations, and the simulation experimental results of these scenarios are demonstrated on the validity of the designed experiments based on these algorithms.
In this article, we present a finite-time stopping criterion for consensus algorithms in networks with dynamic communication topology. Prior state of the art has established convergence to the consensus value;however,...
详细信息
In this article, we present a finite-time stopping criterion for consensus algorithms in networks with dynamic communication topology. Prior state of the art has established convergence to the consensus value;however, the asymptotic convergence of these algorithms poses a challenge in practical settings where the response from agents is required in finite time. To this end, we propose a maximum-minimum protocol that propagates the global maximum and minimum values of agent states (while running the consensus algorithm) in the network. This article focuses on establishing that the global maximum and minimum values are strictly monotonic even for a dynamic topology, and they can be used to distributively ascertain the closeness to convergence in finite time. We rigorously show that each node can have access to the global maximum and minimum by running the proposed maximum-minimum protocol to realize a finite-time stopping criterion for the otherwise asymptotic consensus algorithm. The practical utility of the algorithm is illustrated through experiments where each agent is instantiated by a NodeJS *** server.
We propose a consensus mechanism based on the consistent hash algorithm for multiple master nodes. The consensus mechanism uses a consistent hash algorithm to select consensus group nodes and common nodes and further ...
详细信息
We propose a consensus mechanism based on the consistent hash algorithm for multiple master nodes. The consensus mechanism uses a consistent hash algorithm to select consensus group nodes and common nodes and further selects multiple master nodes on this basis, and conduct one-way communication with the final leader node.
The backbone of Blockchain technology is a consensus algorithm because it plays a significant role in terms of network efficiency, security and scalability. Currently, a consensus algorithm is the hot research topic s...
详细信息
ISBN:
(纸本)9783031713149;9783031713156
The backbone of Blockchain technology is a consensus algorithm because it plays a significant role in terms of network efficiency, security and scalability. Currently, a consensus algorithm is the hot research topic since many of the existing consensus algorithms are facing some issues in terms of low throughput, high latency, high bandwidth consumption and CPU utilization. Therefore, to ensure high performances, this paper proposed a novel consensus algorithm based on nodes trust values for consortium blockchain. The proposed paper divides mining nodes of the network into two groups basis on trust values. A mining node is randomly nominated as a leader node from the group of high trust values. This improves network performances by increasing throughput, reducing latency, reducing communication overhead cost and CPU utilization. Hyperledger Fabric v2.1 is used to check the performances of the proposed consensus algorithm. The result shows that it has better performances in term low latency, high throughput, low communication bandwidth cost and low CPU unitization.
Over the past era,subgraph mining from a large collection of graph database is a crucial *** addition,scalability is another big problem due to insufficient *** are several security challenges associated with subgraph...
详细信息
Over the past era,subgraph mining from a large collection of graph database is a crucial *** addition,scalability is another big problem due to insufficient *** are several security challenges associated with subgraph mining in today’s on-demand *** address this downside,our proposed work introduces a Blockchain-based consensus algorithm for Authenticated query search in the Large-Scale Dynamic Graphs(BCCA-LSDG).The two-fold process is handled in the proposed BCCA-LSDG:graph indexing and authenticated query search(query processing).A blockchain-based reputation system is meant to maintain the trust blockchain and cloud server of the proposed *** resolve the issues and provide safe big data transmission,the proposed technique also combines blockchain with a consensus algorithm *** of the big data is ensured by dividing the BC network into distinct networks,each with a restricted number of allowed entities,data kept in the cloud gate server,and data analysis in the *** consensus algorithm is crucial for maintaining the speed,performance and security of the *** Dual Similarity based MapReduce helps in mapping and reducing the relevant subgraphs with the use of optimal feature ***,the graph index refinement process is undertaken to improve the query *** query error,fuzzy logic is used to refine the index of the graph *** proposed technique outperforms advanced methodologies in both blockchain and non-blockchain systems,and the combination of blockchain and subgraph provides a secure communication platform,according to the findings.
Practical Byzantine Fault Tolerance algorithm (PBFT) can improve efficiency on the basis of the original algorithm, but there are still some issues such as high algorithm complexity, arbitrary decision of primary node...
详细信息
暂无评论