scholarly journals Regulating Storage Overhead in Existing PoW-based Blockchains

2021 ◽  
Author(s):  
Frederik Armknecht ◽  
Jens-Matthias Bohli ◽  
Ghassan O. Karame ◽  
Wenting Li
Keyword(s):  
Storage Overhead

Implementation of Fuzzy Based Simulation for Clone Detection in Wireless Sensor Networks

2016 ◽  
Vol 6 (4) ◽  
pp. 1570
Author(s):  
Manjunatha R C ◽  
Rekha K R ◽  
Nataraj K R
Keyword(s):  
Wireless Sensor Networks ◽  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Sensor Network ◽  
Wireless Sensor ◽  
Clone Detection ◽  
Storage Overhead ◽  
And Performance ◽  
And Storage ◽  
Compromised Nodes

<p>Wireless sensor networks are usually left unattended and serve hostile environment, therefore can easily be compromised. With compromised nodes an attacker can conduct several inside and outside attacks. Node replication attack is one of them which can cause severe damage to wireless sensor network if left undetected. This paper presents fuzzy based simulation framework for detection and revocation of compromised nodes in wireless sensor network. Our proposed scheme uses PDR statistics and neighbor reports to determine the probability of a cluster being compromised. Nodes in compromised cluster are then revoked and software attestation is performed.Simulation is carried out on MATLAB 2010a and performance of proposed scheme is compared with conventional algorithms on the basis of communication and storage overhead. Simulation results show that proposed scheme require less communication and storage overhead than conventional algorithms.</p>

Implementation of Fuzzy Based Simulation for Clone Detection in Wireless Sensor Networks

2016 ◽  
Vol 6 (4) ◽  
pp. 1570
Author(s):  
Manjunatha R C ◽  
Rekha K R ◽  
Nataraj K R
Keyword(s):  
Wireless Sensor Networks ◽  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Sensor Network ◽  
Wireless Sensor ◽  
Clone Detection ◽  
Storage Overhead ◽  
And Performance ◽  
And Storage ◽  
Compromised Nodes

<p>Wireless sensor networks are usually left unattended and serve hostile environment, therefore can easily be compromised. With compromised nodes an attacker can conduct several inside and outside attacks. Node replication attack is one of them which can cause severe damage to wireless sensor network if left undetected. This paper presents fuzzy based simulation framework for detection and revocation of compromised nodes in wireless sensor network. Our proposed scheme uses PDR statistics and neighbor reports to determine the probability of a cluster being compromised. Nodes in compromised cluster are then revoked and software attestation is performed.Simulation is carried out on MATLAB 2010a and performance of proposed scheme is compared with conventional algorithms on the basis of communication and storage overhead. Simulation results show that proposed scheme require less communication and storage overhead than conventional algorithms.</p>

Improving Data Availability for Deduplication in Cloud Storage

2018 ◽  
Vol 10 (2) ◽  
pp. 70-89 ◽  
Author(s):  
Jun Li ◽  
Mengshu Hou
Keyword(s):  
Conventional Method ◽  
Cloud Storage ◽  
Storage System ◽  
Data Availability ◽  
Redundant Information ◽  
Storage Requirement ◽  
Improved Method ◽  
Data Deduplication ◽  
Access Frequency ◽  
Storage Overhead

This article describes how in order to reduce the amount of data, deduplication technology is introduced in the cloud storage. Adopting this technology, the duplicated data can be eliminated, users can conserve the storage requirement. However, deduplication technology also increases the data unavailability. To solve this problem, the authors propose a method to improve data availability in the deduplication storage system. It is based on the data chunk reference count and access frequency, and increases redundant information for the data chunks, to ensure data availability and minimize storage overhead. Extensive experiments are conducted to evaluate effectiveness of the improved method. WFD, CDC, and sliding block deduplication technology are used for comparison. The experimental results show that the proposed method can achieve higher data availability than the conventional method and increase little storage overhead.

scholarly journals Optimal Representation of Large-Scale Graph Data Based on Grid Clustering and K2-Tree

