Marc Leinweber, Niclas Kannengießer, Hannes Hartenstein, Ali Sunyaev
No abstract is available for this record.
Follow blockchain research across journals, conferences, and preprint repositories.
1,173 results · page 15 of 49
Marc Leinweber, Niclas Kannengießer, Hannes Hartenstein, Ali Sunyaev
No abstract is available for this record.
Georgia Osborn, Nathan Alan
Blockchain, or Web3 technology has the potential to disrupt the everyday use of the Internet. The polarised discussion around blockchain technology is notoriously difficult to navigate between the opposing narratives of blockchain evangelists and skeptics. This article focuses on blockchain domain names, a rapidly growing trend using blockchain technology that is currently non-interoperable with the Domain Name System (DNS) and therefore, out of scope of traditional Internet governance. Alternative DNS roots are not new and have previously not become popular due to the lack of supporting browsers. On one view, blockchain domain names are nothing more than another alternative root, insignificant and undeserving of attention. Other narratives regard them as offering an exciting prospect of a decentralised and novel way for managing online naming and addressing. This study explores the burgeoning growth, assesses the challenges of blockchain domain names and provides five recommendations to address them. Although many in traditional Internet communities may be hostile or ignore the blockchain alternative for naming and addressing, we argue that a pragmatic response should be adopted. Even if it is not clear that blockchain domain names solve any problems not currently solved by the DNS, the increase in registrations continues to rise and diverse Internet communities must keep ahead of the trends to understand them and integrate policy implications. Furthermore, the technologies will continue to advance and due to the decentralised nature of the blockchain, developments or changes can be more rapidly implemented than within the DNS.
Martijn de Vos, Georgy Ishmaev, Johan Pouwelse
The popularity of blockchain technology has bootstrapped many “Web3” applications, e.g., Ethereum and IPFS, that apply distributed ledger technology to store transactions. The amount of transactions generated and stored in such Web3 applications is significant and, in its raw form, usually not searchable by users. Existing Web3 transaction indexing and search engines are predominantly centralized and, therefore, can manipulate search results or censor particular queries. With the proliferation of Web3 transactions and applications, a decentralized and censorship-resistant search primitive is becoming essential. We present DeScan, a decentralized and censorship-resistant indexing and search engine for Web3. Users index their local Web3 transactions using custom rules that output triplets. Generated triplets are bundled in a distributed transaction graph that is searchable by other users. To coordinate search and distribute the storage of the transaction graph over peers in the network, we build upon a Skip Graph (SG) data structure. Since the Skip Graph does not provide any resilience against adversarial peers that censor searches, we propose four modifications to improve its robustness. We implement DeScan and conduct experiments with up to 12 800 peers and 10 million Ethereum transactions. Our experiments show that DeScan with our modifications enabled can tolerate 20% adversarial peers and 35% unresponsive peers without disruption. Moreover, we find that searches in DeScan are usually completed well within a second, even when the network grows. Finally, we show that storage and network costs are evenly distributed amongst peers as the network grows.
D. Coll-Mayor, A. Notholt
The use of distributed data storage and management structures, such as Distributed Ledger Technologies (DLT), in the energy sector has gained great interest in recent times. This opens up new possibilities in e.g. microgrid management, aggregation of distributed resources, peer-to-peer trading, integration of electromobility or proof-of-origin strategies. However, in order to benefit from those new possibilities, new challenges have to be overcome. This work focuses on one of these challenges, which is the need to ensure interoperability when integrating DLT-enabled devices in energy use cases. Firstly, the use of DLTs in the energy sector will be analyzed and the main use cases will be presented. Then, a classification of DLT-Energy use cases will be proposed. Secondly, the need for a common reference architecture framework to analyze those use cases with a focus on interoperability will be discussed and the current activities in research and standardization in this field will be presented. Finally, a new common reference architecture framework based on current activities in standardization will be presented.
Seung Wook Jung
Due to the immutability of blockchain, many applications are emerging by providing trust to the trustless Internet. However, immutability becomes a weakness in some applications that require modification and deletion, such as personal information and SNS(Social Network Service), and cannot use blockchain technology. Therefore, in this paper, we propose a redactable blockchain scheme that can be used universally regardless of the consensus algorithms and blockchain types. In addition, without using a heavy cryptographic algorithm, and needing to re-mine, the proposed scheme can delete and modify content in the ledger, so it is efficient. Moreover, the proposed scheme can modify and delete at the transaction level. Additionally, the proposed scheme supports encryption for protecting the privacy and there is no need to save the original content after modification or deletion.
Nana Kwadwo Akrasi‐Mensah, Andrew Selasi Agbemenu, Henry Nunoo‐Mensah, Eric Tutu Tchao · 9 authors
Blockchain-IIoT integration into industrial processes promises greater security, transparency, and traceability. However, this advancement faces significant storage and scalability issues with existing blockchain technologies. Each peer in the blockchain network maintains a full copy of the ledger which is updated through consensus. This full replication approach places a burden on the storage space of the peers and would quickly outstrip the storage capacity of resource-constrained IIoT devices. Various solutions utilizing compression, summarization or different storage schemes have been proposed in literature. The use of cloud resources for blockchain storage has been extensively studied in recent years. Nonetheless, block selection remains a substantial challenge associated with cloud resources and blockchain integration. This paper proposes a deep reinforcement learning (DRL) approach as an alternative to solving the block selection problem, which involves identifying the blocks to be transferred to the cloud. We propose a DRL approach to solve our problem by converting the multi-objective optimization of block selection into a Markov decision process (MDP). We design a simulated blockchain environment for training and testing our proposed DRL approach. We utilize two DRL algorithms, Advantage Actor-Critic (A2C), and Proximal Policy Optimization (PPO) to solve the block selection problem and analyze their performance gains. PPO and A2C achieve 47.8% and 42.9% storage reduction on the blockchain peer compared to the full replication approach of conventional blockchain systems. The slowest DRL algorithm, A2C, achieves a run-time 7.2 times shorter than the benchmark evolutionary algorithms used in earlier works, which validates the gains introduced by the DRL algorithms. The simulation results further show that our DRL algorithms provide an adaptive and dynamic solution to the time-sensitive blockchain-IIoT environment.
Sergiu Lupaiescu, Petru Cioată, Cristina Elena Turcu, Cristina Elena Turcu · 8 authors
Decentralized databases have gained popularity in the last few years in different areas, such as: traceability, supply chains or finance. Leveraging this type of emerging technology will improve knowledge sharing, as well as the transparency and traceability of the data for digital systems. In a similar way, the characteristics are advertised by the centralized ledger technologies, which are manufactured by large cloud service providers such as Amazon. The present study analyzes the performance of two ledger technologies: BigchainDB (i.e., the decentralized blockchain database) and Amazon QLDB (i.e., the centralized ledger database with transparent and immutable characteristics). For the purposes of comparison, we have integrated these technologies into our traceability platform, which is called the Smart Tracking Platform (STP), and performed a series of experiments enabling us to acquire data for different metrics, such as CPU or memory usage for both the reading and writing operations. The findings of the present study show that QLDB has an overall better performance compared to BigchainDB, based on the metrics that have been considered. From the perspective of database ledger implementation, Amazon QLDB proved to be an integrated solution, easier to use, while BigchainDB comprises a more complex system to be implemented and developed, but is more flexible. Although both systems are almost ready to use solutions for local environments, when it comes to configuration and setting up the communication between nodes within a production environment, BigchainDB adds a layer of complexity from a DevOps perspective, while Amazon QLDB completely overcomes it. Depending on the area considered and the identified needs, both BigchainDB and Amazon QLDB can be considered as suitable solutions for a ledger database.
Weijia Wang, Yuanbo Shi
Aiming at the transaction problem of multi-source heterogeneous distribution network, a P2P intelligent contract based on blockchain technology is proposed. Firstly, a multi-source heterogeneous distribution network model based on Intelligent contract is established. Secondly, a multi-source heterogeneous distribution network market transaction mechanism is proposed. The mechanism designs different kinds of transaction members, frameworks and processes. Transaction members can participate in the market quotation and determine the transaction unit price according to their own power surplus and shortage state. Finally, a smart contract solution with blind beat mechanism is designed for the proposed transaction mechanism. The effectiveness of the transaction mechanism is verified by an example and deployed on the Ethereum private chain. The effectiveness of the transaction mechanism is verified by an example and deployed on the Ethereum private chain. Through the simulation transaction analysis, it can be seen that the above transaction mechanism effectively improves the economic benefits of trading members and effectively ensures the market security and free competition.
Chonghe Zhao, Taotao Wang, Shengli Zhang, Soung Chang Liew
Compact block, which replaces transactions in the block with their hashes, is an effective means to speed up block propagation in the Bitcoin network. The compact block mechanism in Bitcoin counts on the fact that many nodes may already have the transactions (or most of the transactions) in the block, therefore sending the complete block containing the full transactions is unnecessary. This fact, however, does not hold in the Ethereum network. Adopting compact block directly in Ethereum may degrade the block propagation speed significantly because the probability of a node not having a transaction in the sending block is relatively high in Ethereum and requesting the missing transactions after receiving the compact block takes much additional time. To investigate the factors that prevent compact block in Ethereum, we set up probe nodes to collect data from Ethereum MainNet and performed data analysis. Our analysis results indicate that the missing transactions could be attributed to factors such as small transaction pools, network latency, and miners' selfish behaviors. Moreover, simply enlarging the transaction pool and using the prediction algorithm proposed for Bitcoin to predict the missing transactions and prefetch them do not work for Ethereum. This article proposes hybrid-compact block (HCB), an efficient compact block propagation scheme for Ethereum and other similar blockchains. First, we develop a Secondary Pool to store the low-fee transactions, which are removed from the primary transaction pool, to conserve storage space. As simple auxiliary storage, the Secondary Pool does not affect the normal block processing of the primary pool in Ethereum. Second, we design a machine learning-based transaction prediction module to precisely predict the missing transactions caused by network latency and selfish behaviors. We implemented our HCB scheme and other compact-block-like schemes (as benchmarks) and deployed a number of worldwide nodes over Ethereum MainNet to experimentally investigate them. Experimental results show that HCB performs best among the existing compact-block-like schemes and can reduce propagation time by more than half with respect to the current block propagation scheme in Ethereum.
Yuanzhe Zhang, Shirui Pan, Jiangshan Yu
The scalability problem has been one of the most significant barriers limiting the adoption of blockchains. Blockchain sharding is a promising approach to this problem. However, the sharding mechanism introduces a significant number of cross-shard transactions, which are expensive to process. This paper focuses on the transaction allocation problem to reduce the number of cross-shard transactions for better scalability. In particular, we systematically formulate the transaction allocation problem and convert it to the community detection problem on a graph. A deterministic and fast allocation scheme TxAllo is proposed to dynamically infer the allocation of accounts and their associated transactions. It directly optimizes the system throughput, considering both the number of cross-shard transactions and the workload balance among shards. We evaluate the performance of TxAllo on an Ethereum dataset containing over 91 million transactions. Our evaluation results show that for a blockchain with 60 shards, TxAllo reduces the cross-shard transaction ratio from 98% (by using traditional hash-based allocation) to about 12%. In the meantime, the workload balance is well maintained. Compared with other methods, the execution time of TxAllo is almost negligible. For example, when updating the allocation every hour, the execution of TxAllo only takes 0.5 seconds on average, whereas other concurrent works, such as BrokerChain (INFOCOM'22) leveraging the classic METIS method, require 422 seconds.
Keundug Park, Heung-Youl Youm
This paper proposes a solution to the transfer problem between blockchain-based heterogeneous cryptocurrencies and CBDCs, with research derived from an analysis of the existing literature. Interoperability between heterogeneous blockchains has been an obstacle to service diversity and user convenience. Many types of cryptocurrencies are currently trading on the market, and many countries are researching and testing central bank digital currencies (CBDCs). In this paper, existing interoperability studies and solutions between heterogeneous blockchains and differences from the proposed service model are described. To enhance digital financial services and improve user convenience, transfer between heterogeneous cryptocurrencies, transfer between heterogeneous CBDCs, and transfer between cryptocurrency and CBDC should be required. This paper proposes an interoperable architecture between heterogeneous blockchains, and a decentralized peer-to-peer (P2P) service model based on the interoperable architecture for transferring between blockchain-based heterogeneous cryptocurrencies and CBDCs. Security threats to the proposed service model are identified and security requirements to prevent the identified security threats are specified. The mentioned security threats and security requirements should be considered when implementing the proposed service model.
Hechuan Guo, Minghui Xu, Jiahao Zhang, Chunchi Liu · 7 authors
Decentralized Storage Networks (DSNs) can gather storage resources from mutually untrusted providers and form worldwide decentralized file systems. Compared to traditional storage networks, DSNs are built on top of blockchains, which can incentivize service providers and ensure strong security. However, existing DSNs face two major challenges. First, deduplication can only be achieved at the directory-level. Missing file-level deduplication leads to unavoidable extra storage and bandwidth cost. Second, current DSNs realize file indexing by storing extra metadata while blockchain ledgers are not fully exploited. To overcome these problems, we propose FileDAG, a DSN built on DAG-based blockchain to support file-level deduplication in storing multi-versioned files. When updating files, we adopt an increment generation method to calculate and store only the increments instead of the entire updated files. Besides, we introduce a two-layer DAG-based blockchain ledger, by which FileDAG can provide flexible and storage-saving file indexing by directly using the blockchain database without incurring extra storage overhead. We implement FileDAG and evaluate its performance with extensive experiments. The results demonstrate that FileDAG outperforms the state-of-the-art industrial DSNs considering storage cost and latency.
Md Mamunur Rashid, Piljoo Choi, Suk‐Hwan Lee, Kyung Youn Kim · 5 authors
Blockchain and Internet of Things (IoT) have become one of the most researched topics in recent years. The application areas of both these fields are quite broad and one can complement the other in bringing in the best possible outcome. Keeping that in mind, this paper proposed how Blockchain can be utilized to provide a more secure and improved IoT ecosystem where the components of the ecosystem will be more protected and less susceptible to unwanted intrusions. We also considered using InterPlanetary File System (IPFS) and Hyperledger Fabric as a means of IoT data storage, which can ensure better protection compared to centralized cloud storage. We have also utilized Ethereum Smart Contracts (SC) for Proof of Concept deployment of our model. The experimental outcome as well as the cost and security analysis of our deployed Smart Contracts suggest that it is more beneficial to use Blockchain and distributed storage systems to safeguard the IoT ecosystem and its data.
Morteza Alizadeh, Karl Andersson, Olov Schelén
User identification in decentralized systems is a demanding task. Identification systems should work resiliently and have efficient performance. Moreover, identification systems should protect the data that they must store against hackers and saboteurs. Keeping a system with decentralized identification without any intervention in the middle has attracted attention to improve earlier centralized identification systems. Decentralized Identifiers (DIDs) constitute a solution for identification divided into different modules. The verifiable data registry is one of the main parts of this technology, which is distributed storage of identity properties. We analyze the decentralized identification data registry and compare the performance of verifiable data registry based on blockchain and the Distributed Hash Table (DHT) on different scales of systems. Our evaluation results show that DHT has better performance. Furthermore, a model based on DHT shows that in addition to immutable storage and faster query time, it makes systems handle or search in data storage with lower searching time compared to Ethereum Blockchain as another immutable secure technology. Finally, our results show that DHT is a better solution than other models in different scenarios. Although blockchain has promising results on a small scale, it still has problems with storage and query time in large-scale systems.
J. D. Preece, Christopher J. Morris, John M. Easton
The System for Ticketing Ubiquity with Blockchains (STUB) is a novel solution to multi-modal transport ticketing. Introduced previously using Hyperledger Fabric, STUB utilises the distributed mechanics of blockchain technology right at the core of its architecture, allowing stakeholders from different transport modes to vend and validate tickets on a shared ledger. This open approach to ticketing data will benefit transport governing bodies, transport operators, and passengers alike by ensuring cross-party cooperation and presenting a fresh holistic approach to the ticketing sector. This paper addresses issues from STUB 1.0, concerning validating tickets for a multi-modal transport system. To overcome this, we propose creating a graph structure, known as the Transport Network Graph (TNG), to represent the transport network with all of the services provided by the Transport Service Providers (TSPs). This enables the implementation of an automated Revenue Allocation System (RAS), whilst retaining the benefits provided by blockchain technology.
Pedro Ákos Costa, João Leitão, Yannis Psaras
Web3 aims at creating a decentralized platform that is competitive with modern cloud infrastructures that support today's Internet. However, Web3 is still limited, supporting only applications in the domains of content creation and sharing, decentralized financing, and decentralized communication. This is mainly due to the technologies supporting Web3: blockchain, IPFS, and libp2p, that although provide a good collection of tools to develop Web3 applications, are still limited in terms of design and performance. This motivates the need to better understand these technologies as to enable novel optimizations that can push Web3 to its full potential. Unfortunately, understanding the current behavior of a fully decentralized large-scale distributed system is a difficult task, as there is no centralized authority that has full knowledge of the system operation. To this end, in this paper we characterize the workload of IPFS, a key enabler of Web3. To achieve this, we have collected traces from accesses performed by users to one of the most popular IPFS gateways located in North America for a period of two weeks. Through the fine analysis of these traces, we gathered the amount of requests to the system, and found the providers of the requested content. With this data, we characterize both the popularity of requested and provided content, as well as their geo-location (by matching IP address with the MaxMind database). Our results show that most of the requests in IPFS are only to a few different content, that is provided by large portion of peers in the system. Furthermore, our analysis also shows that most requests are provided by the two largest portions of providers in the system, located in North America and Europe. With these insights, we conclude that the current IPFS architecture is sub-optimal and propose a research agenda for the future.
Khaleel Mershad, Omar Cheikhrouhou
The proliferation of resource-constrained devices has become prevalent across various digital applications, including smart homes, smart healthcare, and smart transportation, among others. However, the integration of these devices brings many security issues. To address these concerns, Blockchain technology has been widely adopted due to its robust security characteristics, including immutability, cryptography, and distributed consensus. However, implementing blockchain within these networks is highly challenging due to the limited resources of the employed devices and the resource-intensive requirements of the blockchain. To overcome these challenges, a multitude of researchers have proposed lightweight blockchain solutions specifically designed for resource-constrained networks. In this paper, we present a taxonomy of lightweight blockchain solutions proposed in the literature. More precisely, we identify five areas within the "lightweight" concept, namely, blockchain architecture, device authentication, cryptography model, consensus algorithm, and storage method. We discuss the various methods employed in each "lightweight" category, highlighting existing gaps and identifying areas for improvement. Our review highlights the missing points in existing systems and paves the way to building a complete lightweight blockchain solution for networks of resource-constrained devices.
Yustus Eko Oktian, Thi-Thu-Huong Le, Uk Jo, Howon Kim
With the limited Internet bandwidth in a given area, unlimited data plans can create congestion because there is no retribution for transmitting many packets. The real-time pricing mechanism can inform users of their Internet consumption to limit congestion during peak hours. However, implementing real-time pricing is opex-heavy from the network provider side and requires high-integrity operations to gain consumer trust. This paper aims to leverage the software-defined network to solve the opex issues and blockchain technology to solve trust issues. First, the network congestion level in a given area is analyzed. Then, the price is adjusted accordingly. Devices that send a lot of traffic during congestion will be charged more expensive bills than if transmitting traffic during an off-peak period. To prevent over-charging, the consumers can pre-configure a customized Internet profile stating how many data bytes they are willing to send during congestion. The software-defined controller also authenticates consumers and checks whether they have enough token deposits in the blockchain as Internet usage fees. We implement our work using Ethereum and POX controllers. The experiment results show that the proposed real-time pricing can be performed seamlessly, and the network provider can reap up to 72.91% more profits than existing approaches, such as usage-based pricing or time-dependent pricing. The fairness and trustability of real-time pricing is also guaranteed through the proof-of-usage mechanism and the transparency of the blockchain.
Xin Xie, Cunqing Hua, Jianan Hong, Pengwenlong Gu · 5 authors
Blockchain has been deemed as a promising solution for providing security and privacy protection in the next-generation wireless networks. Large-scale concurrent access for massive wireless devices to accomplish the consensus procedure may consume prohibitive communication and computing resources, and thus may limit the application of blockchain in wireless conditions. As most existing consensus protocols are designed for wired networks, directly apply them for wireless users equipment (UEs) may exhaust their scarce spectrum and computing resources. In this paper, we propose AirCon, a byzantine fault-tolerant (BFT) consensus protocol for wireless UEs via the over-the-air computation. The novelty of AirCon is to take advantage of the intrinsic characteristic of the wireless channel and automatically achieve the consensus in the physical layer while receiving from the UEs, which greatly reduces the communication and computational cost that would be caused by traditional consensus protocols. We implement the AirCon protocol integrated into an LTE system and provide solutions to the critical issues for over-the-air consensus implementation. Experimental results are provided to show the feasibility of the proposed protocol, and simulation results to show the performance of the AirCon protocol under different wireless conditions.
Hafiz Abid Mahmood Malik, Asghar Ali Shah, AbdulHafeez Muhammad, Ahmad Kananah · 5 authors
The Internet of Things is a system of interconnected smart devices that can communicate with each other and with other devices over the Internet, with or without human-to-human or human-to-computer interaction. Although IoT devices, which have IPs, make living easier, they are also a threat to the security and privacy of people. This research work presents a solution to the problem of security in the network of IoT, based on the idea of implementing the blockchain in IoT. Blockchain is a decentralized technology that adds blocks at the end of the chain. It saves the hash value for every block, and corresponds to the previous block. The decentralized behavior of blockchain is best for IoT as an extensive network, because IoT must not have a single point of failure, and one entity must not decide what to do. All the capable storage devices will save the same data entered from any device, removing the risk of receiving altered data.
Miguel Sánchez‐de la Rosa, Carlos Núñez‐Gómez, Blanca Caminero, Carmen Carrión
Summary Fog computing has become a complementary technology to cloud computing and addresses some of the cloud computing threats such as the response time and network bandwidth demand. Fog computing successes processing data and storing data near to the edge, and usually is combined with container virtualization to provide hardware isolation. Empowered by these capabilities, numerous Internet of Things (IoT) applications are developed as virtualized instances on resource‐constrained fog nodes such as single‐board computers (SBC). In addition, blockchain has emerged as a key technology that is transforming the way we share information. Blockchain technology represents a decentralised, distributed, and immutable database ledger and is a potential solution for the distributed ecosystem of IoT applications. The distributed structure of blockchain is naturally suitable for IoT applications. However, it introduces new challenges related to CPU overhead or response time. This paper proposes a layered architecture that integrates blockchain technology and OS‐level virtualization technology to develop fog‐based IoT applications. It also provides insights for future deployments through a proof‐of‐concept use case harnessing SBCs, in this case Raspberry Pi, as blockchain‐enabled fog nodes to drive virtualized IoT applications. The study shows that the maximum CPU overhead added by a permissioned blockchain based on Ethereum on the Raspberry Pi is around a 25% under stress situations while the overhead introduced by the sealer process is negligible. These results support the feasibility of using blockchain on resource‐constrained fog nodes for supporting IoT applications.
Nadhira Khezami, Nourcherif Gharbi, Bilel Neji, Naceur Benhadj Braïek
Satisfying the world’s rapidly increasing demands in energy via the optimized management of available resources is becoming one of the most important research trends worldwide. When it comes to energy, it is very important to talk about decentralization, security, traceability and transparency. Thus, over the last few years, numerous research works have presented blockchain technology as the best novel business platform enabling a secure, transparent and tamper-proof energy management solution. In this paper, we conducted a systematic literature review (SLR) using the PRISMA framework of the different existing research studies related to the use of the blockchain technology in the energy sector, published between 2008 and 2021. We identified a total of 769 primary studies after intensive manual analysis and filtering, which we thoroughly assessed using various criteria to address six main research questions that covered the blockchain types, applications and platforms in the energy sector, the energy source types for which blockchain platforms are implemented, the emergent technologies that are combined to blockchain solutions, and the types of consensuses used in energy blockchains. Based on the collected survey data, we built a database to categorize the existing research works, identify research trends, and highlight knowledge gaps and potential areas for additional field study.
Xiaofeng Xue, Haokun Mao, Qiong Li, Furong Huang · 5 authors
Specializing Directed Acyclic Graph Federated Learning (SDAGFL) is a new federated learning framework with the advantages of decentralization, personalization, resisting a single point of failure, and poisoning attack. Instead of training a single global model, the clients in SDAGFL update their models asynchronously from the devices with similar data distribution through Directed Acyclic Graph Distributed Ledger Technology (DAG-DLT), which is designed for IoT scenarios. Because of many the features inherited from DAG-DLT, SDAGFL is suitable for IoT scenarios in many aspects. However, the training process of SDAGFL is quite energy consuming, in which each client needs to compute the confidence and rating of the nodes selected by multiple random walks by traveling the ledger with 15–25 depth to obtain the “reference model” to judge whether or not to broadcast the newly trained model. As we know, the energy consumption is an important issue for IoT scenarios, as most devices are battery-powered with strict energy restrictions. To optimize SDAGFL for IoT, an energy-efficient SDAGFL based on an event-triggered communication mechanism, i.e., ESDAGFL, is proposed in this paper. In ESDAGFL, the new model is broadcasted only in the event that the new model is significantly different from the previous one, instead of traveling the ledger to search for the “reference model”. We evaluate the ESDAGFL on the FMNIST-clustered and Poets dataset. The simulation is performed on a platform with Intel®CoreTM i7-10700 CPU (CA, USA). The simulation results demonstrate that ESDAGFL can reach a balance between training accuracy and specialization as good as SDAGFL. What is more, ESDAGFL can reduce the energy consumption by 42.5% and 51.7% for the FMNIST-clustered and Poets datasets, respectively.
Bing Li, Maode Ma
Abstract Named data networking (NDN) has been viewed as a promising future Internet architecture due to its data-centric design. It requires a new security model that is orienting data but not devices. In this paper, an advanced hierarchical identity-based security mechanism by blockchain (AHISM-B) is to be proposed for the NDN networks. On one hand, the hierarchical identity-based cryptology is used to bind the data name to a public key. The valid public parameters would be requested by consumers with the Interest packets so that consumers would compose producers’ public keys to authenticate producers and verify the integrity of the Data packets. On the other hand, a blockchain is employed to manage public parameters to avoid catastrophes due to a single node failure. Both of the security proof result and the formal validation result indicate that the proposed AHISM-B is secure. Moreover, the simulation results show that the performance of our AHISM-B outperforms that of the classic NDN scheme. Especially, the average response delay of the AHISM-B scheme is less by 8% than that of the classic NDN scheme. With the increase of the average arrival rate of Interest packets, the advantage of the AHISM-B could be enhanced further to 11%.