Title :
A Decentralized Approach to Network Coding Based on Learning
Author :
Jabbarihagh, Mohammad ; Lahouti, Farshad
Abstract :
Network coding is used to efficiently transmit information in a network from source nodes to sink nodes through intermediate nodes. It has been shown that linear coding is sufficient to achieve the multicast network capacity. In this paper, we introduce a method to design capacity achieving network codes based on reinforcement learning and makes using the market theory concepts. We demonstrate that the proposed algorithm is decentralized and polynomial time complex; while it constructs the codes much faster than other random methods with the same complexity order, especially in large networks with small field sizes. Furthermore, the proposed algorithm is robust to link failures and is used to reduce the number of encoding nodes in the network.
Keywords :
computational complexity; directed graphs; learning (artificial intelligence); linear codes; multicast communication; acyclic directed graph; decentralized approach; intermediate nodes; linear coding; market theory concept; multicast network capacity; network coding; polynomial time complex; reinforcement learning; sink nodes; source nodes; Design methodology; Encoding; Finite element methods; Laboratories; Learning; Multicast algorithms; Multimedia communication; Network coding; Robustness; Wireless communication;
Conference_Titel :
Information Theory for Wireless Networks, 2007 IEEE Information Theory Workshop on
Conference_Location :
Solstrand
Print_ISBN :
978-1-4244-1200-6
Electronic_ISBN :
978-1-4244-1200-6
DOI :
10.1109/ITWITWN.2007.4318025