@article{fragouli_conditions_2005,
 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 {\textbackslash}em connectivity graph, that does not represent the actual physical network, but rather the available communication resources. This graph also allows to translate the problem of maximizing t he throughput in ad-hoc networks to the multicommodity flow problem and directly apply related results.},
 type={2},
 author = {Fragouli, C. and Tabet, T.},
 journal = {ACM Transactions on Sensor Networks},
 pages = {359--379},
 tags = {sensor_networks},
 title = {Conditions for constant throughput in wireless networks},
 volume = {2},
 year = {2005}
}

{"_id":"ny5nywdSvoCyTvB2C","bibbaseid":"fragouli-tabet-conditionsforconstantthroughputinwirelessnetworks-2005","authorIDs":["BovhRrwbYouQ7xD9S"],"author_short":["Fragouli, C.","Tabet, T."],"bibdata":{"bibtype":"article","type":"2","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 \\em connectivity graph, that does not represent the actual physical network, but rather the available communication resources. This graph also allows to translate the problem of maximizing t he throughput in ad-hoc networks to the multicommodity flow problem and directly apply related results.","author":[{"propositions":[],"lastnames":["Fragouli"],"firstnames":["C."],"suffixes":[]},{"propositions":[],"lastnames":["Tabet"],"firstnames":["T."],"suffixes":[]}],"journal":"ACM Transactions on Sensor Networks","pages":"359–379","tags":"sensor_networks","title":"Conditions for constant throughput in wireless networks","volume":"2","year":"2005","bibtex":"@article{fragouli_conditions_2005,\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 {\\textbackslash}em connectivity graph, that does not represent the actual physical network, but rather the available communication resources. This graph also allows to translate the problem of maximizing t he throughput in ad-hoc networks to the multicommodity flow problem and directly apply related results.},\n type={2},\n author = {Fragouli, C. and Tabet, T.},\n journal = {ACM Transactions on Sensor Networks},\n pages = {359--379},\n tags = {sensor_networks},\n title = {Conditions for constant throughput in wireless networks},\n volume = {2},\n year = {2005}\n}\n\n","author_short":["Fragouli, C.","Tabet, T."],"key":"fragouli_conditions_2005","id":"fragouli_conditions_2005","bibbaseid":"fragouli-tabet-conditionsforconstantthroughputinwirelessnetworks-2005","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://s3-us-west-2.amazonaws.com/us-west-2.files.campus.edublogs.org/research.seas.ucla.edu/dist/3/23/files/2023/10/arni_db.bib","creationDate":"2020-11-13T02:21:59.536Z","downloads":0,"keywords":[],"search_terms":["conditions","constant","throughput","wireless","networks","fragouli","tabet"],"title":"Conditions for constant throughput in wireless networks","year":2005,"dataSources":["ZyBHKCcCyS7Qk9n3w","2BHqTGHtDg7BjRAJQ","XpqzCLvCgsYBqbTpK","QNNZyNQzfeETJyTbL","Z6bBhKezwKd3pPWRc"]}