On the Throughput of Ad-Hoc Networks using Connectivity Graphs. Fragouli, C., Tabet, T., & Derdiyok, C. In 42nd Annual Allerton Conference on Communication, Control, and Computing, 2004. event-place: University of Illinois, Urbana-Champaign, USA
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 \textbackslashTheta(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.
@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}
}

Downloads: 0