Search Results (20)

The Internet of Things (IoT) demands scalable, secure, and feeless distributed ledger technologies (DLTs) to enable seamless machine-to-machine transactions. The IOTA DLT was developed to fulfill this vision through its feeless Directed Acyclic Graph (DAG) named the Tangle, whose announced upgrade to IOTA 2.0 promised feeless microtransactions and coordinator-free (Coordicide) decentralization via a Nakamoto Consensus mechanism and a Mana anti-spam system. However, its delayed decentralization and scalability limitations hindered ecosystem growth and practical IoT adoption, leading to a new ledger architecture named IOTA Rebased. This paper critically analyzes this architectural pivot and its implications for IoT applications, contrasting the abandoned IOTA 2.0 protocol—a leaderless, feeless DAG designed for the IoT—with the adoption of a Move Virtual Machine-based, object-oriented ledger secured by a Delegated Proof-of-Stake consensus via the Mysticeti protocol in IOTA Rebased. We evaluate IOTA Rebased trade-offs: enhanced programmability and speed versus compromised IoT suitability due to fees, and explore mitigation strategies such as sponsored transactions, lightweight clients, and hierarchical tiered transaction architecture to align IOTA Rebased with IoT environments where microtransactions are prevalent. A use case analysis is provided for the integration of IOTA Rebased in IoT scenarios. This study underscores the tension between technological innovation and decentralization, offering insights for balancing scalability with the unique demands of the IoT. Full article

Aiming to address the shortcomings of traditional blockchain technologies, characterized by high storage redundancy and low transaction query efficiency, we propose a lightweight sender-based blockchain architecture (LSB). In this architecture, the linkage between blocks is associated with the user initiating the transaction, and the hash of the newly generated block is recorded in the user’s wallet, thereby facilitating transaction retrieval. Each user node must store only the blocks that pertain to it, significantly reducing storage costs. To ensure the normal operation of the system, the Delegated Proof of Stake based on Reputation and PBFT (RP-DPoS) consensus algorithm is employed, establishing a reputation model to select honest and reliable nodes for consensus participation while utilizing the Practical Byzantine Fault Tolerance (PBFT) algorithm to verify blocks. The experimental results demonstrate that LSB reduces storage overhead while enhancing the efficiency of querying and verifying transactions. Moreover, in terms of security, it decreases the likelihood of malicious nodes being designated as agent nodes, thereby increasing the chances of honest nodes being selected for consensus participation. Full article

In recent years, consensus algorithms have gained significant importance in the context of blockchain networks. These algorithms play a crucial role in allowing network participants to reach agreements on the state of the blockchain without needing a central authority. The present study focuses on carrying out a systematic mapping of these consensus algorithms to explore in detail their use, benefits, and challenges in the context of blockchain networks. Understanding consensus algorithms is essential to appreciating how blockchain networks achieve the reliability and integrity of their distributed ledgers. These algorithms allow network nodes to reach agreement on the validity of transactions and the creation of new blocks on the blockchain. In this sense, consensus algorithms are the engine that drives trust in these decentralized networks. Numerous authors have contributed to the development and understanding of consensus algorithms in the context of blockchain networks. This revolutionary concept paved the way for numerous cryptocurrencies and blockchain systems. Despite advances in this field, significant challenges remain: centralization, fair token distribution, scalability, and sustainability. The energy consumption of blockchain networks, particularly those using algorithms such as Proof of Work, Proof of Stake, Delegated Proof of Stake, Proof of Authority, and hybrid algorithms (Proof of Work/Proof of Stake), has raised concerns about their environmental impact, motivating the scientific and technological community to investigate more sustainable alternatives that promise to reduce energy consumption and contribute to climate change mitigation. Furthermore, interoperability between different blockchains and security in specific environments, such as IoT, are areas that still require significant research attention. This systematic mapping not only seeks to shed light on the current state of consensus algorithms in blockchain, but also their impact on sustainability, identifying those algorithms that, in addition to guaranteeing integrity and security, minimize the environmental footprint, promoting a more efficient use of energy resources, being a relevant approach in a context in which the adoption of sustainable technologies has become a global priority. Understanding and improving these algorithms are critical to unlocking the full potential of blockchain technology in a variety of applications and industry sectors. Full article

