Cooperative perception is an essential and widely discussed application of connected automated vehicles. However, the authenticity of perception data is not ensured, because the vehicles cannot independently verify the event they did not see. Many methods, including trust-based (i.e., statistical) approaches and plausibility-based methods, have been proposed to determine data authenticity. However, these methods cannot verify data without a priori knowledge. In this study, a novel approach of constructing a self-proving data from the number plate of target vehicles was proposed. By regarding the pseudonym and number plate as a shared secret and letting multiple vehicles prove they know it independently, the data authenticity problem can be transformed to a cryptography problem that can be solved without trust or plausibility evaluations. Our work can be adapted to the existing works including ETSI/ISO ITS standards while maintaining backward compatibility. Analyses of common attacks and attacks specific to the proposed method reveal that most attacks can be prevented, whereas preventing some other attacks, such as collusion attacks, can be mitigated. Experiments based on realistic data set show that the rate of successful verification can achieve 70\% to 80\% at rush hours.
In a space-air-ground integrated network (SAGIN), managing resources for the growing number of highly-dynamic and heterogeneous radios is a challenging task. Symbiotic communication (SC) is a novel paradigm, which leverages the analogy of the natural ecosystem in biology to create a radio ecosystem in wireless networks that achieves cooperative service exchange and resource sharing, i.e., service/resource trading, among numerous radios. As a result, the potential of symbiotic communication can be exploited to enhance resource management in SAGIN. Despite the fact that different radio resource bottlenecks can complement each other via symbiotic relationships, unreliable information sharing among heterogeneous radios and multi-dimensional resources managing under diverse service requests impose critical challenges on trusted trading and intelligent decision-making. In this article, we propose a secure and smart symbiotic SAGIN (S^4) framework by using blockchain for ensuring trusted trading among heterogeneous radios and machine learning (ML) for guiding complex service/resource trading. A case study demonstrates that our proposed S^4 framework provides better service with rational resource management when compared with existing schemes. Finally, we discuss several potential research directions for future symbiotic SAGIN.
As the Metaverse is iteratively being defined, its potential to unleash the next wave of digital disruption and create real-life value becomes increasingly clear. With distinctive features of immersive experience, simultaneous interactivity, and user agency, the Metaverse has the capability to transform all walks of life. However, the enabling technologies of the Metaverse, i.e., digital twin, artificial intelligence, blockchain, and extended reality, are known to be energy-hungry, therefore raising concerns about the sustainability of its large-scale deployment and development. This article proposes Green Metaverse Networking for the first time to optimize energy efficiencies of all network components for Metaverse sustainable development. We first analyze energy consumption, efficiency, and sustainability of energy-intensive technologies in the Metaverse. Next, focusing on computation and networking, we present major advancements related to energy efficiency and their integration into the Metaverse. A case study of energy conservation by incorporating semantic communication and stochastic resource allocation in the Metaverse is presented. Finally, we outline the critical challenges of Metaverse sustainable development, thereby indicating potential directions of future research towards the green Metaverse.
The execution of decentralized applications on blockchains is limited today by technical and organizational barriers, including scalability and the high complexity to specify execution correctly for developers as well as for domain experts in organizations. Overcoming these limitations could allow for decentralized coordination beyond data, where distributed parties rely on higher-level abstractions for coordinating their actions using decentralized applications, not limited to organizations. Towards this goal, the paper at hand proposes executable models as high-level abstraction that can be observed and tracked by distributed parties. In particular, it is investigated how executable models on cloud platforms can be coupled with smart contracts for tracking their execution, concluding with an architecture as exploratory research result towards supporting scalability and decentralized coordination.
A large amount of data has been accumulated. with the development of the Internet industry. Many problems have been exposed with data explosion: 1. The contradiction between data privacy and data collaborations; 2. The contradiction between data ownership and the right of data usage; 3. The legality of data collection and data usage; 4. The relationship between the governance of data and the governance of rules; 5. Traceability of evidence chain. In order to face such a complicated situation, many algorithms were proposed and developed. This article tries to build a model from the perspective of blockchain to make some breakthroughs.Internet Of Rights(IOR) model uses multi-chain technology to logically break down the consensus mechanism into layers, including storage consensus, permission consensus, role consensus, transaction consensus etc. thus to build a new infrastructure, which enables data sources with complex organizational structures and interactions to collaborate smoothly on the premise of protecting data privacy. With blockchain's nature of decentralization, openness, autonomy, immutability, and controllable anonymity, Internet Of Rights(IOR) model registers the ownership of data, enables applications to build ecosystem based on responsibilities and rights. It also provides cross-domain processing with privacy protection, as well as the separation of data governance and rule governance. With the processing capabilities of artificial intelligence and big data technology, as well as the ubiquitous data collection capabilities of the Internet of Things, Internet Of Rights(IOR) model may provide a new infrastructure concept for realizing swarm intelligence and building a new paradigm of the Internet, i.e. intelligent governance.
Michael Xevgenis, Dimitrios Kogias, Ioannis Christidis, Charalampos Patrikakis · 5 authors
A new era in ICT has begun with the evolution of Next Generation Networks (NGNs) and the development of human-centric applications. Ultra-low latency, high throughput, and high availability are a few of the main characteristics of modern networks. Network Providers (NPs) are responsible for the development and maintenance of network infrastructures ready to support the most demanding applications that should be available not only in urban areas but in every corner of the earth. The NPs must collaborate to offer high-quality services and keep their overall cost low. The collaboration among competitive entities can in principle be regulated by a trusted 3rd party or by a distributed approach/technology which can guarantee integrity, security, and trust. This paper examines the use of blockchain technology for resource management and negotiation among NPs and presents the results of experiments conducted in a dedicated real testbed. The implementation of the resource management mechanism is described in a Smart Contract (SC) and the testbeds use the Raft and the IBFT consensus mechanisms respectively. The goal of this paper is two-fold: to assess its performance in terms of transaction throughput and latency so that we can assess the granularity at which this solution can operate (e.g. support resource re-allocation among NPs on micro-service level or not) and define implementation-specific parameters like the consensus mechanism that is the most suitable for this use case based on performance metrics.
Richard Blythman, Mohamed Arshath, Jakub Smékal, Hithesh Shaji · 6 authors
AI requires heavy amounts of storage and compute. As a result, AI developers are regular users of centralised cloud services such as AWS, GCP and Azure, compute environments such as Jupyter and Colab notebooks, and AI Hubs such as HuggingFace and ActiveLoop. There services are associated with certain benefits and limitations that stem from the underlying infrastructure and governance systems with which they are built. These limitations include high costs, lack of monetization and reward, lack of control and difficulty of reproducibility. At the same time, there are few libraries that allow data scientists to interact with decentralised storage in the language that data scientists are used to, and few hubs where they can discover and interact with AI assets. In this report, we explore the potential of decentralized technologies - such as Web3 wallets, peer-to-peer marketplaces, decentralized storage (IPFS and Filecoin) and compute, and DAOs - to address some of the above limitations. We showcase some of the libraries and integrations that we have built to tackle these issues, as well as a proof of concept of a decentralized AI Hub app, that all use IPFS as a core infrastructural component.
Web 3.0 enables user-generated contents and user-selected authorities. With the help of decentralized wireless edge computing architectures, Web 3.0 allows users to read, write, and own contents. A core technology that enables Web 3.0 goals is blockchain, which provides security services by recording content in a decentralized and transparent manner. However, the explosion of on-chain recorded contents and the fast-growing number of users cause increasingly unaffordable computing and storage resource consumption. A promising paradigm is to analyze the semantic information of contents that can convey precisely the desired meanings without consuming many resources. In this article, we propose a unified blockchainse-mantic ecosystems framework for wireless edge intelligence-enabled Web 3.0. Our framework consists of six key components to exchange semantic demands. We then introduce an Oracle-based proof of semantic mechanism to implement on-chain and off-chain interactions of Web 3.0 ecosystems on semantic verification algorithms while maintaining on-chain and off-chain service security. An adaptive Deep Reinforcement Learning-based sharding mechanism on Oracle is designed to improve interaction efficiency, which can facilitate Web 3.0 ecosystems to deal with varied semantic demands. Finally, a case study is presented to show that the proposed framework can dynamically adjust settines according to varied semantic demands.
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.
Blockchains have become the catalyst for a growing movement to create a more decentralized Internet. A fundamental operation of applications in a decentralized Internet is data storage and retrieval. As today's blockchains are limited in their storage functionalities, in recent years a number of peer-to-peer data storage networks have emerged based on the Kademlia distributed hash table protocol. However, existing Kademlia implementations are not efficient enough to support fast data storage and retrieval operations necessary for (decentralized) Web applications. In this paper, we present Kadabra, a decentralized protocol for computing the routing table entries in Kademlia to accelerate lookups. Kadabra is motivated by the multi-armed bandit problem, and can automatically adapt to heterogeneity and dynamism in the network. Experimental results show Kadabra achieving between 15-50% lower lookup latencies compared to state-of-the-art baselines.
Leonhard Balduf, Martin Florian, Björn Scheuermann
We explore issues relating to the storage of digital art, based on an empirical investigation into the storage of audiovisual data referenced by non-fungible tokens (NFTs). We identify current trends in NFT data storage and highlight problems with implemented solutions. We particularly focus our investigation on the use of the Interplanetary Filesystem (IPFS), which emerges as a popular and versatile distributed storage solution for NFTs. Based on the analysis of discovered data storage techniques, we propose a set of best practices to ensure long-term storage survivability of NFT data. While helpful for forming the NFT art market into a legitimate long-term environment for digital art, our recommendations are also directly applicable for improving the availability and integrity of non-NFT digital art.
Open access
2 source records
Advanced Data Storage Technologies
Digital and Traditional Archives Management
Advanced Steganography and Watermarking Techniques
Payment channel networks (PCNs) are a layer-2 blockchain scalability solution, with its main entity, the payment channel, enabling transactions between pairs of nodes "off-chain," thus reducing the burden on the layer-1 network. Nodes with multiple channels can serve as relays for multihop payments by providing their liquidity and withholding part of the payment amount as a fee. Relay nodes might after a while end up with one or more unbalanced channels, and thus need to trigger a rebalancing operation. In this paper, we study how a relay node can maximize its profits from fees by using the rebalancing method of submarine swaps. We introduce a stochastic model to capture the dynamics of a relay node observing random transaction arrivals and performing occasional rebalancing operations, and express the system evolution as a Markov Decision Process. We formulate the problem of the maximization of the node's fortune over time over all rebalancing policies, and approximate the optimal solution by designing a Deep Reinforcement Learning (DRL)-based rebalancing policy. We build a discrete event simulator of the system and use it to demonstrate the DRL policy's superior performance under most conditions by conducting a comparative study of different policies and parameterizations. Our work is the first to introduce DRL for liquidity management in the complex world of PCNs.
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.
Muhammad Asghar Khan, Neeraj Kumar, Syed Agha Hassnain Mohsan, Wali Ullah Khan · 8 authors
Fifth-generation (5G) cellular networks have led to the implementation of beyond 5G (B5G) networks, which are capable of incorporating autonomous services to swarm of unmanned aerial vehicles (UAVs). They provide capacity expansion strategies to address massive connectivity issues and guarantee ultra-high throughput and low latency, especially in extreme or emergency situations where network density, bandwidth, and traffic patterns fluctuate. On the one hand, 6G technology integrates AI/ML, IoT, and blockchain to establish ultra-reliable, intelligent, secure, and ubiquitous UAV networks. 6G networks, on the other hand, rely on new enabling technologies such as air interface and transmission technologies, as well as a unique network design, posing new challenges for the swarm of UAVs. Keeping these challenges in mind, this article focuses on the security and privacy, intelligence, and energy-efficiency issues faced by swarms of UAVs operating in 6G mobile networks. In this state-of-the-art review, we integrated blockchain and AI/ML with UAV networks utilizing the 6G ecosystem. The key findings are then presented, and potential research challenges are identified. We conclude the review by shedding light on future research in this emerging field of research.
Michael Sammeth, Nicu-Cosmin Ursache, Sînică Alboaie
Introduction: Distributed ledger networks, chiefly those based on blockchain technologies, currently are heralding a next-generation of computer systems that aims to suit modern users’ demands. Over the recent years, several technologies for blockchains, off-chaining strategies, as well as decentralised and respectively self-sovereign identity systems have shot up so fast that standardisation of the protocols is lagging behind, severely hampering the interoperability of different approaches. Moreover, most of the currently available solutions for distributed ledgers focus on either home users or enterprise use case scenarios, failing to provide integrative solutions addressing the needs of both. Methods: Herein, we introduce the OpenDSU platform that allows to interoperate generic blockchain technologies, organised–and possibly cascaded in a hierarchical fashion–in domains. To achieve this flexibility, we seamlessly integrated a set of well conceived components that orchestrate off-chain data and provide granularly resolved and cryptographically secure access levels, intrinsically nested with sovereign identities across the different domains. The source code and extensive documentation of all OpenDSU components described herein are publicly available under the MIT open-source licence at https://opendsu.com . Results: Employing our platform to PharmaLedger, an inter-European network for the standardisation of data handling in the pharmaceutical industry and in healthcare, we demonstrate that OpenDSU can cope with generic demands of heterogeneous use cases in both, performance and handling substantially different business policies. Discussion: Importantly, whereas available solutions commonly require a pre-defined and fixed set of components, no such vendor lock-in restrictions on the blockchain technology or identity system exist in OpenDSU, making systems built on it flexibly adaptable to new standards evolving in the future.
Payment channel is a class of techniques designed to solve the scalability problem of blockchain. By establishing channels off the blockchain to form payment channel networks (PCNs), users can make instant payments without interacting with the blockchain, avoiding the problems of long transaction consensus delays and high transaction fees. Recently, the optimization of PCNs has mainly focused on improving the network throughput via multi-path routing. However, the transaction's atomicity comes at a non-trivial cost for transaction completion latency that affects user experience in deadline-sensitive applications of PCNs. In this paper, we propose a new and systematic framework DPCN to consider the deadlines of transactions for payment channel networks while improving the success ratio of transactions. DPCN is enabled via a synergy of three components: (1) deadline-based dynamic transaction split mechanism that splits the transaction according to current network status and the transaction's deadline; (2) deadline-aware transaction scheduling that prioritizes near-deadline transactions; (3) deadline-aware transaction congestion avoidance algorithm, which uses a path window to balance transactions with different deadlines. Our extensive experiments show that compared with existing methods, DPCN can well meet the needs of transactions with different deadlines and ensure a higher success ratio for transactions in the payment channel networks.
Incentives that compensate for the involved costs in the decentralized training of a Federated Learning (FL) model act as a key stimulus for clients' long-term participation. However, it is challenging to convince clients for quality participation in FL due to the absence of: (i) full information on the client's data quality and properties; (ii) the value of client's data contributions; and (iii) the trusted mechanism for monetary incentive offers. This often leads to poor efficiency in training and communication. While several works focus on strategic incentive designs and client selection to overcome this problem, there is a major knowledge gap in terms of an overall design tailored to the foreseen digital economy, including Web 3.0, while simultaneously meeting the learning objectives. To address this gap, we propose a contribution-based tokenized incentive scheme, namely \texttt{FedToken}, backed by blockchain technology that ensures fair allocation of tokens amongst the clients that corresponds to the valuation of their data during model training. Leveraging the engineered Shapley-based scheme, we first approximate the contribution of local models during model aggregation, then strategically schedule clients lowering the communication rounds for convergence and anchor ways to allocate \emph{affordable} tokens under a constrained monetary budget. Extensive simulations demonstrate the efficacy of our proposed method.
Muhammad Asif Khan, Emna Baccour, Zina Chkirbene, Aiman Erbad · 7 authors
5G communication brings substantial improvements in the quality of service provided to various applications by achieving higher throughput and lower latency. However, interactive multimedia applications (e.g., ultra high definition video conferencing, 3D and multiview video streaming, crowd-sourced video streaming, cloud gaming, virtual and augmented reality) are becoming more ambitious with high volume and low latency video streams putting strict demands on the already congested networks. Mobile Edge Computing (MEC) is an emerging paradigm that extends cloud computing capabilities to the edge of the network i.e., at the base station level. To meet the latency requirements and avoid the end-to-end communication with remote cloud data centers, MEC allows to store and process video content (e.g., caching, transcoding, pre-processing) at the base stations. Both video on demand and live video streaming can utilize MEC to improve existing services and develop novel use cases, such as video analytics, and targeted advertisements. MEC is expected to reshape the future of video streaming by providing ultra-reliable and low latency streaming (e.g., in augmented reality, virtual reality, and autonomous vehicles), pervasive computing (e.g., in real-time video analytics), and blockchain-enabled architecture for secure live streaming. This paper presents a comprehensive survey of recent developments in MEC-enabled video streaming bringing unprecedented improvement to enable novel use cases. A detailed review of the state-of-the-art is presented covering novel caching schemes, optimal computation offloading, cooperative caching and offloading and the use of artificial intelligence (i.e., machine learning, deep learning, and reinforcement learning) in MEC-assisted video streaming services.
While being decentralized, secure, and reliable, Bitcoin and many other blockchain-based cryptocurrencies suffer from scalability issues. One of the promising proposals to address this problem is off-chain payment channels. Since, not all nodes are connected directly to each other, they can use a payment network to route their payments. Each node allocates a balance that is frozen during the channel's lifespan. Spending and receiving transactions will shift the balance to one side of the channel. A channel becomes unbalanced when there is not sufficient balance in one direction. In this case, we say the effective lifespan of the channel has ended. In this paper, we develop a mathematical model to predict the expected effective lifespan of a channel based on the network's topology. We investigate the impact of channel unbalancing on the payment network and individual channels. We also discuss the effect of certain characteristics of payment channels on their lifespan. Our case study on a snapshot of the Lightning Network shows how the effective lifespan is distributed, and how it is correlated with other network characteristics. Our results show that central unbalanced channels have a drastic effect on the network performance.
IOTA Tangle is a distributed ledger technology (DLT), primarily designed for Internet-of-Things (IoT) networks and applications. IOTA Tangle utilizes a direct acyclic graph (DAG) structure for the ledger, with its protocol offering features attractive to the IoT domain, over most blockchain alternatives, such as feeless transactions, higher achievable transactions per second (TPS), and lower energy consumption. The original IOTA implementation relied on a bootstrap centralized coordinator solution for consensus which limited its degree of decentralization and scalability. This concern, alongside other limitations to its adoption, such as lack of smart contracts, are being addressed with the release of IOTA 2.0. This update brings with it significant changes in order to remove the coordinator and achieve a scalable decentralized solution. To this end, this paper provides a technical overview of the key features of IOTA 2.0 while discussing their relevance and benefits for the wider IoT ecosystem. The paper also provides performance insights and future research directions for IOTA 2.0.
Delphinus cross-chain aggregator is a universal firmware which synchronise states between different smart contracts on different block-chains. In the world of block-chains, synchronization challenges are two-folded. Firstly, contracts from different main block-chain can not communicate with each other which makes it hard to establish a trustworthy communication channel for them to share and maintain a universal state between each other. Secondly, transactions on different block-chains can hardly be ordered thus conflicts are common and we need a novel way to avoid and handle these conflicts. Delphinus cross-chain aggregator is a ZKSNARK based multi-block-chain layer on top of which rich cross chain applications can run safely and efficiently.
Video conferencing has become the preferred way of interacting virtually. Current video conferencing applications, like Zoom, Teams or WebEx, are centralized, cloud-based platforms whose performance crucially depends on the proximity of clients to their data centers. Clients from low-income countries are particularly affected as most data centers from major cloud providers are located in economically advanced nations. Centralized conferencing applications also suffer from occasional outages and are embattled by serious privacy violation allegations. In recent years, decentralized video conferencing applications built over p2p networks and incentivized through blockchain are becoming popular. A key characteristic of these networks is their openness: anyone can host a media server on the network and gain reward for providing service. Strong economic incentives combined with lower entry barrier to join the network, makes increasing server coverage to even remote regions of the world. These reasons, however, also lead to a security problem: a server may obfuscate its true location in order to gain an unfair business advantage. In this paper, we consider the problem of multicast tree construction for video conferencing sessions in open p2p conferencing applications. We propose DecVi, a decentralized multicast tree construction protocol that adaptively discovers efficient tree structures based on an exploration-exploitation framework. DecVi is motivated by the combinatorial multi-armed bandit problem and uses a succinct learning model to compute effective actions. Despite operating in a multi-agent setting with each server having only limited knowledge of the global network and without cooperation among servers, experimentally we show DecVi achieves similar quality-of-experience compared to a centralized globally optimal algorithm while achieving higher reliability and flexibility.
Consensus is unnecessary when the truth is available. In this paper, we present a new perspective of rebuilding the blockchain without consensus. When the consensus phase is eliminated from a blockchain, transactions could be canonized quickly using a well-defined universal rule without consuming hashing power. Thus, the transactions per second(TPS) metric of such the consensusless blockchain can be largely boosted. Although consensus blockchain is promising, several technical challenges are also crucial. For example, double-spending attacks and frequent forking events must be prevented, the credit of block's minting must be carefully defined, and etc. To address those technical challenges, we propose several solutions for our consensusless blockchain (CB), including a naive monotonic scoring mechanism to calculate the ranking of each block in the chain, and a two-stage witness mechanism to add new blocks. The proposed CB chain is promising to offer a simplified and equipment-cheap infrastructure for rich real-world decentralized applications.
In a blockchain system, nodes regularly distribute data to other nodes. The ideal perspective taken in the scientific literature is that data is broadcast to all nodes directly, while in practice data is distributed by repeated multicast. Since correctness and security typically have been established for the ideal setting only, it is vital to show that these properties carry over to real-world implementations. This can be done by proving that the ideal and the real behavior are equivalent. In the work described in this paper, we take an important step towards such a proof by proving a simpler variant of the above equivalence statement. The simplification is that we consider only a concrete pair of network topologies, which nevertheless illustrates important phenomena encountered with arbitrary topologies. For describing systems that distribute data, we use a domain-specific language of processes that is embedded in a general-purpose process calculus. This allows us to leverage the rich theory of process calculi in our proof, which is machine-checked using the Isabelle proof assistant.