1,720,964 research outputs found
Reputation-Based Data Carrying for Web3 Networks
No full textWeb3 networks are emerging to replace centrally-governed networking infrastructure. The integrity of the shared public infrastructure of Web3 networks is guaranteed through data sharing between nodes. However, due to the unstructured and highly partitioned nature of Web3 networks, data sharing between nodes in different partitions is a challenging task. In this paper we present the TSRP mechanism, which approaches the data sharing problem through nodes auditing each other to enforce carrying of data between partitions. Reputation is used as an analogue for the likelihood of nodes interacting with nodes from other partitions in the future. The number of copies of data shared with other nodes is inversely related to the nodes’ reputation. We use a real-world trace of Twitter to show how our implementation can converge to an equal number of copies as structured approachesGreen Open Access added to TU Delft Institutional Repository 'You share, we take care!' - Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.Data-Intensive System
Distributed Attestation Revocation in Self-Sovereign Identity
No full textSelf-Sovereign Identity (SSI) aspires to create a standardised identity layer for the Internet by placing citizens at the centre of their data, thereby weakening the grip of big tech on current digital identities. However, as millions of both physical and digital identities are lost annually, it is also necessary for SSIs to possibly be revoked to prevent misuse. Previous attempts at designing a revocation mechanism typically violate the principles of SSI by relying on central trusted components. This lack of a distributed revocation mechanism hampers the development of SSI. In this paper, we address this limitation and present the first fully distributed SSI revocation mechanism that does not rely on specialised trusted nodes. Our novel gossip-based propagation algorithm disseminates revocations throughout the network and provides nodes with a proof of revocation that enables offline verification of revocations. We demonstrate through simulations that our protocol adequately scales to national levels.Green Open Access added to TU Delft Institutional Repository 'You share, we take care!' - Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.Data-Intensive System
A Vehicle Message Scheduling Scheme For Vehicle Trust Management
Get PDFThe trustworthiness of vehicle messages is a major focus in intelligent transportation research. Existing studies focus on enhancing the accuracy of vehicle trustworthiness evaluation, overlooking that the transmission performance may affect the quality of vehicle messages, which are essential for implementing trustworthiness evaluation. This paper studies a novel vehicle message scheduling scheme to regulate vehicles’ transmissions so that incident messages for any part of the road can be reliably and accurately sent to a roadside unit. Through strategically scheduling vehicle transmissions to avoid interference between vehicles while guaranteeing sufficient numbers of vehicles transmitting their sensor data, vehicle messages can reliably yet timely arrive at Road Side Units (RSUs) without missing reporting an event on the road
Opportunistic routing algorithms in delay tolerant networks
No full textMay 2011School of ScienceSocial Cognitive Networks Academic Research CenterPh
An Efficient Metric for Physical-layer Jammer Detection in Internet of Things Networks
Get PDFAn active jammer could severely degrade the communication quality for wireless networks. Since all wireless nodes openly access the shared media, the harsh effects are exaggerated by retransmission attempts of affected devices. Fast and precise detection of the jammer is of vital importance for heterogeneous wireless environments such as the Internet of things (IoT). It could activate a series of corrective countermeasures to ensure the robust operation of the network. In this paper, we propose a local, straightforward, and numerical metric called the number of jammed slots (NJS), by which we can quickly detect the presence of a jammer and identify the jammed nodes at the software level in broadcast networks. NJS calculation is carried out by a central node which collects the MAC-layer statuses of all wireless nodes in a periodical fashion. Our simulation results indicate that NJS outperforms current detection methods in terms of accuracy and precision
Optimizing Virtual Network Function Splitting in Open-RAN Environments
No full textOpen radio access network (Open-RAN) is becoming a key component of cellular networks, and therefore optimizing its architecture is vital. The Open-RAN is a distributed architecture that lets the virtualized networking functions be split between Distributed Units (DU) and Centralized Units (CUs); as a result, there is a wide range of design options. We propose an optimization problem to choose the split points. The objective is to balance the load across CUs as well as midhaul links by considering delay requirements. The resulting formulation is an NP-hard problem that is solved with a novel heuristic algorithm. Performance evaluation shows that the gap between optimal and heuristic solutions does not exceed 2%. An in-depth analysis of different centralization levels shows that using multi-CUs could reduce the total bandwidth usage by up to 20%. Moreover, multipath routing can improve the result of load balancing between midhaul links while increasing bandwidth usage
Connectivity and coverage preserving sleep scheduling mechanism with predictive coverage and multiple mode selections in wireless sensor networks
No full textCataloged from PDF version of article.Includes bibliographical references leaves 69-72Bulut, Eyupha
Protecting Software-Defined Enterprise Networks from Packet Injection Attacks
No full textPacket injection attacks are a primary threat to software-defined enterprise networks, for which continuous connectivity and real-time network functioning are two essential requirements. They are a form of denial-of-service attacks, and their main effect is network performance degradation up to total breakdown. In this paper, we show how such an attack can effectively be detected and mitigated at the entrance gateway switch of the software-defined enterprise network without sacrificing the basic functionality and performance of the networks control mechanisms. We describe an effective protection of the network's core controller as well as a significant reduction of rule-space overhead compared to a state-of-the-art technique.</p
Going Beyond Counting First Authors in Author Co-citation Analysis
Get PDFThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
- …