To be a stakeholder/validator/token holder is not so difficult in the Proof of Stake (POS)-based blockchain networks; that is why the number of validators is large in these networks. These validators play an essential part in the block creation process in the PoS-based blockchain network. Due to the large validators, the block creation time and communication message broadcasting overhead get increased in the network. Many consensus algorithms use different techniques to reduce the number of validators, such as Delegated Proof of Stake (DPoS) consensus algorithms, which select the set of delegators via stake transactions for the block creation process. In this paper, we propose S&SEM, a secure and speed-up election process to select the ‘z’ number of validators/delegators. The presented election process is based on a traditional voting style with multiple numbers of rounds. The presented election mechanism reduces the possibility of malicious activity in the voting process by introducing a special vote message and a round that checks duplicate votes. We did horizontal scaling in the network to speed up the election process. We designed an improved incentive mechanism for the fairness of the election process. The designed reward and penalty procedure controls the nodes’ behaviors in the network. We simulate the S&SEM, and the result shows that the presented election process is faster and more secure to select delegators than the existing process used by DPOS. Full article

A mobile ad-hoc network (MANET) necessitates appropriate routing techniques to enable optimal data transfer. The selection of appropriate routing protocols while utilizing the default settings is required to solve the existing problems. To enable effective video streaming in MANETs, this study proposes a novel optimized link state routing (OLSR) protocol that incorporates a deep-learning model. Initially, the input videos are collected from the Kaggle dataset. Then, the black-hole node is detected using a novel twin-attention-based dense convolutional bidirectional gated network (SA_ DCBiGNet) model. Next, the neighboring nodes are analyzed using trust values, and routing is performed using the extended osprey-aided optimized link state routing protocol (EO_OLSRP) technique. Similarly, the extended osprey optimization algorithm (EOOA) selects the optimal feature based on parameters such as node stability and link stability. Finally, blockchain storage is included to improve the security of MANET data using interplanetary file system (IPFS) technology. Additionally, the proposed blockchain system is validated utilizing a consensus technique based on delegated proof-of-stake (DPoS). The proposed method utilizes Python and it is evaluated using data acquired from various mobile simulator models accompanied by the NS3 simulator. The proposed model performs better with a packet-delivery ratio (PDR) of 91.6%, average end delay (AED) of 23.6 s, and throughput of 2110 bytes when compared with the existing methods which have a PDR of 89.1%, AED of 22 s, and throughput of 1780 bytes, respectively. Full article

In this paper, we present a novel blockchain-enabled approach to opportunistic federated learning (OppCL) for intelligent transportation systems (ITS). Our approach integrates blockchain with OppCL to streamline the learning of autonomous vehicle models while addressing data privacy and trust challenges. We deploy resilient countermeasures, incentivized mechanisms, and a secure gradient distribution to combat single-point failure verification attacks. Additionally, we integrate the Byzantine fault-tolerant algorithm (BFT) into the node verification component of the delegated proof of stake (DPoS) to minimize verification delays. We validate our approach through experiments on the MNIST, SVHN, and CIFAR-10 datasets, showing convergence rates and prediction accuracy comparable to traditional OppCL approaches. Full article

Low-speed internet can negatively impact incident response by causing delayed detection, ineffective response, poor collaboration, inaccurate analysis, and increased risk. Slow internet speeds can delay the receipt and analysis of data, making it difficult for security teams to access the relevant information and take action, leading to a fragmented and inadequate response. All of these factors can increase the risk of data breaches and other security incidents and their impact on IoT-enabled communication. This study combines virtual network function (VNF) technology with software -defined networking (SDN) called virtual network function software-defined networking (VNFSDN). The adoption of the VNFSDN approach has the potential to enhance network security and efficiency while reducing the risk of cyberattacks. This approach supports IoT devices that can analyze large volumes of data in real time. The proposed VNFSDN can dynamically adapt to changing security requirements and network conditions for IoT devices. VNFSDN uses threat filtration and threat-capturing and decision-driven algorithms to minimize cyber risks for IoT devices and enhance network performance. Additionally, the integrity of IoT devices is safeguarded by addressing the three risk categories of data manipulation, insertion, and deletion. Furthermore, the prioritized delegated proof of stake (PDPoS) consensus variant is integrated with VNFSDN to combat attacks. This variant addresses the scalability issue of blockchain technology by providing a safe and adaptable environment for IoT devices that can quickly be scaled up and down to pull together the changing demands of the organization, allowing IoT devices to efficiently utilize resources. The PDPoS variant provides flexibility to IoT devices to proactively respond to potential security threats, preventing or mitigating the impact of cyberattacks. The proposed VNFSDN dynamically adapts to the changing security requirements and network conditions, improving network resiliency and enabling proactive threat detection. Finally, we compare the proposed VNFSDN to existing state-of-the-art approaches. According to the results, the proposed VNFSDN has a 0.08 ms minimum response time, a 2% packet loss rate, 99.5% network availability, a 99.36% threat detection rate, and a 99.77% detection accuracy with 1% malicious nodes. Full article

