@inproceedings{fragouli_throughput_2004,
 abstract = {In this paper we propose a set of necessary and sufficient conditions under which the throughput in an ad-hoc network can remain constant as the number of nodes n increases. Throughput refers to the minimum achievable rate between a source-destination pair for a given routing mechanism and physical model, when the network is shared by {\textbackslash}Theta(n) randomly chosen source-destination pairs. The main idea is to use a connectivity graph, that does not represent the actual physical network, but rather the available communication resources.},
 type={4},
 author = {Fragouli, C. and Tabet, T. and Derdiyok, C.},
 booktitle = {42nd {Annual} {Allerton} {Conference} on {Communication}, {Control}, and {Computing}},
 note = {event-place: University of Illinois, Urbana-Champaign, USA},
 tags = {wireless},
 title = {On the {Throughput} of {Ad}-{Hoc} {Networks} using {Connectivity} {Graphs}},
 year = {2004}
}

{"_id":"559RPzzBPm6e7wfGC","bibbaseid":"fragouli-tabet-derdiyok-onthethroughputofadhocnetworksusingconnectivitygraphs-2004","authorIDs":["BovhRrwbYouQ7xD9S"],"author_short":["Fragouli, C.","Tabet, T.","Derdiyok, C."],"bibdata":{"bibtype":"inproceedings","type":"4","abstract":"In this paper we propose a set of necessary and sufficient conditions under which the throughput in an ad-hoc network can remain constant as the number of nodes n increases. Throughput refers to the minimum achievable rate between a source-destination pair for a given routing mechanism and physical model, when the network is shared by \\Theta(n) randomly chosen source-destination pairs. The main idea is to use a connectivity graph, that does not represent the actual physical network, but rather the available communication resources.","author":[{"propositions":[],"lastnames":["Fragouli"],"firstnames":["C."],"suffixes":[]},{"propositions":[],"lastnames":["Tabet"],"firstnames":["T."],"suffixes":[]},{"propositions":[],"lastnames":["Derdiyok"],"firstnames":["C."],"suffixes":[]}],"booktitle":"42nd Annual Allerton Conference on Communication, Control, and Computing","note":"event-place: University of Illinois, Urbana-Champaign, USA","tags":"wireless","title":"On the Throughput of Ad-Hoc Networks using Connectivity Graphs","year":"2004","bibtex":"@inproceedings{fragouli_throughput_2004,\n abstract = {In this paper we propose a set of necessary and sufficient conditions under which the throughput in an ad-hoc network can remain constant as the number of nodes n increases. Throughput refers to the minimum achievable rate between a source-destination pair for a given routing mechanism and physical model, when the network is shared by {\\textbackslash}Theta(n) randomly chosen source-destination pairs. The main idea is to use a connectivity graph, that does not represent the actual physical network, but rather the available communication resources.},\n type={4},\n author = {Fragouli, C. and Tabet, T. and Derdiyok, C.},\n booktitle = {42nd {Annual} {Allerton} {Conference} on {Communication}, {Control}, and {Computing}},\n note = {event-place: University of Illinois, Urbana-Champaign, USA},\n tags = {wireless},\n title = {On the {Throughput} of {Ad}-{Hoc} {Networks} using {Connectivity} {Graphs}},\n year = {2004}\n}\n\n","author_short":["Fragouli, C.","Tabet, T.","Derdiyok, C."],"key":"fragouli_throughput_2004","id":"fragouli_throughput_2004","bibbaseid":"fragouli-tabet-derdiyok-onthethroughputofadhocnetworksusingconnectivitygraphs-2004","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":"inproceedings","biburl":"https://bibbase.org/network/files/52xaJNXvSgauGDmZR","creationDate":"2020-11-13T02:21:59.548Z","downloads":0,"keywords":[],"search_terms":["throughput","hoc","networks","using","connectivity","graphs","fragouli","tabet","derdiyok"],"title":"On the Throughput of Ad-Hoc Networks using Connectivity Graphs","year":2004,"dataSources":["ZyBHKCcCyS7Qk9n3w","2BHqTGHtDg7BjRAJQ","XpqzCLvCgsYBqbTpK","QNNZyNQzfeETJyTbL","Z6bBhKezwKd3pPWRc"]}