Combinatorial algorithms for wireless information flow

Combinatorial algorithms for wireless information flow. Ebrahimi, J. & Fragouli, C. ACM Transactions on Algorithms, 2011.
abstract bibtex

A long-standing open question in information theory is to characterize the unicast capacity of a wireless relay network. The difficulty arises due to the complex signal interactions induced in the network, since the wireless channel inherently broadcasts the signals and there is interference among transmissions. Recently, Avestimehr, Diggavi and Tse proposed a linear deterministic model that takes into account the shared nature of wireless channels, focusing on the signal interactions rather than the background noise. They generalized the min-cut max-flow theorem for graphs to networks of deterministic channels and proved that the capacity can be achieved using information theoretical tools. They showed that the value of the minimum cut is in this case the minimum rank of all the adjacency matrices describing source-destination cuts. In this paper, we develop a polynomial time algorithm that discovers the relay encoding strategy to achieve the min-cut value in linear deterministic (wireless) networks, for the case of a unicast connection. Our algorithm crucially uses a notion of linear independence between channels to calculate the capacity in polynomial time. Moreover, we can achieve the capacity by using very simple one-symbol processing at the intermediate nodes, thereby constructively yielding finite length strategies that achieve the unicast capacity of the linear deterministic (wireless) relay network.

@article{ebrahimi_combinatorial_2011,
 abstract = {A long-standing open question in information theory is to characterize the unicast capacity of a wireless relay network. The difficulty arises due to the complex signal interactions induced in the network, since the wireless channel inherently broadcasts the signals and there is interference among transmissions. Recently, Avestimehr, Diggavi and Tse proposed a linear deterministic model that takes into account the shared nature of wireless channels, focusing on the signal interactions rather than the background noise. They generalized the min-cut max-flow theorem for graphs to networks of deterministic channels and proved that the capacity can be achieved using information theoretical tools. They showed that the value of the minimum cut is in this case the minimum rank of all the adjacency matrices describing source-destination cuts. In this paper, we develop a polynomial time algorithm that discovers the relay encoding strategy to achieve the min-cut value in linear deterministic (wireless) networks, for the case of a unicast connection. Our algorithm crucially uses a notion of linear independence between channels to calculate the capacity in polynomial time. Moreover, we can achieve the capacity by using very simple one-symbol processing at the intermediate nodes, thereby constructively yielding finite length strategies that achieve the unicast capacity of the linear deterministic (wireless) relay network.},
 type={2},
 author = {Ebrahimi, Javad and Fragouli, C.},
 journal = {ACM Transactions on Algorithms},
 tags = {network_coding,wireless},
 title = {Combinatorial algorithms for wireless information flow},
 year = {2011}
}

Downloads: 0

{"_id":"dwoTCLjx8p7iLQZRE","bibbaseid":"ebrahimi-fragouli-combinatorialalgorithmsforwirelessinformationflow-2011","authorIDs":["BovhRrwbYouQ7xD9S"],"author_short":["Ebrahimi, J.","Fragouli, C."],"bibdata":{"bibtype":"article","type":"2","abstract":"A long-standing open question in information theory is to characterize the unicast capacity of a wireless relay network. The difficulty arises due to the complex signal interactions induced in the network, since the wireless channel inherently broadcasts the signals and there is interference among transmissions. Recently, Avestimehr, Diggavi and Tse proposed a linear deterministic model that takes into account the shared nature of wireless channels, focusing on the signal interactions rather than the background noise. They generalized the min-cut max-flow theorem for graphs to networks of deterministic channels and proved that the capacity can be achieved using information theoretical tools. They showed that the value of the minimum cut is in this case the minimum rank of all the adjacency matrices describing source-destination cuts. In this paper, we develop a polynomial time algorithm that discovers the relay encoding strategy to achieve the min-cut value in linear deterministic (wireless) networks, for the case of a unicast connection. Our algorithm crucially uses a notion of linear independence between channels to calculate the capacity in polynomial time. Moreover, we can achieve the capacity by using very simple one-symbol processing at the intermediate nodes, thereby constructively yielding finite length strategies that achieve the unicast capacity of the linear deterministic (wireless) relay network.","author":[{"propositions":[],"lastnames":["Ebrahimi"],"firstnames":["Javad"],"suffixes":[]},{"propositions":[],"lastnames":["Fragouli"],"firstnames":["C."],"suffixes":[]}],"journal":"ACM Transactions on Algorithms","tags":"network_coding,wireless","title":"Combinatorial algorithms for wireless information flow","year":"2011","bibtex":"@article{ebrahimi_combinatorial_2011,\n abstract = {A long-standing open question in information theory is to characterize the unicast capacity of a wireless relay network. The difficulty arises due to the complex signal interactions induced in the network, since the wireless channel inherently broadcasts the signals and there is interference among transmissions. Recently, Avestimehr, Diggavi and Tse proposed a linear deterministic model that takes into account the shared nature of wireless channels, focusing on the signal interactions rather than the background noise. They generalized the min-cut max-flow theorem for graphs to networks of deterministic channels and proved that the capacity can be achieved using information theoretical tools. They showed that the value of the minimum cut is in this case the minimum rank of all the adjacency matrices describing source-destination cuts. In this paper, we develop a polynomial time algorithm that discovers the relay encoding strategy to achieve the min-cut value in linear deterministic (wireless) networks, for the case of a unicast connection. Our algorithm crucially uses a notion of linear independence between channels to calculate the capacity in polynomial time. Moreover, we can achieve the capacity by using very simple one-symbol processing at the intermediate nodes, thereby constructively yielding finite length strategies that achieve the unicast capacity of the linear deterministic (wireless) relay network.},\n type={2},\n author = {Ebrahimi, Javad and Fragouli, C.},\n journal = {ACM Transactions on Algorithms},\n tags = {network_coding,wireless},\n title = {Combinatorial algorithms for wireless information flow},\n year = {2011}\n}\n\n","author_short":["Ebrahimi, J.","Fragouli, C."],"key":"ebrahimi_combinatorial_2011","id":"ebrahimi_combinatorial_2011","bibbaseid":"ebrahimi-fragouli-combinatorialalgorithmsforwirelessinformationflow-2011","role":"author","urls":{},"metadata":{"authorlinks":{"fragouli, c":"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&noBootstrap=1&authorFirst=1&nocache=1&fullnames=1&theme=bullets&group0=year&group1=type&owner="}},"downloads":0},"bibtype":"article","biburl":"https://bibbase.org/network/files/52xaJNXvSgauGDmZR","creationDate":"2020-11-13T02:21:59.491Z","downloads":0,"keywords":[],"search_terms":["combinatorial","algorithms","wireless","information","flow","ebrahimi","fragouli"],"title":"Combinatorial algorithms for wireless information flow","year":2011,"dataSources":["ZyBHKCcCyS7Qk9n3w","2BHqTGHtDg7BjRAJQ","XpqzCLvCgsYBqbTpK","QNNZyNQzfeETJyTbL","Z6bBhKezwKd3pPWRc"]}