A joint routing and coding approach to linear network coding

Adopting a cross-layer approach, in this paper we propose an algorithm for joint routing and network coding. The proposed algorithm jointly assigns routes and designs linear network codes over finite fields to achieve the capacity of the network. The algorithm has a dynamic programming approach wher...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2011 Wireless Advanced s. 246 - 251
Hlavní autor: El-Khamy, M.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.06.2011
Témata:
capacity
Cost function
Delay
Encoding
finite fields
graph theory
Heuristic algorithms
Joints
linear coding
Network coding
networks
Routing
ISBN:1457701103, 9781457701108
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Adopting a cross-layer approach, in this paper we propose an algorithm for joint routing and network coding. The proposed algorithm jointly assigns routes and designs linear network codes over finite fields to achieve the capacity of the network. The algorithm has a dynamic programming approach where a cost function is used to assign weights to all edges in the network. The cheapest flow is chosen subject to certain encoding constraints in order to achieve the network capacity with network coding while minimizing the network complexity. The effectiveness of the algorithm is demonstrated through carefully chosen examples. We show that the constraints imposed by the joint routing and coding algorithm are necessary for successful decoding at the sinks, and their violation can lead to a failure in achieving the network capacity or an increase in the number of encoding nodes.
ISBN:1457701103
9781457701108
DOI:10.1109/WiAd.2011.5983263