Many IoT-blockchain systems in which blockchain connections run on an infrastructure-based network, such as Wi-Fi or LTE, face a severe problem: the single point of failure (SPoF) (i.e., depending on the availability, an access point of an LTE base station). Using infrastructure-less networks (i.e., ad hoc networks) is an efficient approach to prevent such highly disruptive events. An ad hoc network can automatically restore blockchain communication using an ad hoc routing protocol, even if a node fails. Moreover, an ad hoc routing protocol is more efficient when considering the IoT nodes’ mobility. In this paper, we first construct IoT-blockchain systems on emulated and real ad hoc networks with Ethereum and three ad hoc routing protocols (i.e., OLSR, BATMAN, and BABEL). We then evaluate the blockchain recovery time in static and mobile scenarios. The results show that BATMAN achieves the best blockchain recovery performance in all investigated scenarios because BATMAN only determines whether to switch a route by comparing the number of OGM packets received from a different next-hop. More specifically, in the small-scale real IoT-blockchain, BATMAN recovers at least 73.9% and 59.8% better than OLSR and BABEL, respectively. In the medium-scale emulated IoT-blockchain, the recovery time of BATMAN is at least 69% and 60% shorter than OLSR or BABEL, respectively.
With features like immutability and transparency, blockchain and Distributed Ledger Technologies (DLT) can enable the telco industry to exchange services using smart contracts. Consequently, various 6G network stakeholders can participate in a marketplace for inter-provider agreements as either service providers or consumers. As, a blockchain-based 6G network can aid administrative domains in sharing resources (virtual network functions, services, or slices). However, such a dynamic environment requires strict Service Level Agreement (SLA) monitoring and management. Therefore, this paper considers a use case of a smart contract-based inter-provider agreement. We use novel solutions like IOTA Tangle to perform transactions, IPFS to store the hash of use case data files, and chainlink to access off-chain data feeds for SLA monitoring, reducing costs and increasing transparency. We also provide experimental evaluations of and divide the emulation into two phases. Phase 1 consists of choosing the approach and creating a smart contract (SC) (i.e., SC-Marketplace or SC-Auction). Furthermore, phase 2 consists of off-chain data feed to monitor SLA through chainlink. Finally, we measure transaction latency, response time, overall time consumption, and transaction & storage cost. The maximum latency observed in phase 1 is$\approx 25\text{ms}$and$\approx 15\mathrm{s}$for phase 2. Similarly, the average response time for both phases is$\approx 14\mathrm{s}$~ 20s. Lastly, the results also explain that using IOTA-EVM, we can have fee-less transactions, and IPFS helps reduce the storage cost by up to$\approx 80\%$. However, it is concluded that adding chainlink adds additional cost for SLA data feeds.
Damilare Peter Oyinloye, Je Sen Teh, Norziana Jamil, Jiashen Teh
Blockchain is a distributed ledger in which participating users with varying levels of trust agree on the ledger’s content using a consensus mechanism called consensus protocols. There has been a rising interest in the design of consensus protocols since they play a central role in blockchain architecture. However, many recently proposed consensus protocols lack experimental verification which hampers the possible deployment of these protocols in real-world blockchain networks. In this article, we propose a simple tool called simplified consensus protocol simulator (SIM-P) that can accurately simulate the behavior of these consensus protocols with ease. It is an agent-based stochastic simulator that relies on the sequential Monte Carlo method to model how block publishers are selected. The likelihood of each node (represented as agents) being selected as a block publisher is represented by independent trials in a binomial experiment. We provide a base SIM-P model that simulates Proof of Work (PoW) for benchmarking purposes. The PoW model also serves as the basic structure of the simulator that can be adapted to other protocols. We showcase the flexibility of SIM-P by proposing two additional simulation models for Proof of Reputation-X and Proof of Contribution, both of which lack experimental verification in their original design specifications. We show how the simulator can be used to produce vital metrics, such as throughput, resistance against the 51% attack, and energy consumption. We verify the accuracy of SIM-P by comparing PoW’s simulated results with theoretical estimates and historical Bitcoin data.
In the era of big data, data is playing an increasingly important role in scientific study, and reliable storage and secure sharing of data have become a research hotspot. At present, centralized solutions based on data centers and cloud storage have problems with data-right confirmation and center trust. A large number of decentralized storage solutions are public systems, in which blockchain technology, as a tool for value exchange, does not solve the problems of data verification and system supervision. We propose a peer-to-peer storage system with identity access, which achieves data validation, cross-organizational data retrieval, trusted authorization, and sharing based on the consortium blockchain. Our solution proposes a peer-to-peer data storage scheme based on the consortium blockchain and a set of identity authentication mechanisms compatible with the consortium blockchain. Based on this, we propose a blockchain-based permission control scheme and a set of retrieval, authorization, and sharing processes. Finally, we implemented and tested the system to prove the feasibility of the scheme.
In this work, we propose a stateless blockchain called CompactChain, which compacts the entire state of the UTXO (Unspent Transaction Output) based blockchain systems into two RSA accumulators. The first accumulator is called Transaction Output (TXO) commitment which represents the TXO set. The second one is called Spent Transaction Output (STXO) commitment which represents the STXO set. In this work, we discuss three algorithms - (i) To update the TXO and STXO commitments by the miner. The miner also provides the proofs for the correctness of the updated commitments; (ii) To prove the transaction's validity by providing a membership witness in TXO commitment and non-membership witness against STXO commitment for a coin being spent by a user; (iii) To update the witness for the coin that is not yet spent; The experimental results evaluate the performance of the CompactChain in terms of time taken by a miner to update the commitments and time taken by a validator to verify the commitments and validate the transactions. We compare the performance of CompactChain with the existing state-of-art works on stateless blockchains. CompactChain shows a reduction in commitments update complexity and transaction witness size which inturn reduces the mempool size and propagation latency without compromising the system throughput (Transactions per second (TPS)).
Exploring the integration of blockchain technology into land registry systems is the primary focus of this research, concentrating on augmenting efficiency, transparency, and security within the domain.Employing an extensive research framework, we rigorously investigate the functionality of blockchain in the context of land registries.Our analysis reveals substantial reductions in transaction times, bolstered data integrity, and increased resilience against fraudulent activities.These findings accentuate the pivotal role that blockchain can play in restructuring conventional land registry practices, instilling trust, and mitigating discrepancies.Beyond the immediate benefits, the study extrapolates into a forward-looking perspective, contemplating the widespread adoption and potential consequences of implementing blockchain technology in the field of land registration.Key aspects encompassed in this exploration include blockchain, land registry, efficiency enhancements, transparent data management, heightened security protocols, and reduced transaction times.It is important to note that while the study acknowledges the transformative potential of blockchain, it does not underestimate the challenges and considerations associated with its implementation.By shedding light on both the positive and potential pitfalls, this research seeks to contribute to a nuanced understanding of how blockchain technology can be leveraged effectively in the context of land registries.The outlined key terms encapsulate the essence of this investigation, providing a comprehensive overview of the multifaceted impact that blockchain integration can have on land registration systems.
Sukrutha L. T. Vangipuram, Saraju P. Mohanty, Elias Kougianos, Chittaranjan Ray
Groundwater overuse in different domains will eventually lead to global freshwater scarcity. To meet the anticipated demands, many governments worldwide are employing innovative and traditional techniques for forecasting groundwater availability by conducting research and studies. One challenging step for this type of study is collecting groundwater data from different sites and securely sending it to the nearby edges without exposure to hacking and data tampering. In the current paper, we send raw data formats from the Internet of Things to the Distributed Data Storage (DDS) and Blockchain (BC) edges. We use a distributed and decentralized architecture to store the statistics, perform double hashing, and implement access control through smart contracts. This work demonstrates a modern and innovative approach combining DDS and BC technologies to overcome traditional data sharing, and centralized storage, while addressing blockchain limitations. We have shown performance improvements with increased data quality and integrity.
Blockchain technology (BCT) has emerged as a game-changer for many industries since its inception in 2008. Its application in the energy industry as blockchain enabled interconnected smart microgrids (BSMG) is on the rise as it can execute energy trading, automate the market operations, manage the grid, and facilitate real-time payments. With the increase in usage of BSMGs, different types of BCT will emerge, making the system heterogeneous in nature. BCT is also limited currently due to its scalability and low transaction rate. Interoperability between heterogeneous BSMGs can counteract the drawbacks and improve the functionality and, thereby, adoption of BCT in energy. This paper recognises the need for interoperability and thoroughly reviews the different methods of interoperability that currently exist (i.e., notary mechanism, relay or side chains, hashed time-locked contracts, and blockchain routers). Two relay mechanisms - Polkadot and Cosmos with Inter Blockchain Communication Protocol (IBC) are reviewed further to determine the usability of the protocols. Finally, a conceptual architecture of interconnection of heterogeneous BSMGs is proposed. Conceptual solution to connecting Ethereum and Hyperledger Fabric to the Cosmos Hub through IBC is explored. While interoperability between heterogeneous users is addressed in Decentralized Finance (DeFi), it has not yet been addressed in energy. A conceptual solution is provided for this research gap for the first time in energy domain.
This paper recognizes the need for interoperability between heterogeneous blockchain-enabled smart microgrids and heterogeneous prosumers involved in peer-to-peer transactions. It discusses methods of interoperability between different blockchain platforms like Ethereum, Hyperledger Fabric, and Tendermint. It is a work-in-progress draft.
Alexander Kudzin, Kentaroh Toyoda, Satoshi Takayama, Atsushi Ishigame
(1) Background: To solve the blockchain scaling issue, sharding has been proposed; however, this approach has its own scaling issue: the cross-shard communication method. To resolve the cross-shard communication scaling issue, rollups have been proposed and are being investigated. However, they also have their own scaling limitations, in particular, the degree of compression they can apply to transactions (TXs) affecting how many TXs can be included in one block. (2) Methods: In this paper, we propose a series of novel data structures for the compiling of cross-shard TXs sent using rollups for both public and private Ethereum. Our proposal removes redundant fields, consolidates repeated fields, and compresses any remaining fields in the rollup, modifying its data structure to compress the address, gas, and value fields. (3) Results: We have shown that our proposals can accommodate more cross-shard TXs in a block by reducing the TX size by up to 65% and 97.6% compared to the state-of-the-art in public and private Ethereum, respectively. This compression in TX size results in an over 2× increase in transactions per block (TPB) for our proposals targeting both types of Ethereum. (4) Conclusions: Our proposals will mitigate the scaling issue in a sharded blockchain that utilizes rollups for cross-shard communication. In particular, it will enable such sharded Ethereum networks to be deployed for large-scale decentralized systems.
Major blockchain projects, such as Bitcoin and Ethereum, enable secure global transfers of tokens between untrusted parties. The resulting global financial infrastructure however incurs latency and costs that are prohibitive for many economics applications that are local to a region or a community. Local economics relies on trust and reputation through repeated interactions within a community of participants that know each other, which has not previously been leveraged for the design of crypto-tokens. In this paper, we formulate the design of new local crypto-tokens as a research problem: we present concrete application examples, we identify double-spending detection as a weaker and sufficient alternative to double-spending prevention in local applications, and we formulate desired properties of new local crypto-tokens designs. Based on our analysis, we envision local crypto-tokens to complement existing blockchain projects by facilitating intra-community economics at much lower latency and costs, while evolutions of current blockchain projects will provide global inter-community exchanges of high-value transactions.
S. Muthurajkumar, A. Vignesh, S. Kugan, R. Arunsha
On the Internet, web applications are served from a centralized location i.e., server, for higher maintainability. However, in the centralized architecture, if there is an occurrence of server failure or crash, the web applications cannot be serve to the end-users until the server goes live again. In addition, in the existing centralized architecture for web hosting services, integrity of the hosted websites entirely relies on the third-party applications which checks for any possible threats in the system. In order to provide data integrity within the system and to overcome the above-mentioned single point of failure, we proposed the decentralized solution for hosting web applications, which provides more data availability to the end-users and maintains the integrity of the data. The proposed model makes use of the Interplanetary File System (IPFS) for storing and retrieving web applications, which provides high availability and reliability. In addition, the proposed model uses the Blockchain Technology for authenticity and confidentiality. The smart contracts are deploy on the Ethereum Block chain, which aids the service provider to manage the hosting service system. The proposed model also comparatively decreases the time taken to transfer the file over the IPFS using optimal path-finding algorithm. The proposed algorithm has a lesser time complexity when compared to the Bitswap protocol used in IPFS. The use of blockchain with IPFS cumulatively provides better authenticity via Ethereum Smart Contracts, which reduces risk and failure.
In general, the Internet of Things (IoT) relies on centralized servers due to limited computing power and storage capacity. These server-based architectures have vulnerabilities such as DDoS attacks, single-point errors, and data forgery, and cannot guarantee stability and reliability. Blockchain technology can guarantee reliability and stability with a P2P network-based consensus algorithm and distributed ledger technology. However, it requires the high storage capacity of the existing blockchain and the computational power of the consensus algorithm. Therefore, blockchain nodes for IoT data management are maintained through an external cloud, an edge node. As a result, the vulnerability of the existing centralized structure cannot be guaranteed, and reliability cannot be guaranteed in the process of storing IoT data on the blockchain. In this paper, we propose a multi-level blockchain structure and consensus algorithm to solve the vulnerability. A multi-level blockchain operates on IoT devices, and there is an IoT chain layer that stores sensor data to ensure reliability. In addition, there is a hyperledger fabric-based monitoring chain layer that operates the access control for the metadata and data of the IoT chain to lighten the weight. We propose an export consensus method between the two blockchains, the Schnorr signature method, and a random-based lightweight consensus algorithm within the IoT-Chain. Experiments to measure the blockchain size, propagation time, consensus delay time, and transactions per second (TPS) were conducted using IoT. The blockchain did not exceed a certain size, and the delay time was reduced by 96% to 99% on average compared to the existing consensus algorithm. In the throughput tests, the maximum was 1701 TPS and the minimum was 1024 TPS.
IOTA Tangle offers a promising approach for distributed ledger technology with the capability to compete with the traditional blockchain. To enable microtransactions the Internet of things (IoT) environment, IOTA employs a direct acrylic graph that ensures the integrity and immutability of the transactions. However, IoT data exhibit time sensitivity, wherein the value is lost after a period. Storing these temporary data for immutable storage would not be affordable in the distributed ledger. This study proposes a novel approach—referred to as D-Tangle—that enables data deletions in the Tangle architecture. To achieve this goal, D-Tangle divides transactions into three categories based on their expiration features and employs the climb-up writing technique. Extensive evaluations prove that D-Tangle enables instant deletions in finite lifetime data. Moreover, immutability and deletion upon request are guaranteed for unknown lifetime data.
The basic properties of blockchain, such as decentralization, security, and immutability, show promising potential for IoT applications. The main feature-decentralization of blockchain technology-depends on the consensus. However, consensus algorithms are mostly designed to work in extensive computational and communication environments for network security and immutability, which is not desirable for resource-restricted IoT applications. Many solutions are proposed to address this issue with modified consensus algorithms based on the legacy consensus, such as the PoW, PoS, and BFT, and new non-linear data structures, such as DAG. A systematic classification and analysis of various techniques in the field will be beneficial for both researchers and industrial practitioners. Most existing relevant surveys provide classifications intuitively based on the domain knowledge, which are infeasible to reveal the intrinsic and complicated relationships among the relevant basic concepts and techniques. In this paper, a powerful tool of systematic knowledge classification and explanation is introduced to structure the survey on blockchain consensus algorithms for resource-constrained IoT systems. More specifically, an ontology was developed for a consensus algorithm apropos of IoT adaptability. The developed ontology is subdivided into two parts-CONB and CONIoT-representing the classification of generic consensus algorithms and the ones that are particularly proposed for IoT, respectively. Guided by this ontology, an in depth discussion and analysis are provided on the major consensus algorithms and their IoT compliance based on design and implementation targets. Open research challenges and future research directions are provided.
Weiyi Wang, Jin Chen, Yutao Jiao, Jiawen Kang · 6 authors
Blockchain is considered the critical backbone technology for secure and trusted Internet of Things (IoT) in the future 6G network. However, deploying a blockchain system in a complex wireless IoT network is challenging due to the limited resources, complex wireless environment, and the property of self-interested IoT devices. The existing incentive mechanism of blockchain is not compatible with the wireless IoT network. In this article, to incentivize IoT devices to join the construction of the wireless blockchain network, we propose a multidimensional contract to optimize the blockchain utility while addressing the issues of adverse selection and moral hazard. Specifically, the proposed contract considers the IoT device’s hash power and communication cost and especially explores the connectivity of devices from the perspective of complex network theory. We investigate the energy consumption and the block confirmation probability of the wireless blockchain network via simulations under varied network sizes and average link probability. Numerical results demonstrate that our proposed contract mechanism is feasible, achieves 35% more utility than existing approaches, and increases utility by four times compared with the original PoW-based incentive mechanism.
Sergio Demian Lerner, Federico Jinich, Diego Masini, Shreemoy Mishra
Uncontrolled growth of blockchain state can adversely affect client performance, decentralization and security. Previous attempts to introduce duration-based state storage pricing or 'storage rent' in Ethereum have stalled, partly because of complexity. We present a new approach with finer granularity to "spread" rent payments across peers. Our proposal shifts the burden of state rent from accounts to transaction senders in a quasi-random manner. This proposal offers a simple path for initial adoption on Ethereum Virtual Machine (EVM) compatible chains, and serve as a foundation to address remaining challenges.
Many people donate money to fund organizations, but very rarely do those donors have information about where those donations go. Donation platforms are both non-transparent and also leave a large portion of potential donors unnoticed: gamers [1]. This paper explores the concept of utilizing blockchain technology and its existence as a web3 token-based platform in order to provide transparency for donation routes, showing donors and other companies exactly where donations are coming from and where that money is going. Our application utilizes HTTP requests in order to greatly increase compatibility, and also uses multiple private key encryptions in order to ensure that any user data or information and monetary transactions are kept secure and private [2].
Existing NFTs confront restrictions of one-time incentive and product isolation. Creators cannot obtain benefits once having sold their NFT products due to the lack of relationships across different NFTs, which results in controversial profit sharing. This paper proposes a referable NFT solution to extend the incentive sustainability of NFTs. We construct the referable NFT (rNFT) network to increase exposure and enhance the referring relationship of inclusive items. We introduce the DAG topology to generate directed edges between each pair of NFTs with corresponding weights and labels for advanced usage. We accordingly implement and propose the scheme under Ethereum Improvement Proposal (EIP) standards, indexed in EIP-5521. Further, we provide the mathematical formation to analyze the utility for each rNFT participant. The discussion gives general guidance among multi-dimensional parameters. The solution, as a result, shape the recognition of potential values hidden in isolated NFTs and raise the interest of communities toward the discovery of NFT derivatives. To our knowledge, this is the first study to build a referable NFT network, explicitly showing the virtual connections among NFTs.
Marco Marcozzi, Leonardo Mostarda, Diletta Cacciagrano
As micro grids and blockchain gained the interest and attention of both academia and the industry, the interaction between the two technologies seems inevitable. However, there are challenges to overcome in order to actually realize the integration between micro grids and blockchains. In this article, we review the solutions proposed to enhance micro grids with blockchains. We discuss the scalability challenges and the opportunities derived from the off-chaining computing techniques. In this context, we draft a design to implement a micro grid-based peer-to-peer local energy market, powered by an off-chain computing protocol called DIVERSITY. DIVERSITY aims to shift the computational burden from a main blockchain to an intermediate layer of nodes, aggregating data and executing smart contracts off-chain. We simulate different data logging approaches, and it is found that DIVERSITY allows an actual saving on fees and power consumption derived from using a public blockchain platform, such as Ethereum, in order to assure a truly decentralized renewable energy distribution at a lower cost.
Sina Kamali, Shayan Shabihi, Fakharian, Mohammad Taha, Alireza Arbabi · 7 authors
The consensus protocol is the core of a blockchain system which guarantees its secure and stable operation. Proof of Activity (PoA) is a consensus protocol that tries to address some of the issues pertinent to the most widely used protocols, such as Proof of Stake (PoS) and Proof of Work (PoW). However, it still needs to solve the issues regarding high energy consumption, significant resources required, high mining latency, and the need for private blockchains. In this paper, we propose Redefined Proof of Activity (RPoA), a new consensus protocol that builds on top of some of the best features of the existing protocols, such as PoW, PoS, and PoA, and values active service provided by users on the network. Our approach tries to address the issues above and falls in the service-based protocols category that gives mining credit to users as they serve on the network.
Over time, distribution systems have begun to include increased distributed energy resources (DERs) due to the advancement of auxiliary power electronics, information and communication technologies (ICT), and cost reductions. Electric vehicles (EVs) will undoubtedly join the energy community alongside DERs, and energy transfers from vehicles to grids and vice versa will become more extensive in the future. Virtual power plants (VPPs) will also play a key role in integrating these systems and participating in wholesale markets. Energy trading on a peer-to-peer (P2P) basis is a promising business model for transactive energy that aids in balancing local supply and demand. Moreover, a market scheme between VPPs can help DER owners make more profit while reducing renewable energy waste. For this purpose, an inter-VPP P2P trading scheme is proposed. The scheme utilizes cutting-edge technologies of the Avalanche blockchain platform, developed from scratch with decentralized finance (DeFi), decentralized applications (DApps), and Web3 workflows in mind. Avalanche is more scalable and has faster transaction finality than its layer-1 predecessors. It provides interoperability abilities among other common blockchain networks, facilitating inter-VPP P2P trading between different blockchain-based VPPs. The merits of DeFi contribute significantly to the workflow in this type of energy trading scenario, as the price mechanism can be determined using open market-like instruments. A detailed case study was used to examine the effectiveness of the proposed scheme and flow, and important conclusions were drawn.
The current distributed storage solutions are still concentrated in third-party storage service providers, and the stored data are concentrated in a few cloud servers, which inevitably brings the risk of data loss, leakage, and tampering, so it is imperative to study a distributed storage and decentralized storage system. How to maintain the consistency of data in a distributed environment has become a problem in building decentralized applications, until the emergence of blockchain technology, whose decentralized, non-tamperable, and traceable features can solve this problem well. In this paper, we design a decentralized storage system combining Hyperledger Fabric and Inter Planetary File System (IPFS). In addition, from the perspective of security and availability of the decentralized storage system, we study the partitioning and the k-r allocation scheme of the stored data, propose the allocation function about the stored files, derive the mathematical formula of file security and availability based on the allocation function, and discuss the optimal parameter setting of the allocation function based on the formula to guarantee the high security and availability of the stored files. The experimental results show that the performance of the k-r allocation policy based on the minimum number nodes (MNN) is better than that of the k-r allocation policy based on the minimum slices number (MSN); however, with the same security and availability guarantees, the MNN policy will have more copies relative to the MSN policy, which is relatively wasteful of space.
Conor Mullaney, Adnan Aijaz, Nathan Sealey, Ben Holden
Peer-to-Peer (P2P) energy trading provides various benefits over conventional wholesale energy markets and makes renewable energy more accessible. This paper proposes a novel multi-layer P2P energy trading system for microgrids based on IOTA 2.0, which is a distributed ledger technology (DLT) primarily designed for Internet-of-Things (IoT) applications. The proposed energy trading system, which is a manifestation of a cyber-physical system (CPS), exploits the benefits brought by IOTA's unique ledger structure as well as the recently introduced IOTA smart contract protocol (ISCP). Further, it implements a uniform double-auction market mechanism and a hierarchical routing structure for interconnected microgrids. Performance evaluation demonstrates key benefits over wholesale markets as well as speed, energy efficiency and cost benefits over conventional blockchain-based P2P energy trading systems.