Deterministic Results on Capacity-delay Tradeoffs in Wireless Multi-hop Networks

The throughput capacity and tradeoff between capacity and transmission delay of wireless multi-hop networks have been widely studied. However, most of the former work investigated the asymptotic performance in large networks and addressed the delay caused by node mobility. In this paper we derive deterministic results of the tradeoff between the uniform per node throughput capacity and the average end to end transmission delay. We consider a network where N nodes are randomly distributed in a disk area of radius R. By using a constructive scheme, where a balanced scheduling strategy and a minimal length route selection mechanism are proposed, we derive an analytical expression of the tradeoff between the throughput capacity T and the average end to end transmission delay D . The maximum capacity without delay constraint is also obtained. In the end we give a case study to show numerical results.