Results 261 to 270 of about 53,924 (297)
Some of the next articles are maybe not open access.
A secure algorithm for Random Linear Network Coding
2020 IEEE 5th International Symposium on Smart and Wireless Systems within the Conferences on Intelligent Data Acquisition and Advanced Computing Systems (IDAACS-SWS), 2020Random Linear Network Coding has been first introduced as a tool to maximize information flow across a network. This paradigm has been later proven to possess inherent weak security that arises from packet mixing. Motivated by this observation, an algorithm for secure data transmission using Random Linear Network Coding is proposed in this paper.
Mohamed Amine Brahimi, Fatiha Merazka
openaire +1 more source
Video Delivery Based on Random Linear Network Coding
2020 International Conference on Advanced Science and Engineering (ICOASE), 2020The rapid growth of video transmission and the increasing demand for high-definition, multi-display, and the wide-area video services in recent years. It resulted in the need for robust technologies to cover these requirements. RLNC is one of the most promising methods for video delivery, improving throughput, utilizing bandwidth capacity, and saving ...
Amenah Muwafaq Younus +1 more
openaire +1 more source
Lightweight Encryption for Random Linear Network Coding
2016Researchers have shown that network coding can help reduce the energy consumption of communication by reducing transmissions.
Peng Zhang, Chuang Lin
openaire +1 more source
Secure random linear network coding on a wiretap network
AEU - International Journal of Electronics and Communications, 2015We develop a secure random linear network coding scheme on wiretap networks where a wiretapper can only eavesdrop on a limited number of channels.
Zhanghua Cao +3 more
openaire +1 more source
Subspace Authentication for Random Linear Network Coding
2016As is introduced in Chap. 2, network coding is notoriously susceptible to pollution attacks: a single polluted packet can end up corrupting bunches of good ones.
Peng Zhang, Chuang Lin
openaire +1 more source
Hierarchical Performance Analysis on Random Linear Network Coding
IEEE Transactions on Communications, 2018Random linear network coding (RLNC) is a promising network coding solution when the network topology information is not fully available to all the nodes. However, in practice, nodes have partial knowledge of the network topology information. Motivated by this, we investigate the performance of RLNC and obtain different upper bounds on the failure ...
Dan Li +4 more
openaire +1 more source
Massive parallelization technique for random linear network coding
2014 International Conference on Big Data and Smart Computing (BIGCOMP), 2014Random linear network coding (RLNC) has gain popularity as a useful performance-enhancing tool for communications networks. In this paper, we propose a RLNC parallel implementation technique for General Purpose Graphical Processing Units (GPGPUs.) Recently, GPGPU technology has paved the way for parallelizing RLNC; however, current state-of-the-art ...
null Seong-Min Choi, Joon-Sang Park
openaire +1 more source
Random linear intersession network coding with selective cancelling
2009 IEEE Information Theory Workshop, 2009The network coding capacity of a single multicast traffic is characterized by the min-cut/max-flow (mcMF) theorem, which can be achieved by random linear network coding (RLNC). Nonetheless, the graph-theoretic characterization for multiple unicast/multicast traffic remains an open problem.
Chih-Chun Wang, Ness B. Shroff
openaire +1 more source
Minimum-Energy Multicast Using Random Linear Network Coding
2011 Seventh International Conference on Mobile Ad-hoc and Sensor Networks, 2011Conventional routing ways of wireless multicast advantage application in reduce energy consumption is generally used to establish a "minimum-energy multicast tree" to achieve the minimum energy multicast. However, the problem of constructing a minimum-energy multicast tree in a wireless ad hoc network is NP-hard.
Ying Cai, Lina Zhang
openaire +1 more source
Training overhead for decoding random linear network codes
MILCOM 2008 - 2008 IEEE Military Communications Conference, 2008We consider multicast communications from a single source to multiple destinations over a network of erasure channels. Linear network coding maximizes the achievable (min-cut) rate, and a distributed code assignment can be realized by choosing codes randomly at the intermediate nodes.
Maximilian Riemensberger +3 more
openaire +1 more source