@article{loyola_network-coded_2008,
 abstract = {We consider the problem of finding the minimum number of transmissions in an ad-hoc network for all-to-all broadcasting using network coding. This work generalizes previous results for canonical topologies such as the circle and the wrap around grid to the finite-sized line, and non-wrap-around grid. The latter topologies better reflect network coding in random topologies, since the dissemination of information is "directional", in a sense that information usually arrives via the neighbors on the path to its originator instead of from all possible directions. We find that while the line topology requires a higher number of transmissions compared to the circle, this is interestingly not the case for the grid. We further present simulation results on a heuristic that estimates the required minimum number of transmissions in random wireless topologies and compare it to the optimum solution, as well as previously proposed heuristics.},
 type={4},
 author = {Loyola, L. and Souza, T. De and Widmer, J. and Fragouli, C.},
 journal = {Network Coding Workshop: Theory and Applications},
 tags = {network_coding,wireless},
 title = {Network-coded broadcast: from canonical networks to random topologies},
 year = {2008}
}

{"_id":"Mrrf8Gr8hZRWMCouF","bibbaseid":"loyola-souza-widmer-fragouli-networkcodedbroadcastfromcanonicalnetworkstorandomtopologies-2008","authorIDs":["BovhRrwbYouQ7xD9S"],"author_short":["Loyola, L.","Souza, T. D.","Widmer, J.","Fragouli, C."],"bibdata":{"bibtype":"article","type":"4","abstract":"We consider the problem of finding the minimum number of transmissions in an ad-hoc network for all-to-all broadcasting using network coding. This work generalizes previous results for canonical topologies such as the circle and the wrap around grid to the finite-sized line, and non-wrap-around grid. The latter topologies better reflect network coding in random topologies, since the dissemination of information is \"directional\", in a sense that information usually arrives via the neighbors on the path to its originator instead of from all possible directions. We find that while the line topology requires a higher number of transmissions compared to the circle, this is interestingly not the case for the grid. We further present simulation results on a heuristic that estimates the required minimum number of transmissions in random wireless topologies and compare it to the optimum solution, as well as previously proposed heuristics.","author":[{"propositions":[],"lastnames":["Loyola"],"firstnames":["L."],"suffixes":[]},{"propositions":[],"lastnames":["Souza"],"firstnames":["T.","De"],"suffixes":[]},{"propositions":[],"lastnames":["Widmer"],"firstnames":["J."],"suffixes":[]},{"propositions":[],"lastnames":["Fragouli"],"firstnames":["C."],"suffixes":[]}],"journal":"Network Coding Workshop: Theory and Applications","tags":"network_coding,wireless","title":"Network-coded broadcast: from canonical networks to random topologies","year":"2008","bibtex":"@article{loyola_network-coded_2008,\n abstract = {We consider the problem of finding the minimum number of transmissions in an ad-hoc network for all-to-all broadcasting using network coding. This work generalizes previous results for canonical topologies such as the circle and the wrap around grid to the finite-sized line, and non-wrap-around grid. The latter topologies better reflect network coding in random topologies, since the dissemination of information is \"directional\", in a sense that information usually arrives via the neighbors on the path to its originator instead of from all possible directions. We find that while the line topology requires a higher number of transmissions compared to the circle, this is interestingly not the case for the grid. We further present simulation results on a heuristic that estimates the required minimum number of transmissions in random wireless topologies and compare it to the optimum solution, as well as previously proposed heuristics.},\n type={4},\n author = {Loyola, L. and Souza, T. De and Widmer, J. and Fragouli, C.},\n journal = {Network Coding Workshop: Theory and Applications},\n tags = {network_coding,wireless},\n title = {Network-coded broadcast: from canonical networks to random topologies},\n year = {2008}\n}\n\n","author_short":["Loyola, L.","Souza, T. D.","Widmer, J.","Fragouli, C."],"key":"loyola_network-coded_2008","id":"loyola_network-coded_2008","bibbaseid":"loyola-souza-widmer-fragouli-networkcodedbroadcastfromcanonicalnetworkstorandomtopologies-2008","role":"author","urls":{},"metadata":{"authorlinks":{"fragouli, c":"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2F52xaJNXvSgauGDmZR&msg=embed&noBootstrap=1"}},"downloads":0},"bibtype":"article","biburl":"https://bibbase.org/network/files/52xaJNXvSgauGDmZR","creationDate":"2020-11-13T02:21:59.650Z","downloads":0,"keywords":[],"search_terms":["network","coded","broadcast","canonical","networks","random","topologies","loyola","souza","widmer","fragouli"],"title":"Network-coded broadcast: from canonical networks to random topologies","year":2008,"dataSources":["ZyBHKCcCyS7Qk9n3w","ygmYF48R6aSdzH23h","2BHqTGHtDg7BjRAJQ","XpqzCLvCgsYBqbTpK","QNNZyNQzfeETJyTbL","Z6bBhKezwKd3pPWRc"]}