Results 1  10
of
85
Information exchange in wireless networks with network coding and physicallayer broadcast,”
 in Proceedings of the 39th Annual Conference on information Sciences and Systems (CISS ’05),
, 2005
"... AbstractWe show that mutual exchange of independent information between two nodes in a wireless network can be efficiently performed by exploiting network coding and the physicallayer broadcast property offered by the wireless medium. The proposed approach improves upon conventional solutions that ..."
Abstract

Cited by 196 (5 self)
 Add to MetaCart
(Show Context)
AbstractWe show that mutual exchange of independent information between two nodes in a wireless network can be efficiently performed by exploiting network coding and the physicallayer broadcast property offered by the wireless medium. The proposed approach improves upon conventional solutions that separate the processing of the two unicast sessions, corresponding to information transfer along one direction and the opposite direction. We propose a distributed scheme that obviates the need for synchronization and is robust to random packet loss and delay, and so on. The scheme is simple and incurs minor overhead. I. INTRODUCTION In this paper, we investigate the mutual exchange of independent information between two nodes in a wireless network. Let us name the two nodes in consideration a and b, respectively. Consider a packetbased communication network with all packets of equal size. The basic problem is very simple: a wants to transmit a sequence of packets {X 1 (n)} to b and b wants to transmit a sequence of packets {X 2 (n)} to a. Assume the two sequences of information packets, {X 1 (n)} and {X 2 (n)}, are from two independent information sources. Information exchange finds many useful applications. These include voice conversations, video conferencing between two participants, and instant messaging. In fact, the scope of information exchange goes much further beyond the generic twoway endtoend communications listed above. Note that a and b do not have to be the true communication endpoints for the packets {X 1 (n)} and {X 2 (n)}. For example, in a wireless ad hoc network where every node can act as a router, information exchange occurs as long as there are some packets {X 1 (n)} to be routed through a to b and some other packets {X 2 (n)} to be routed through b to a. This is illustrated in An information exchange session between a and b is essentially two unicast sessions, one from a to b and the other from b to a. Since the two unicast sessions carry independent information, it may appear that the two sessions can be treated separately, by devoting a first route for packets {X 1 (n)} to flow from a to b and a second route for packets {X 2 (n)} to flow from b to a. In this paper, we show that a joint
Resilient Network Coding in the Presence of Byzantine Adversaries
"... Network coding substantially increases network throughput. But since it involves mixing of information inside the network, a single corrupted packet generated by a malicious node can end up contaminating all the information reaching a destination, preventing decoding. This paper introduces distribu ..."
Abstract

Cited by 169 (32 self)
 Add to MetaCart
(Show Context)
Network coding substantially increases network throughput. But since it involves mixing of information inside the network, a single corrupted packet generated by a malicious node can end up contaminating all the information reaching a destination, preventing decoding. This paper introduces distributed polynomialtime rateoptimal network codes that work in the presence of Byzantine nodes. We present algorithms that target adversaries with different attacking capabilities. When the adversary can eavesdrop on all links and jam zO links, our first algorithm achieves a rate of C − 2zO, where C is the network capacity. In contrast, when the adversary has limited eavesdropping capabilities, we provide algorithms that achieve the higher rate of C − zO. Our algorithms attain the optimal rate given the strength of the adversary. They are informationtheoretically secure. They operate in a distributed manner, assume no knowledge of the topology, and can be designed and implemented in polynomialtime. Furthermore, only the source and destination need to be modified; nonmalicious nodes inside the network are oblivious to the presence of adversaries and implement a classical distributed network code. Finally, our algorithms work over wired and wireless networks.
MinimumCost Multicast over Coded Packet Networks
 IEEE TRANS. ON INF. THE
, 2006
"... We consider the problem of establishing minimumcost multicast connections over coded packet networks, i.e., packet networks where the contents of outgoing packets are arbitrary, causal functions of the contents of received packets. We consider both wireline and wireless packet networks as well as b ..."
Abstract

