Recently added articles from Foundations and Trends in Networking:
Network coding fundamentals.(Brief article)
Apr 01, 2007; ... Abstract Network coding is an elegant and novel technique introduced at the turn of the millennium to improve network throughput and performance. It is expected to be a critical technology for networks of the future. This tutorial addresses the first most natural questions one ...
1 Introduction.(Network Coding Fundamentals)(www.networkcoding.info)
Apr 01, 2007; ... Networked systems arise in various communication contexts such as phone networks, the public Internet, peer-to-peer networks, ad-hoc wireless networks, and sensor networks. Such systems are becoming central to our way of life. During the past half a century, there has been a significant ...
2 The main theorem of network multicast.(Network Coding Fundamentals)
Apr 01, 2007; ... Network multicast refers to simultaneously transmitting the same information to multiple receivers in the network. We are concerned with sufficient and necessary conditions that the network has to satisfy to be able to support the multicast at a certain rate. For the case of unicast (when ...
3 Theoretical frameworks for network coding.(Network Coding Fundamentals)
Apr 01, 2007; ... Network coding can and has been studied within a number of different theoretical frameworks, in several research communities. The choice of framework a researcher makes most frequently depends on his background and preferences. However, one may also argue that each network coding issue ...
4 Throughput benefits of network coding.(Network Coding Fundamentals)
Apr 01, 2007; ... The multicast examples considered in the previous chapters demonstrated that network coding can offer throughput benefits when compared to routing; we will here look into how large such benefits can be. We consider both directed and undirected networks, under two types of routing: integral ...
5 Network code design methods for multicasting.(Network Coding Fundamentals)
Apr 01, 2007; ... We now look at network code design algorithms for multicasting under the assumptions of the main network coding theorem (Theorem 2.2). We assume the network multicast model as established in Section 3.1: namely, a directed acyclic graph with unit capacity edges where the min-cut to each of ...
6 Networks with delay and cycles.(Network Coding Fundamentals)
Apr 01, 2007; ... For most of this review we have assumed that all nodes in the network simultaneously receive all their inputs and produce their outputs, and that networks have no cycles. We will now relax these assumptions. We first look at how to deal with delay over acyclic graphs. We then formally ...
7 Resources for network coding.(Network Coding Fundamentals)
Apr 01, 2007; ... Now that we have learned how to design network codes and how much of throughput increase to expect in networks using network coding, it is natural to ask how much it costs to operate such networks. We focus our discussion on resources required to linear network coding for multicasting, as ...
Appendix: points in general position.(Network Coding Fundamentals)
Apr 01, 2007; ... For networks with h sources and linear network coding over a field [[??].sub.q], the coding vectors lie in [F.sup.h.sub.q], the h-dimensional vector space over the field [[??].sub.q]. Since in network coding we only need to ensure linear independence conditions, we are interested in many ...
Acknowledgments.(Network Coding Fundamentals)
Apr 01, 2007; ... This work was in part supported by the Swiss National Science Foundation under award No. PP002110483, NSF under award No. CCR-0325673, and DIMACS under the auspices of Special focus on Computational Information Theory and Coding. ...
Notations and acronyms.(Network Coding Fundamentals)
Apr 01, 2007; ... [[??].sub.q]: finite field with q elements h: number of sources N: number of receivers {G,S,R}: a multicast instance comprising of a directed graph G = (V,E), a source vertex S [member of] V, and a set R = {[R.sub.1],[R.sub.2], ...,[R.sub.N]} of ...
References.(Network Coding Fundamentals)
Apr 01, 2007; ... [1] A. Agarwal and M. Charikar, "On the advantage of network coding for improving network throughput," IEEE Information Theory Workshop, San Antonio, Texas, 2004. [2] R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, "Network information flow," IEEE Transactions on Information ...
Cooperative Communications.
Aug 01, 2006; ... Abstract This article reviews progress in cooperative communication networks. Our survey is by no means exhaustive. Instead, we assemble a representative sample of recent results to serve as a roadmap for the area. Our emphasis is on wireless networks, but many of the results ...
1 Overview.(Cooperative Communications)
Aug 01, 2006; ... 1.1 Introduction The classic representation of a communication network is a graph, as in Figure 1.1, with a set of nodes and edges. The nodes usually represent devices such as a router, a wireless access point, or a mobile telephone. The edges usually represent communication ...
2 Conventional networks: a review.(Cooperative Communications)
Aug 01, 2006; ... Before describing cooperative protocols and networks, we start with a review of networking models and common practices. Our discussion introduces the conventional decomposition of a network into protocol layers. We then employ these layers to organize the subsequent review of the physical, ...
3 Network models.(Cooperative Communications)
Aug 01, 2006; ... The aim of this chapter is to develop a common framework for analyzing capacities of wireline and wireless networks. Our focus will, in fact, be on physical- and link-layer issues for wireless problems. However, there are close relations between wireline and wireless networks that we wish ...
4 Cooperative strategies and rates.(Cooperative Communications)
Aug 01, 2006; ... This chapter introduces several cooperative strategies. We will consider primarily wireless networks, and we further consider either no fading or fast fading. Slow fading channels will be treated in Chapter 5. For all cases, we consider only "CSIR, No CSIT" models where each node knows the ...
5 Cooperative diversity.(Cooperative Communications)
Aug 01, 2006; ... 5.1 Introduction The previous chapter examined cooperative strategies when no fading or fast fading is present. The main performance metric was rate because long codes can average out the effects of noise and fading and can make the error probability approach zero. In this ...
6 Wireless networking protocols.(Cooperative Communications)
Aug 01, 2006; ... 6.1 Introduction We have observed that cooperative networks enable a more complex set of interactions between the physical, link, and network layers. Transmissions are not point-to-point and routing is not store-and-forward. We need to distinguish between a message that an ...
Acknowledgments.(Cooperative Communications)
Aug 01, 2006; ... We thank Tony Ephremides for persuading us to start this project and encouraging us to finish it. Though the task was a challenge, it was overall a pleasant experience. We thank the reviewers for their many suggestions both big and small, and, in particular, for proposing ...