Loading...

Robust network coding using information flow decomposition

Rezagholipour, M ; Sharif University of Technology | 2008

441 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/WIOPT.2008.4586123
  3. Publisher: 2008
  4. Abstract:
  5. In this paper, we propose a new approach to find a static solution for a multicast network problem. Our work relates the existence of a static network code to minimal subtree graphs of a given network. For a given multicast network there are different solutions. Sometimes some links of a network may be removed and then we will be encountered with link failure in the network. Therefore, to choose a specific satisfactory network code solution among different options, we must see how much the network code adds the network robustness against link failures. In this paper we extend the definition of the minimal subtree graph and replace it with a new definition of minimal subgraph and show that the static network code that is robust against all of solvable link failure patterns is a code that comes from solving all minimal subgraphs of a given network simultaneously
  6. Keywords:
  7. Ad hoc networks ; Codes (standards) ; Codes (symbols) ; Graph theory ; Multicasting ; Optimization ; Programming theory ; Solutions ; Information flows ; International symposium ; Link failure ; Link failures ; Minimal subtree graph ; Multicast ; Multicast networks ; Network coding ; Network robustness ; New approaches ; Robust networks ; Robustness ; Static networks ; Sub trees ; Sub-graphs ; Wireless networks
  8. Source: 6th Intl. Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, Wiopt 2008, Berlin, 1 April 2008 through 3 April 2008 ; 2008 , Pages 528-532 ; 9789639799189 (ISBN)
  9. URL: https://ieeexplore.ieee.org/document/4586123