network coding-based storage has recently received a lot of attention in the network coding community. Independently, another body of work has proposed integrity checking schemes for cloud storage, none of which, howe...
详细信息
In this article, we evaluate network coding algorithm COPE using different topologies, traffic intensities and distributions in order to search for guidelines for network deployments and for better exploring the advan...
详细信息
In this paper, the recent research on secure transmission of network coding in wireless networks is reviewed. Security risks have become a major problem to the development of wireless networks, and network coding is t...
详细信息
Predictive coding (PC) networks are a biologically interesting class of neural networks. Their layered hierarchy mimics the reciprocal connectivity pattern observed in the mammalian cortex, and they can be trained usi...
详细信息
Because of a vehicle's high mobility and obstacle influences, the problem of network segmentation becomes more serious, and routing problems in vehicle networks become more complicated. This causes an increase of ...
详细信息
Wireless sensor network has caused a lot of interest in many applications especially in real-time multimedia data transfer over wireless network which is known as wireless multimedia sensor network (WMSN). Even though...
详细信息
Clustered distributed storage models real data centers where intra-and cross-cluster repair bandwidths are different. In this paper, exact-repair minimum-storage-regenerating (MSR) codes achieving capacity of clustere...
详细信息
ISBN:
(纸本)9781538647813
Clustered distributed storage models real data centers where intra-and cross-cluster repair bandwidths are different. In this paper, exact-repair minimum-storage-regenerating (MSR) codes achieving capacity of clustered distributed storage are designed. Focus is given on two cases: epsilon = 0 and epsilon = 1/(n-k), where epsilon is the ratio of the available cross-and intra-cluster repair bandwidths, n is the total number of distributed nodes and k is the number of contact nodes in data retrieval. The former represents the scenario where cross-cluster communication is not allowed, while the latter corresponds to the case of minimum cross-cluster bandwidth allowing minimum storage overhead. For the epsilon = 0 case, two types of locally repairable codes are proven to achieve the MSR point. As for epsilon = 1/(n - k), MDS codes achieve the MSR points for n = Lk, where L is the number of clusters.
In this paper, an opportunistic network-coded cooperative scheme is proposed for the combination of network coding method and cooperative communication in wireless uplink multi-relay networks. Previous network-coded c...
详细信息
A practical wireless network solution for providing community broadband Internet access services are considered to be wireless mesh networks with delay-throughput tradeoff. This important aspect of network design lies...
详细信息
The availab ility of network system with network coding can suffer from malicious nodes intentionally corrupt the encoded packets. T he sit uat ion will get even worse when t here are self ish nodes that are unwilling...
详细信息
暂无评论