• Home
  • Search
  • Minimum-cost Subgraph Algorithms for Static and Dynamic Multicasts with Network Coding
  • Cite Icon9
  • https://doi.org/10.1007/978-1-4419-0673-1_12Copy DOI Icon

Minimum-cost Subgraph Algorithms for Static and Dynamic Multicasts with Network Coding

  • Jan 1, 2009
  • Fang Zhao +3 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Network coding, introduced by Ahlswede et al. in their pioneering work [1], has generated considerable research interest in recent years, and numerous subsequent papers, e.g., [2–6], have built upon this concept. One of the main advantages of network coding over traditional routed networks is in the area of multicast, where common information is transmitted from a source node to a set of terminal nodes. Ahlswede et al. showed in [1] that network coding can achieve the maximum multicast rate, which is not achievable by routing alone. When coding is used to perform multicast, the problem of establishing minimum cost multicast connection is equivalent to two effectively decoupled problems: one of determining the subgraph to code over and the other of determining the code to use over that subgraph. The latter problem has been studied extensively in [5, 7–9], and a variety of methods have been proposed, which include employing simple random linear coding at every node. Such random linear coding schemes are completely decentralized, requiring no coordination between nodes, and can operate under dynamic conditions [10]. These papers, however, all assume the availability of dedicated network resources. In this chapter, we focus on the former problem, which is to find the min-cost subgraph that allows the given multicast connection to be established (with appropriate coding) over coded packet networks. This problem has been studied in [11,12]. The analogous problem for routed network is the Steiner tree problem, which is known

Similar Papers
  • Book Chapter
  • Citations5

Joint Channel-Network Coding (JCNC) for Distributed Storage in Wireless Network

  • Jan 01, 2009
  • Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
  • Ning Wang +1
  • Conference Article
  • Citations25

Optimal Linear Network Coding Design for Secure Unicast with Multiple Streams

  • Mar 01, 2010
  • Jin Wang +4
  • Conference Article
  • Citations1

Data gathering for network compressed coding enabled wireless sensor networks

  • Aug 01, 2013
  • Yunhe Li +3
  • Research Article
  • Citations14

Bounds for List-Decoding and List-Recovery of Random Linear Codes

  • Feb 01, 2022
  • IEEE Transactions on Information Theory
  • Venkatesan Guruswami +5
  • Conference Article
  • Citations9

Scaling exponent of sparse random linear codes over binary erasure channels

  • Jun 01, 2017
  • Hessam Mahdavifar
  • Book Chapter
  • Citations419

Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding

  • Jan 01, 2012
  • Anja Becker +3
  • Research Article

네트워크 코딩의 병렬처리 성능비교

  • Aug 31, 2012
  • The KIPS Transactions:PartC
  • Seong-Min Choi +2
  • Research Article
  • Citations33

Band Codes for Energy-Efficient Network Coding With Application to P2P Mobile Streaming

  • Sep 02, 2013
  • IEEE Transactions on Multimedia
  • Attilio Fiandrotti +4
  • Conference Article
  • Citations1

Gossiping with Network Coding

  • Dec 01, 2011
  • Shun Tokuyama +2
  • PDF
  • Conference Article
  • Citations1

Combination of Intra-Flow Network Coding and Opportunistic Routing: Reliable Communications over Wireless Mesh Networks

  • Jan 01, 2015
  • Pablo Garrido +3
  • Conference Article
  • Citations5

Exploiting partial packets in random linear codes using sparse error recovery

  • Jun 01, 2015
  • Mohammad Sadegh Mohammadi +2
  • Research Article
  • Citations15

Grassmannian Codes With New Distance Measures for Network Coding

  • Jul 01, 2019
  • IEEE Transactions on Information Theory
  • Tuvi Etzion +1
  • Conference Article
  • Citations8

Secure Routing Based on Network Coding in Wireless Sensor Networks

  • Jul 01, 2013
  • Jing Chen +3
  • Conference Article
  • Citations11

R^2NC: Redundant and Random Network Coding for H.264/SVC Transmission

  • Sep 01, 2011
  • Cuiping Jing +5
  • Conference Article
  • Citations9

Network coding for wireless applications

  • Oct 13, 2005
  • Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE
  • Desmond S Lun +11
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.