Network Coding Theory: A Survey

Bassoli, Riccardo; Marques, Hugo; Rodriguez, Jonathan; Shum, Kenneth W.; Tafazolli, Rahim

doi:10.1109/surv.2013.013013.00104

Cited by 125 publications

(79 citation statements)

References 224 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In communications networks, the capacity region of multi-source network coding can be expressed in terms of the entropy region, the reader is referred to the thorough review of the network coding in [2]. Non-Shannon inequalities have a direct impact on converse theorems for multi-terminal problems of information theory, see [42].…”

Section: Introductionmentioning

confidence: 99%

Entropy Region and Convolution

Matúš

Csirmaz

2016

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

Abstract. The entropy region is constructed from vectors of random variables by collecting Shannon entropies of all subvectors. Its shape is studied here by means of polymatroidal constructions, notably by convolution. The closure of the region is decomposed into the direct sum of tight and modular parts, reducing the study to the tight part. The relative interior of the reduction belongs to the entropy region. Behavior of the decomposition under selfadhesivity is clarified. Results are specialized to and completed for the region of four random variables. This and computer experiments help to visualize approximations of a symmetrized part of the entropy region. Four-atom conjecture on the minimization of Ingleton score is refuted.

show abstract

Section: Introductionmentioning

confidence: 99%

Entropy Region and Convolution

Matúš

Csirmaz

2016

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

show abstract

“…Network coding (NC) is a promising technology to be used in the next-generation network because it can maximize the throughput capacity of a network [3,4]. By using NC, nodes in the network can encode and decode the received data packets instead of only store and forward.…”

Section: Introductionmentioning

confidence: 99%

Secure Data Delivery with Linear Network Coding for Multiple Multicasts with Multiple Streams in Internet of Things

Shi

Wang

Peng

2018

Security and Communication Networks

View full text Add to dashboard Cite

With the rapid developments of Internet of Things (IoT), tremendous number of sensors are deployed in the environment to monitor and collect different types of information. When a group of sensors located with the same location (or area) should deliver their data to a set of users and they have connected with the same network device, e.g., base station or access point, the data delivery between them and their users can be treated as a single source multicast in the core network from the network device connected with them to the network devices connected with their users. Generally, in such a case, multiple multicast sessions exist in the network simultaneously. In this paper, we study two major considerations, i.e., transmission throughput and information security, for multiple multicasts with multiple streams in IoT by using linear network coding (LNC). Specifically, we jointly consider the transmission rate allocation, transmission topology selection, and secure LNC design for multiple multicasts to maximize the total secure weighted throughput (SWT), which is referred to as the secure delivery for multiple multicasts with multiple streams (SMMS) problem. To this end, we firstly consider the SMMS problem in the case that each sensor is connected with a fixed network device. We then study the SMMS problem when the source of each multicast can be selected from a set of nodes. For the first case, we formulate it to be a linear programming (LP), based on which we give the MORT algorithm to optimally solve it. On the other hand, for the second case, we first formulate it to be an integer linear programming (ILP) and then propose an efficient MBLP algorithm based on linear programming relaxation to obtain a suboptimal solution. Finally, we conduct extensive simulations to show the effectiveness and efficiency of the proposed algorithms.

show abstract

“…It allows intermediate nodes within a network to perform mathematical operations to recombine different packets if necessary. Network coding is featured with a number of outstanding advantages, such as natural load balancing, robustness against network failures, stable resistance to attacks, energy saving in multi-hop wireless networks, and so on [1]. Multicast is a technology for point to multi-point data transmission, where the source expects to deliver identical data to a set of receivers [2].…”

Section: Introductionmentioning

confidence: 99%

“…Network coding, when applied to multicast, can always enable the achievement of theoretically maximized throughput [3]. Therefore, network coding based multicast (NCM) has become a hot topic from both academia and industry [1].…”

Section: Introductionmentioning

confidence: 99%

A quantum inspired evolutionary algorithm for dynamic multicast routing with network coding

Xing

et al. 2016

2016 16th International Symposium on Communications and Information Technologies (ISCIT)

View full text Add to dashboard Cite

A note on versions:The version presented here may differ from the published version or from the version of record. If you wish to cite this item you are advised to consult the publisher's version. Please see the repository url above for details on accessing the published version and note that access may require a subscription. Abstract-this paper studies and models the multicast routing problem with network coding in dynamic network environment, where computational and bandwidth resources are to be jointly optimized. A quantum inspired evolutionary algorithm (QEA) is developed to address the problem above, where a restart scheme is devised for well adapting QEA for tracing the ever-changing optima in dynamic environment. Experimental results show that the proposed QEA outperforms a number of existing evolutionary algorithms in terms of the best solution obtained.

show abstract

Network Coding Theory: A Survey

Cited by 125 publications

References 224 publications

Entropy Region and Convolution

Entropy Region and Convolution

Secure Data Delivery with Linear Network Coding for Multiple Multicasts with Multiple Streams in Internet of Things

A quantum inspired evolutionary algorithm for dynamic multicast routing with network coding

Contact Info

Product

Resources

About