Cited by 164 (28 self)
 Add to MetaCart
(Show Context)
We consider the problem of establishing minimumcost multicast connections over coded packet networks, i.e., packet networks where the contents of outgoing packets are arbitrary, causal functions of the contents of received packets. We consider both wireline and wireless packet networks as well as both static multicast (where membership of the multicast group remains constant for the duration of the connection) and dynamic multicast (where membership of the multicast group changes in time, with nodes joining and leaving the group). For static multicast, we reduce the problem to a polynomialtime solvable optimization problem, ... and we present decentralized algorithms for solving it. These algorithms, when coupled with existing decentralized schemes for constructing network codes, yield a fully decentralized approach for achieving minimumcost multicast. By contrast, establishing minimumcost static multicast connections over routed packet networks is a very difficult problem even using centralized computation, except in the special cases of unicast and broadcast connections. For dynamic multicast, we reduce the problem to a dynamic programming problem and apply the theory of dynamic programming to suggest how it may be solved.
Capacity of Wireless Erasure Networks
 IEEE TRANSACTIONS ON INFORMATION THEORY
, 2006
"... In this paper, a special class of wireless networks, called wireless erasure networks, is considered. In these networks, each node is connected to a set of nodes by possibly correlated erasure channels. The network model incorporates the broadcast nature of the wireless environment by requiring eac ..."
Abstract

Cited by 149 (12 self)
 Add to MetaCart
In this paper, a special class of wireless networks, called wireless erasure networks, is considered. In these networks, each node is connected to a set of nodes by possibly correlated erasure channels. The network model incorporates the broadcast nature of the wireless environment by requiring each node to send the same signal on all outgoing channels. However, we assume there is no interference in reception. Such models are therefore appropriate for wireless networks where all information transmission is packetized and where some mechanism for interference avoidance is already built in. This paper looks at multicast problems over these networks. The capacity under the assumption that erasure locations on all the links of the network are provided to the destinations is obtained. It turns out that the capacity region has a nice maxflow mincut interpretation. The definition of cutcapacity in these networks incorporates the broadcast property of the wireless medium. It is further shown that linear coding at nodes in the network suffices to achieve the capacity region. Finally, the performance of different coding schemes in these networks when no side information is available to the destinations is analyzed.
Minimumenergy multicast in mobile ad hoc networks using network coding,” submitted to
 Proc. IEEE Information Theory Workshop,
, 2004
"... ..."
(Show Context)
Network Coding: The Case of Multiple Unicast Sessions
 in Proceedings of the 42nd Allerton Annual Conference on Communication, Control, and Computing
, 2004
"... In this paper, we investigate the benefit of network coding over routing for multiple independent unicast transmissions. We compare the maximum achievable throughput with network coding and that with routing only. We show that the result depends crucially on the network model. In directed network ..."
Abstract

Cited by 88 (7 self)
 Add to MetaCart
(Show Context)
In this paper, we investigate the benefit of network coding over routing for multiple independent unicast transmissions. We compare the maximum achievable throughput with network coding and that with routing only. We show that the result depends crucially on the network model. In directed networks, or in undirected networks with integral routing requirement, network coding may outperform routing. In undirected networks with fractional routing, we show that the potential for network coding to increase achievable throughput is equivalent to the potential of network coding to increase bandwidth e#ciency, both of which we conjecture to be nonexistent.
Network coding for multiple unicasts: An approach based on linear optimization
 IEEE INT. SYMP. INF. THEORY
, 2006
"... In this paper we consider the application of network coding to a multiple unicast setup. We present two suboptimal, yet practical code construction techniques. One consists of a linear program and the other of an integer program with fewer variables and constraints. We discuss the performance of th ..."
Abstract

Cited by 69 (8 self)
 Add to MetaCart
