Network coding has gained wide attention nowadays for its significant advantages on many aspects compared with traditional routing mechanism. However, if there are malicious nodes launching pollution attacks by tampering or forging data packets in the communication network, the sink nodes will suffer from failure decoding, together with serious results such as bandwidth wasting, longer transmis...

The problem of network function computation over a directed acyclic network is investigated in this paper. In such a network, a sink node desires to compute with zero error a target function, of which the inputs are generated at multiple source nodes. The edges in the network are assumed to be error-free and have limited capacity. The nodes in the network are assumed to have unbounded computing...

In this paper, we explore the use of network coding as method for redistributing resources to achieve capacity in twouser unicast networks. We introduce a simple network example, which we call the extended butterfly network, whose structure illustrates the idea of resource swapping, and demonstrates possible issues related to user incentives for network coding. We show that for such a network, ...

The focus of user behavior in the Internet has changed over the recent years towards being driven by exchanging and accessing information. Many advances in networking technologies have utilized this change by focusing on the content of an exchange rather than the endpoints exchanging the content. Network coding and informationcentric networking are two examples of these technology trends, each ...

In this paper, we investigate random linear network coding (RLNC) in practical wireless networks. First we apply RLNC in the legacy network (wireless LAN mesh network) of multiple unicasts by the global RLNC. In the simulation results, in the system with the global RLNC, the network load and the power consumption is reduced for the simple topologies. However, the global RLNC cannot be applied t...

The capacity benefit of network coding has been extensively studied in wired and wireless networks. Moreover, it has been shown that network coding improves network reliability by reducing the number of packet retransmissions in lossy networks. However, the extent of the reliability benefit of network coding is not known. In this work, we characterize the reliability benefit of network coding f...

In Part I, we studied linear network coding over finite commutative rings and made comparisons to the wellstudied case of linear network coding over finite fields. Here, we consider the more general setting of linear network coding over finite (possibly non-commutative) rings and modules. We prove the following results regarding the linear solvability of directed acyclic networks over various f...

A combinatorial framework for adversarial network coding is presented. Channels are described by specifying the possible actions that one or more (possibly coordinated) adversaries may take. Upper bounds on three notions of capacity—the one-shot capacity, the zero-error capacity, and the compound zero-error capacity—are obtained for point-to-point channels, and generalized to corresponding capa...

A sum-network is a directed acyclic network whereeach source independently generates one symbol from a givenfield F and each terminal wants to receive the sum (over F)of the source symbols. For sum-networks with two sources ortwo terminals, the solvability is characterized by the connectioncondition of each source-terminal pair [3]. A necessary andsufficient condition fo...

Device-to-device (D2D) communication has been shown to increase the spectrum and energy efficiency of local communication sessions in cellular networks. On the other hand, physical layer network coding (NWC) at a cellular base station — which can be employed without D2D functionality — can also improve the efficiency of a cellular network that carries local traffic. In this paper we study the j...