Deterministic Network Model Revisited: An Algebraic Network Coding Approach

Abstract—The capacity of multiuser networks has been a longstanding problem in information theory. Recently, Avestimehr et al. have proposed a deterministic network model to approximate multiuser wireless networks. This model, known as the ADT network model, takes into account the broadcast nature of wireless medium and interference. We show that the ADT network model can be described within the algebraic network coding framework introduced by Koetter and M´edard. We prove that the ADT network problem can be captured by a single matrix, and show that the min-cut of an ADT network is the rank of this matrix; thus, eliminating the need to optimize over exponential number of cuts between two nodes to compute the min-cut of an ADT network. We extend the capacity characterization for ADT networks to a more general set of connections, including single unicast/multicast connection and non-multicast connections such as multiple multicast, disjoint multicast, and two-level multicast. We also...

• Type: Journal
• Year: 2011
• Where: CORR
• Authors: MinJi Kim, Elona Erez, Edmund M. Yeh, Muriel Médard
• Keywords: ADT Network Model, Adt Networks, CORR 2011, Education, Network Model