(Show Context)
In this paper we consider the application of network coding to a multiple unicast setup. We present two suboptimal, yet practical code construction techniques. One consists of a linear program and the other of an integer program with fewer variables and constraints. We discuss the performance of the proposed techniques as well as their complexity.
Network Coding: An Introduction
, 2008
"... The basic idea behind network coding is extraordinarily sim
ple. As it is defined in this book, network coding amounts to no more than performing coding operations on the contents of packetsâperforming arbitrary mappings on the contents of packets rather than the restricted functions of replicatio ..."
Abstract

Cited by 69 (3 self)
 Add to MetaCart
The basic idea behind network coding is extraordinarily sim
ple. As it is defined in this book, network coding amounts to no more than performing coding operations on the contents of packetsâperforming arbitrary mappings on the contents of packets rather than the restricted functions of replication and forwarding that are typically allowed in conventional,
storeandforward architectures. But, although simple, network coding has had little place in the history of networking. This is for good reason: in the traditional wireline technologies that have dominated networking
history, network coding is not very practical or advantageo
us.
Hence the motivation for this book: we feel that network coding may have a great deal to offer to the future design of packet networks, and we would like to help this potential be realized. We would like also to encourage more research in this burgeoning field. Thus, we have aimed the book at two (not necessarily distinct) audiences: first, the practi
tioner, whose main interest is applications; and, second, t
he theoretician, whose main interest is developing further understanding of the properties of network coding. Of these two audiences, we have tended to favor the first, though the content of the book is nevertheless theoretical. We have aimed to expound the theory in such a way that it is access
ible to those who would like to implement network coding, serving an important purpose that was, in our opinion, inadequately served. The theoretician, in contrast to the practitioner, is spoiled. Besides this book, a survey
of important theoretical results in network coding is provi
ded in Yeung et al.âs excellent review, Network Coding Theory [149, 150]. Because of our inclination toward applications, however, our presentation differs substantially from that of Yeung et al.
Network coding for efficient wireless unicast
 in IEEE International Zurich Seminar on Communications
, 2006
"... Abstract — We consider the problem of establishing efficient unicast connections over wireless packet networks. We show how network coding, combined with distributed flow optimization, gives a practicable approach that promises to significantly outperform the present approach of endtoend or linkb ..."
Abstract

Cited by 53 (9 self)
 Add to MetaCart
(Show Context)
Abstract — We consider the problem of establishing efficient unicast connections over wireless packet networks. We show how network coding, combined with distributed flow optimization, gives a practicable approach that promises to significantly outperform the present approach of endtoend or linkbylink retransmission combined with route optimization, where performance may be measured in terms of energy consumption, congestion, or any other cost that increases with the number of transmissions made by each node. We present a specific coding scheme and specific distributed flow optimization techniques that may be used to form the basis of a protocol. I.
Efficient Broadcasting using Network Coding
, 2008
"... We consider the problem of broadcasting in an adhoc wireless network, where all nodes of the network are sources that want to transmit information to all other nodes. Our figure of merit is energy efficiency, a critical design parameter for wireless networks since it directly affects battery life an ..."
Abstract

Cited by 45 (3 self)
 Add to MetaCart
(Show Context)
We consider the problem of broadcasting in an adhoc wireless network, where all nodes of the network are sources that want to transmit information to all other nodes. Our figure of merit is energy efficiency, a critical design parameter for wireless networks since it directly affects battery life and thus network lifetime. We prove that applying ideas from network coding allows to realize significant benefits in terms of energy efficiency for the problem of broadcasting, and propose very simple algorithms that allow to realize these benefits in practice. In particular, our theoretical analysis shows that network coding improves performance by a constant factor in fixed networks. We calculate this factor exactly for some canonical configurations. We then show that in networks where the topology dynamically changes, for example due to mobility, and where operations are restricted to simple distributed algorithms, network coding can offer improvements of a factor of log n, where n is the number of nodes in the network. We use the insights gained from the theoretical analysis to propose lowcomplexity distributed algorithms for realistic wireless adhoc scenarios, discuss a number of practical considerations, and evaluate our algorithms through packet level simulation.