Throughput Capacity of Ad Hoc Networks with Route Discovery

Abstract

Throughput capacity of large ad hoc networks has been shown to scale adversely with the size of network n. However the need for the nodes to find or repair routes has not been analyzed in this context. In this paper, we explicitly take route discovery into account and obtain the scaling law for the throughput capacity under general assumptions on the network environment, node behavior, and the quality of route discovery algorithms. We also discuss a number of possible scenarios and show that the need for route discovery may change the scaling for the throughput capacity.