2020 ◽  
Vol 2020 ◽  
pp. 1-8
Author(s):  
Fengying Li ◽  
Enyi Yang ◽  
Anqiao Ma ◽  
Rongsheng Dong
Keyword(s):  
Adjacency Matrix ◽  
Large Scale ◽  
Compact Representation ◽  
Graph Data ◽  
Storage Overhead ◽  
Time Space ◽  
Query Algorithm ◽  
Representation Scheme ◽  
The Given ◽  
Density Threshold

The application of appropriate graph data compression technology to store and manipulate graph data with tens of thousands of nodes and edges is a prerequisite for analyzing large-scale graph data. The traditional K2-tree representation scheme mechanically partitions the adjacency matrix, which causes the dense interval to be split, resulting in additional storage overhead. As the size of the graph data increases, the query time of K2-tree continues to increase. In view of the above problems, we propose a compact representation scheme for graph data based on grid clustering and K2-tree. Firstly, we divide the adjacency matrix into several grids of the same size. Then, we continuously filter and merge these grids until grid density satisfies the given density threshold. Finally, for each large grid that meets the density, K2-tree compact representation is performed. On this basis, we further give the relevant node neighbor query algorithm. The experimental results show that compared with the current best K2-BDC algorithm, our scheme can achieve better time/space tradeoff.

scholarly journals Conditional Ciphertext-Policy Attribute-Based Encryption Scheme in Vehicular Cloud Computing

2016 ◽  
Vol 2016 ◽  
pp. 1-10 ◽  
Author(s):  
Zhitao Guan ◽  
Jing Li ◽  
Zijian Zhang ◽  
Liehuang Zhu
Keyword(s):  
Cloud Computing ◽  
Traffic Management ◽  
Lower Amount ◽  
Vehicular Cloud Computing ◽  
Vehicular Cloud ◽  
Related Data ◽  
Storage Overhead ◽  
Attribute Based Encryption ◽  
Data Owner ◽  
Ciphertext Policy

VCC (Vehicular Cloud Computing) is an emerging and promising paradigm, due to its significance in traffic management and road safety. However, it is difficult to maintain both data security and system efficiency in Vehicular Cloud, because the traffic and vehicular related data is large and complicated. In this paper, we propose a conditional ciphertext-policy attribute-based encryption (C-CP-ABE) scheme to solve this problem. Comparing with CP-ABE, this scheme enables data owner to add extra access trees and the corresponding conditions. Experimental analysis shows that our system brings a trivial amount of storage overhead and a lower amount of computation compared with CP-ABE.

Inscribing in to an Control Attempt against Jammer Attack Using FB Decoding Mechanism

2014 ◽  
Vol 573 ◽  
pp. 412-417
Author(s):  
G. Sona ◽  
P. Annapandi ◽  
Boopathy Yamni
Keyword(s):  
Spread Spectrum ◽  
Cost Effective ◽  
Original Data ◽  
Overhead Cost ◽  
Storage Overhead ◽  
Node Spreading ◽  
Time Required ◽  
Key Scheduling ◽  
Secured Communication ◽  
Better Than

Previously Spread Spectrum (SS) communication involve by setting up preconfigured keys among the communicating nodes that are constrained to possess synchronous behaviour. This extends to several issues creating circular dependency problem, offering less energy efficiency and thereby leading to insecure short-lived communication. In this paper, an opponent resilient secret sharing concept is introduced without any establishment of pre-shared keys by FB (Forward Backward) decoding. It illustrates using time reversed message extraction and key scheduling at receiver side that enables secured transmission over wireless communication even when the receiver node remains inactive and attaining jammer not to obtain the original data sent by the sender node. Spreading the data involves use of DSSS as it would be more compatible in adjusting to multiple bandwidths. Main goal is to transmit the message in such a way that the time required to deliver the secret must be less than the time for the opponent to find key during transmission. Further, it come up with minimal storage overhead, cost effective and sustains long-lived secured communication among the interacting nodes. Evaluation of various parameters is performed using NS-2 toolkit to prove that this newer approach is better than earlier work.

Sign in / Sign up

Export Citation Format

Share Document