Conditions for constant throughput in wireless networks. Fragouli, C. & Tabet, T. ACM Transactions on Sensor Networks, 2:359–379, 2005.
abstract   bibtex   
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 \textbackslashem 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.
@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}
}

Downloads: 0