Network capacity of wireless ad hoc networks with delay constraint

Abstract

The capacity of wireless ad hoc networks has been widely studied since the pioneer works by Gupta and Kumar [3], and Grossglauser and Tse [4]. Various asymptotic results on capacity and capacity-delay tradeoffs have been obtained, whereas most of those investigated the asymptotic performance in large networks and addressed the delay caused by node mobility. In this paper the tradeoff between throughput capacity and average transmission delay of arbitrary scale wireless ad hoc networks is investigated. We consider a network with N nodes randomly distributed in a disk area of radius R. A new criterion of transmission concurrency is introduced to describe the concurrent transmitting capability of the network. And by using a constructive scheme, where a balanced scheduling strategy and a minimal length route selection mechanism are proposed, an analytical expression of the relationship between the throughput capacity T and the average transmission delay D is derived. A case study is also provided to give numerical results. © Springer-Verlag Berlin Heidelberg 2005.