Loading...

Capacity of network coding for wireless multicasting

Eslami, A ; Sharif University of Technology | 2006

468 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/WAMICON.2006.351961
  3. Publisher: 2006
  4. Abstract:
  5. In this paper, we consider the network coding in networks with broadcast channels (called hypernetworks) as the first step for applying network coding to wireless networks. We first prove a Max-Flow Min-Cut theorem for such networks. While we propose an algorithm to achieve this bound, we will introduce new definitions and provide sufficient tools to extend many of the theorems stated for flows in wireline networks to the case of hypernetworks. As an example, we will extend the Max-Flow Min-Cut condition for feasibility of the point-to-point connection in wireline networks to the case of hypernetworks. Then, we will extend the algebraic approach of Koetter and Medard in [3] to the hypernetwork setup whereas we show how the results of recent works based on the model of [3] (e. g. random linear coding), can be straightforwardly generalized to the case of the networks with broadcast channels. ©2006 IEEE
  6. Keywords:
  7. Algebraic approaches ; Broadcast channel (BC) ; Capacity of network ; Hypernetworks ; Linear coding ; Max-flow min-cut ; Max-flow min-cut theorem ; Microwave technology ; Network Coding ; Point-to-point connections ; Wire line networks ; Arsenic compounds ; Broadcasting ; Codes (symbols) ; Computational fluid dynamics ; Microwave devices ; Microwaves ; Programming theory ; Radio broadcasting ; Telecommunication systems ; Wireless networks
  8. Source: IEEE Wireless and Microwave Technology Conference, WAMICON 2006, Clearwater Beach, FL, 4 December 2006 through 5 December 2006 ; 2006 ; 1424408482 (ISBN); 9781424408481 (ISBN)
  9. URL: https://ieeexplore.ieee.org/document/4161123