Consensus algorithms are the core technology of a blockchain and directly affect the implementation and application of blockchain systems. Delegated proof of stake (DPoS) significantly reduces the time required for transaction verification by selecting representative nodes to generate blocks, and it has become a mainstream consensus algorithm. However, existing DPoS algorithms have issues such as “one ballot, one vote”, a low degree of decentralization, and nodes performing malicious actions. To address these problems, an improved DPoS algorithm based on community discovery is designed, called CD-DPoS. First, we introduce the PageRank algorithm to improve the voting mechanism, achieving “one ballot, multiple votes”, and we obtain the reputation value of each node. Second, we propose a node voting enthusiasm measurement method based on the GN algorithm. Finally, we design a comprehensive election mechanism combining node reputation values and voting enthusiasm to select secure and reliable accounting nodes. A node credit incentive mechanism is also designed to effectively motivate normal nodes and drive out malicious nodes. The experimental simulation results show that our proposed algorithm has better decentralization, malicious node eviction capabilities and higher throughput than similar methods. Full article

With the advent of the digital age, traditional lifestyle activities, such as reading books, referencing recipes, and enjoying music, have progressively transitioned from offline to online. However, numerous issues plague the conventional approach to digital copyright protection. This is especially true in the realm of recipe protection, where the rights and interests of original creators are inadequately safeguarded due to the widespread dissemination of a large number of recipes on the Internet. This primarily stems from the high costs of gathering evidence, incomplete coverage of evidence collection, and the inability to identify and halt infringement activities in a timely manner during the process of traditional digital copyright protection. Therefore, this study designs and implements a blockchain-based digital recipe copyright protection scheme to address the issues of insufficient legal evidence and cumbersome processes in traditional digital copyright protection. First, we enhance standard short text similarity calculation method SimHash, boosting the accuracy of text similarity detection. We then utilize the decentralization, immutability, time-stamping, traceability, and smart contract features of blockchain technology for data privacy protection. We employ the Interplanetary File System (IPFS) to store raw data, thereby ensuring user privacy and security. Lastly, we improve the proxy voting node selection in the existing delegated proof of stake (DPOS) consensus mechanism. According thorough evaluation and empirical analysis, the scheme effectively improves the accuracy of text similarity detection. Simultaneously, the enhanced DPOS mechanism effectively rewards nodes with excellent performance and penalizes nodes exhibiting malicious behavior. In this study, we successfully designed and implemented an innovative digital recipe copyright protection scheme. This scheme effectively enhances the accuracy of text similarity detection; ensures the privacy and security of user data; and, through an enhanced DPOS mechanism, rewards well-performing nodes while penalizing those exhibiting malicious behavior. Full article

With the enhanced interoperability of information among vehicles, the demand for collaborative sharing among vehicles increases. Based on blockchain, the classical consensus algorithms in collaborative IoV (Internet of Vehicle), such as PoW (Proof of Work), PoS (Proof of Stake), and DPoS (Delegated Proof of Stake), only consider the node features, which is hard to adapt to the immediacy and flexibility of vehicles. On the other hand, classical consensus algorithms often require mass computing, which undoubtedly increases the communication overhead, resulting in the inability to achieve collaborative IoV under asymmetric networks. Therefore, proposing a low failure rate consensus algorithm that takes into account running time and energy consumption becomes a major challenge in IoV applications. This paper proposes an AI-enabled consensus algorithm with vehicle features, combining vehicle-based metrics and neural networks. First, we introduce vehicle-based metrics such as vehicle online time, performance, and behavior. Then, we propose an integral model and a hierarchical classification method, which combine with a BP neural network to obtain the optimal solution for interconnection. Among them, we also use Informer to predict the future online duration of vehicles, which effectively solves the situation that the primary node vehicle drops off in collaborative IoV. Finally, the experimentations show that the vehicle-based metrics eliminate the problem of the primary node vehicle being offline, which realizes the collaborative IoV considering vehicle features. Meanwhile, it reduces the vehicle network system delay and energy consumption. Full article

Open-source systems help to manage the rapid development of software, while governing open-source systems properly can effectively promote software and software engineering. However, some significant problems, such as code controls, incentives, interaction and cooperation, automation, transparency and fairness of rights and responsibilities, cannot be properly solved by traditional methodologies. The decentralization, immutability, change in trust mode and smart contract programming of blockchain provide new solutions. In order to solve the problems of traditional centralized open-source governance, this paper proposes a decentralized open-source coordination management system using a novel triple-blockchain architecture. Through the analysis of traditional and blockchain-based research, the business and technical issues that need to be addressed in decentralized open-source governance systems have been emphatically studied. Combined with triple-blockchain architecture, smart contracts, oracles and continuous integration tools, we study the decentralization of open-source businesses and make them more trustworthy, automated and coordinated. An identity authentication mechanism is designed for permission control and inter-community collaboration. A decentralized open-source reputation is proposed for incentive and reference. We also improved the DPoS (Delegated Proof of Stake) consensus under triple-blockchain architecture to reduce repeated elections. By constructing the OSCMS prototype based on the proposed architecture model, many comparative experiments were conducted under different parameters and conditions and showed good feasibility, scalability, reliability and performance. The OSCMS not only solves the shortcomings of previous research but also provides a comprehensive and feasible reference for the decentralized practice of open-source governance. Full article

