Loading...

Wireless multicasting using network coding

Eslami, A ; Sharif University of Technology | 2006

442 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/WOACN.2006.337183
  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. Therefore, a complete set of results on using linear network coding in such networks will be provided. © 2006 IEEE
  6. Keywords:
  7. Broadcasting ; Codes (symbols) ; Computational fluid dynamics ; Eigenvalues and eigenfunctions ; Linear networks ; Local area networks ; Mathematical operators ; Programming theory ; Radio broadcasting ; Telecommunication systems ; (I ,J) conditions ; (U ,V) operator ; Algebraic approaches ; Broadcast channel (BC) ; community networks ; Hypernetworks ; Linear coding ; Max-flow min-cut ; Max-flow min-cut theorem ; Network Coding ; Point-to-point connections ; Wire line networks ; Wireless networks
  8. Source: 2006 1st Workshop on Operator-Assisted (Wireless-Mesh) Community Networks, OpComm 2006, Berlin, 18 September 2006 through 19 September 2006 ; 2006 ; 1424406927 (ISBN); 9781424406920 (ISBN)
  9. URL: https://ieeexplore.ieee.org/document/4138224