On the Throughput of Ad Hoc Networks using Connectivity Graphs

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.


Published in:
ACM Transactions on Sensor Networks
Year:
2005
Laboratories:




 Record created 2006-12-12, last modified 2018-03-17


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)