The multicast capacity of deterministic relay networks with no interference

Ratnakar, N.; Kramer, Gerhard

doi:10.1109/tit.2006.874431

Cited by 84 publications

(79 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Note also that one can separate channel coding (PHY layer coding) and routing (network layer coding) to achieve the capacity for this special case. However, such separation of channel and network coding is not always optimal [152]. …”

Section: Routingmentioning

confidence: 99%

Cooperative Communications

Kramer¹,

2006

View full text Add to dashboard Cite

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 apply to cooperation in wireline networks and mixed wireless/wireline networks. We intend our presentation to be a tutorial for the reader who is familiar with information theory concepts but has not actively followed the field. For the active researcher, this contribution should serve as a useful digest of significant results. This article is meant to encourage readers to find new ways to apply the ideas of network cooperation and should make the area sufficiently accessible to network designers to contribute to the advancement of networking practice. Overview IntroductionThe 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 links or channels, for example a fiber-optic cable or a wireless link. Both the devices and the channels may have constraints on their operation. For example, a router might have limited processing power, or perhaps it can accept data from only a few of its ports simultaneously. A fiber-optic link has a limited bandwidth (which can be quite large!). A wireless phone, on the other hand, has limited battery resources and likely wishes to conserve energy. A wireless link can have rapid time variations arising from mobility and multipath propagation of signals. Some of these properties are collected in Table 1.1 and are described in more detail in this text.The purpose of a communication network is to enable the exchange of messages between its nodes. These messages, as generated by an application, are organized into data packets. In the traditional model of a network, the nodes operate as store-and-forward packet routers that transmit packets over point-to-point links. However, this model is unnecessarily restrictive as it ignores two important possibilities:• Node Coding: Nodes can combine, or encode, any of their received information and symbol streams.• Broadcasting: Nodes overhear the transmissions of other nodes from which they are not required to receive messages.Node coding is possible in any network, while the ability to overhear transmissions is a property of the physical communication channel. In particular, wireless devices inherently broadcast information in that a signal to a particular receiving node can be overheard by other nodes. Typically, the wireless nodes treat these overheard signals as interference and the system provides mechanisms to mitigate this interference. For example, many second generation cellular phones employ code division multiple access (CDMA) to permit signal decoding in 274 Overview the presence of interference [185]. As a second example, 802.11× wireless LANs employ a media access...

show abstract

Section: Routingmentioning

confidence: 99%

Cooperative Communications

Kramer¹,

2006

View full text Add to dashboard Cite

show abstract

“…Wireless network coding has also been studied using information theoretic tools. For example, Gowaikar et al looked at the capacity of wireless erasure networks [30], Ratnakar et al [67] examined broadcasting over deterministic channels, and Avestimehr et al examined networks of general deterministic channels with broadcasting and interference [3,4]. Cross layer design has been examined by Sagduyu and Ephremides, see for example [75].…”

Section: Notesmentioning

confidence: 99%

Network Coding Applications

Fragouli

Soljanin²

2007

FNT in Networking

132

View full text Add to dashboard Cite

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 deals with wireless and content distribution networks, considered to be the most likely applications of network coding, and it also reviews emerging applications of network coding such as network monitoring and management. Multiple unicasts, security, networks with unreliable links, and quantum networks are also addressed. The preceding companion deals with theoretical foundations of network coding.

show abstract

“…Cut-set bounds are known to be tight for a small number of wireless network models (e.g., networks of deterministic broadcast channels under multicast demands [9]). The gap between cut-set rates and capacities is non-zero even for many three-node networks [1,Section 15.10] and can be arbitrarily large in networks of noiseless links [3].…”

Section: Introductionmentioning

confidence: 99%

“…The resulting bounds are not always achievable, so the use of noiseless bit pipes does not imply separation. In fact, separation is known not to hold for networks of noisy broadcast channels [14] or even networks of noiseless broadcast channels [9] in which each channel output is a deterministic function of the channel input.…”

Section: Introductionmentioning

confidence: 99%

Capacity bounds for networks of broadcast channels

Effros

2010

2010 IEEE International Symposium on Information Theory

View full text Add to dashboard Cite

Abstract-This paper derives new outer bounds on the capacities of networks comprised of broadcast and point-to-point channels. The results are tight in some cases, and methods for bounding their error in general are discussed. The results given demonstrate the simplicity of generalizing network coding results to networks of noisy channels using the family of network equivalence tools. The approach taken is not inherently a cutset approach and frequently yields tighter bounds than those achieved by traditional cut-sets.

show abstract

The multicast capacity of deterministic relay networks with no interference

Cited by 84 publications

References 25 publications

Cooperative Communications

Cooperative Communications

Network Coding Applications

Capacity bounds for networks of broadcast channels

Contact Info

Product

Resources

About