Network Topology Single-level Diversity Coding System (DCS) An information source is encoded by a number of encoders. There are a number of decoders, each.

Slides:



Advertisements
Similar presentations
The Capacity of Wireless Networks Danss Course, Sunday, 23/11/03.
Advertisements

The Capacity of Wireless Networks
Routing and Congestion Problems in General Networks Presented by Jun Zou CAS 744.
5.4 Basis And Dimension.
5.1 Real Vector Spaces.
Orthogonal Drawing Kees Visser. Overview  Introduction  Orthogonal representation  Flow network  Bend optimal drawing.
Approximation Algorithms Chapter 14: Rounding Applied to Set Cover.
Max Flow Problem Given network N=(V,A), two nodes s,t of V, and capacities on the arcs: uij is the capacity on arc (i,j). Find non-negative flow fij for.
Introduction to Algorithms
Introduction to Markov Random Fields and Graph Cuts Simon Prince
1 EE5900 Advanced Embedded System For Smart Infrastructure Static Scheduling.
Multicut Lower Bounds via Network Coding Anna Blasiak Cornell University.
Onur G. Guleryuz & Ulas C.Kozat DoCoMo USA Labs, San Jose, CA 95110
Chapter 6 Maximum Flow Problems Flows and Cuts Augmenting Path Algorithm.
Online Social Networks and Media. Graph partitioning The general problem – Input: a graph G=(V,E) edge (u,v) denotes similarity between u and v weighted.
Information Theoretical Security and Secure Network Coding NCIS11 Ning Cai May 14, 2011 Xidian University.
5/21/20151 Mobile Ad hoc Networks COE 549 Capacity Regions Tarek Sheltami KFUPM CCSE COE
1 Maximum Flow Networks Suppose G = (V, E) is a directed network. Each edge (i,j) in E has an associated ‘capacity’ u ij. Goal: Determine the maximum amount.
Entropy Rates of a Stochastic Process
1 Network Coding: Theory and Practice Apirath Limmanee Jacobs University.
1 Cooperative Communications in Networks: Random coding for wireless multicast Brooke Shrader and Anthony Ephremides University of Maryland October, 2008.
1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Mobile Ad Hoc Networks Network Coding and Xors in the Air 7th Week.
Network Coding Project presentation Communication Theory 16:332:545 Amith Vikram Atin Kumar Jasvinder Singh Vinoo Ganesan.
Approximation Algorithms
1 Simple Network Codes for Instantaneous Recovery from Edge Failures in Unicast Connections Salim Yaacoub El Rouayheb, Alex Sprintson Costas Georghiades.
Maximum Flows Lecture 4: Jan 19. Network transmission Given a directed graph G A source node s A sink node t Goal: To send as much information from s.
Network Coding and Reliable Communications Group Algebraic Network Coding Approach to Deterministic Wireless Relay Networks MinJi Kim, Muriel Médard.
Page 1 Page 1 Network Coding Theory: Tutorial Presented by Avishek Nag Networks Research Lab UC Davis.
Routing algorithms, all distinct routes, ksp, max-flow, and network flow LPs W. D. Grover TRLabs & University of Alberta © Wayne D. Grover 2002, 2003 E.
Distributed Combinatorial Optimization
Random coding for wireless multicast Brooke Shrader and Anthony Ephremides University of Maryland Joint work with Randy Cogill, University of Virginia.
Linear Equations in Linear Algebra
Low Complexity Algebraic Multicast Network Codes Sidharth “Sid” Jaggi Philip Chou Kamal Jain.
5  Systems of Linear Equations: ✦ An Introduction ✦ Unique Solutions ✦ Underdetermined and Overdetermined Systems  Matrices  Multiplication of Matrices.
INFORMATION THEORY BYK.SWARAJA ASSOCIATE PROFESSOR MREC.
Chap. 1 Systems of Linear Equations
Networking Seminar Network Information Flow R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung. Network Information Flow. IEEE Transactions on Information.
Repairable Fountain Codes Megasthenis Asteris, Alexandros G. Dimakis IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 32, NO. 5, MAY /5/221.
Systems of Linear Equation and Matrices
QoS-Aware In-Network Processing for Mission-Critical Wireless Cyber-Physical Systems Qiao Xiang Advisor: Hongwei Zhang Department of Computer Science Wayne.
Computing and Communicating Functions over Sensor Networks A.Giridhar and P. R. Kumar Presented by Srikanth Hariharan.
Network Coding and Information Security Raymond W. Yeung The Chinese University of Hong Kong Joint work with Ning Cai, Xidian University.
Chapter 8. Section 8. 1 Section Summary Introduction Modeling with Recurrence Relations Fibonacci Numbers The Tower of Hanoi Counting Problems Algorithms.
CS774. Markov Random Field : Theory and Application Lecture 13 Kyomin Jung KAIST Oct
Simplex method (algebraic interpretation)
NETWORK CODING. Routing is concerned with establishing end to end paths between sources and sinks of information. In existing networks each node in a.
Linear Programming Data Structures and Algorithms A.G. Malamos References: Algorithms, 2006, S. Dasgupta, C. H. Papadimitriou, and U. V. Vazirani Introduction.
1 1.3 © 2012 Pearson Education, Inc. Linear Equations in Linear Algebra VECTOR EQUATIONS.
1 C ollege A lgebra Systems and Matrices (Chapter5) 1.
1 Network Coding and its Applications in Communication Networks Alex Sprintson Computer Engineering Group Department of Electrical and Computer Engineering.
C&O 355 Mathematical Programming Fall 2010 Lecture 18 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A A A.
Computing Eigen Information for Small Matrices The eigen equation can be rearranged as follows: Ax = x  Ax = I n x  Ax - I n x = 0  (A - I n )x = 0.
CprE 545 project proposal Long.  Introduction  Random linear code  LT-code  Application  Future work.
Cooperative Recovery of Distributed Storage Systems from Multiple Losses with Network Coding Yuchong Hu, Yinlong Xu, Xiaozhao Wang, Cheng Zhan and Pei.
Communication System A communication system can be represented as in Figure. A message W, drawn from the index set {1, 2,..., M}, results in the signal.
DIGITAL COMMUNICATIONS Linear Block Codes
10. Lecture WS 2006/07Bioinformatics III1 V10: Network Flows V10 follows closely chapter 12.1 in on „Flows and Cuts in Networks and Chapter 12.2 on “Solving.
Word : Let F be a field then the expression of the form a 1, a 2, …, a n where a i  F  i is called a word of length n over the field F. We denote the.
Linear Program Set Cover. Given a universe U of n elements, a collection of subsets of U, S = {S 1,…, S k }, and a cost function c: S → Q +. Find a minimum.
Solving Network Coding Problems with Genetic Algorithmic Methods Anthony Kim Advisers: Muriel Medard and Una-May O’Reilly.
15.082J and 6.855J March 4, 2003 Introduction to Maximum Flows.
The High, the Low and the Ugly Muriel Médard. Collaborators Nadia Fawaz, Andrea Goldsmith, Minji Kim, Ivana Maric 2.
Flow in Network. Graph, oriented graph, network A graph G =(V, E) is specified by a non empty set of nodes V and a set of edges E such that each edge.
Markov Random Fields in Vision
Approximation Algorithms Duality My T. UF.
1 Maximum Flows CONTENTS Introduction to Maximum Flows (Section 6.1) Introduction to Minimum Cuts (Section 6.1) Applications of Maximum Flows (Section.
RS – Reed Solomon Error correcting code. Error-correcting codes are clever ways of representing data so that one can recover the original information.
Flow in Network.
Matrices and Determinants
Maximum Flow Problems in 2005.
Presentation transcript:

Network Topology Single-level Diversity Coding System (DCS) An information source is encoded by a number of encoders. There are a number of decoders, each of which can access a certain subset of the encoders. The Graph Representing the Diversity Coding System Let V be the set of nodes of a point-to-point communication network which can be represented by a directed graph G = (V, E), where E is the set of edges. Information can be sent from node i to node j for all (i, j) є E. For each edge, it is associated with a non-negative real number, R ij, which represents the capacity of the edge (i, j)

To specify the multicast requirement, apart from defining the information rate, we let a: {1, …, m} -> V and b: {1, …, m} -> 2 V be the arbitrary mappings. For the single source problem, let a(1) = s, and b(1) = {t 1, …, t L }. Also, R 15, R 26, R 37, R 48 correspond to r 1, r 2, r 3, and r 4 respectively. F = [F ij, (i, j) ϵ E]: flow in G from s to t l if for all (i, j) ϵ E 0 <= F ij <= R ij F is a max flow from source to sink and in order for a decoder to reconstruct the source successfully, the sum of coding rates of the encoders accessible by this decoder is at least h such that the value of max-flow from the source to the sink is referred to the capacity of the graph i.e., r 1 + r 2 => h r 2 + r 3 => h r 1 + r 2 + r 4 => h r 3 + r 4 => h Since there is no constraint (in ideal) case on the coding rate in these edges, we interpret the capacity of each edge as infinity.

Introduction to Transfer Matrices M 1 = A(I – F) -1 B T, where I is the |E| x |E| identity matrix The determinant of the transfer matrix M 1 = A(I – F) -1 B β T for receiver β in a network code can be calculated as |M 1 | = (-1) r(v + 1) |M 2 | where M 2 corresponds to the Edmonds matrix with appropriately chosen coefficients. The coefficients {a i, j, f i, j, b βi, l ϵ F q } can be collected into r x v matrices A = (a i, j ) and B β = (bβ i, j ) and the v x v matrix F = (f l, j ), whose structure is constrained by the network. For a multicast connection problem to be feasible, (i.e., satisfies the max-flow min-cut theorem) the transfer matrix has non-zero determinant.

Delay-Free Networks (Multicast of Information) Let a delay-free communication network G and a solvable multicast network problem be given with one source and N receivers. Let R be the rate at which the source generates information. There exists a solution to the network coding problem in a finite field F 2^m (q = 2^m) Proof: Each entry in the matrix (I – F) -1 has degree at most one in any variable. Hence the degree of each variable in the determinant of a particular transfer matrix is at most R. It follows that the relevant polynomial has degree at most NR in any variable. However, the upper bound can still be tightened when there exists a solution in a finite field F q where q > N for a feasible multicast connection problem with N receivers. Proof: Since no variable coefficients appear in more than one entry of the Edmonds matrix, no product term in the determinant polynomial contains a variable coefficients raised to an exponent greater than 1. Thus, the largest exponent of any variable in a product of d such determinants is at most d.

How to solve network jamming (1) If network coding is allowed, then 4 bits can be multicast to all the sinks if 2 bits are sent in each edge. If network coding is not allowed, only 3 bits can be multicast to all sinks. Let B = {b 1, …, b k } be the set of bits to be multicast to all the sinks. Let the set of bits sent in the edge (s, i) be B i, where |B i | = 2, i = 1, 2, 3. Since two bits are sent in each edge in the network and network coding is allowed, B 3 ∪ (B 1 ∩ B 2 ) = (B 3 ∪ B 1 ) ∩ (B 3 ∪ B 2 ) = B Therefore, K = | B 3 ∪ (B 1 ∩ B 2 )| <= | B 3 | + |B 1 ∩ B 2 | = | B 3 | + | B 1 | + | B 2 | - |B 1 ∪ B 2 | = 6 – K which indicates that k <= 3. The throughput of the network can be increased by one- third in this case.

How to solve network jamming (2) We can increase the probabilities of success of randomized routing scheme RR and randomized coding scheme RC. Transmission to a particular receiver is successful if the receiver gets two different processes instead of duplicates of the same process. Consider the rectangular grid network: RR Scheme: The source node sends one process in both directions on one axis and the other process in both directions along the other axis A node receiving information on one link sends the same information on its three other links A node receiving signals on two links sends one of the incoming signals on one of its two other links with equal probability, and the other signal on the remaining link. RC Scheme: The first two steps are exactly the same as the RR Scheme except for the last step: A node receiving signals on two links sends a random linear combination of the source signals on each of its two other links.

How to solve network jamming (2) (cont’) Let A and B be the events: receiver located at grid position (x, y) relative to the source receives both source processes & a receiver located at grid position (x, y) relative to the source can decode both processes respectively. For Random Routing Scheme RR: For Random Coding Scheme RC: Without using these two schemes, the prob. of successes are usually lower. That means more retransmission may be required. Moreover, in the RC scheme, the increase in field size will increase the prob. of successes.