The metaverse provides us with an attractive virtual space in which the value of the virtual property has been increasingly recognized. However, the lack of effective cross-metaverse trading tools and the reputation guarantee makes it difficult to trade items among different metaverses. To this end, a decentralized reputation system for virtual items trading forum named DVIT is devised. To the best of our knowledge, DVIT is the first decentralized cross-metaverse item trading prototype inspired by the online-game trading system. We designed the corresponding transaction function and realized the autonomous governance of the community by introducing the reputation mechanism. An improved election mechanism is proposed to improve efficiency based on Delegated Proof-of-Stake (DPoS). Through token rewards associated with activity levels, users’ motivation can be stimulated. The experiments indicate that our proposed scheme could dynamically measure the trustworthiness degree of the users through the dynamic reputation value and thereby exclude malicious users from the blockchain within 20 epochs. Full article

Security and a decentralized system are identical unique features of Blockchain. In recent times, blockchain-based cryptocurrency has become mainstream, but the growth and value of transactions and application services remain volatile. Among all these applications, finding a fast consensus in a large-scale blockchain network frequently requires extreme energy for huge computations and storing the complete blockchain for verification. These problems prevent further commercialization. Here, we present a solution to this problem. In this paper, we introduce a revised blockchain consensus algorithm, PDPoS, to address the scalability and transaction efficiency limitations. The symmetry in between Proof of Stake (PoS) and Delegated Proof of Stake (DPoS) is PoS. However, their ways of working are dissimilar. Here, we review the existing consensus algorithms, such as Proof of work (PoW), PoS and DPoS, as they are directly relating to our proposed work: PDPoS. We highligh Delegated Proof of Stake (DPoS)–based crypto-currencies, as they have much higher transactions per second (TPS) than PoW-based currencies. Then, we describe our proposed works and the working steps of the proposed PDPoS. Simulation results of the proposed PDPoS with two layers result in improved efficiency. We used TPS as the evolution criteria for showing that the proposed PDPoS is more efficient than DPoS. This makes the proposed work more relevant to the large-scale blockchain network as it is more efficient and requires less energy consumption. Full article

In this paper, we investigate some economic fundamentals related to the Tezos blockchain platform under the Emmy* consensus protocol. The protocol is based on a liquid version of Proof-of-Stake, in the sense that users can temporarily delegate some or all of their Tz units to full nodes. In addition to increasing the stake of the full node, and thus the probability of being selected as a block baker/endorser, such delegation induces the property of the super-additivity of users’ selection probability of baking/endorsing a block. That is, with delegation, the selection probability may be larger than the sum of the selection probabilities without delegation. In this paper, we study how monetary holdings and stakes can evolve with time, also discussing the individual user and the market implications of delegation. Full article

In emergency scenarios where the on-site information is completely lacking or the original environmental state has been completely changed, autonomous and mobile swarm robotics are used to quickly build a rescue support system to ensure the safety of follow-up rescuers and improve rescue efficiency. To address the data security problem caused by the complex and changeable topology of the heterogeneous swarm robotics network in the process of building the rescue support system, this paper introduced a decentralized data security communication scheme for heterogeneous swarm robotics. First, we built a decentralized network topology model by using base robot, communication robotics, and business robotics, and it can ensure the stability of the system. Moreover, based on the decentralized network topology model, we designed a storage model using the master–slave blockchain method. The master chain is composed of base robot and communication robotics, which mainly store the digests of robot data in multiple slave chains to reach the global data consensus of the system. The slave chains are composed of business robotics and communication robotics, which mainly store all data on the slave chains to reach the local data consensus of the system. The whole data storage system adopts the Delegated Proof of Stake consensus mechanism to elect proxy nodes to participate in the data consensus tasks in the system and to ensure the data consistency of each robot node in the decentralized network. Additionally, a prototype of the heterogeneous swarm robotics system based on the master–slave chains is constructed to verify the effectiveness of the proposed model. The experimental results show that the scheme effectively solves the data security problem caused by the unstable communication link of the heterogeneous swarm robotics system. Full article