Topology-based capacity analysis for ad hoc networks with end-to-end delay constraints

Capacity analysis for an ad hoc network supporting delay-sensitive traffic is addressed in this paper. In contrast, most previous capacity analysis work focused on ad hoc networks carrying delay-tolerant traffic and improved the network capacity at the expense of increased transmission delay. In this paper, ad hoc networks are modeled with adjacency matrices. Based on these adjacency matrices, two efficient algorithms, MSDA and CSDA is designed, to derive the capacity of the ad hoc networks carrying delay-sensitive traffic through a sequence of matrix operations. An algorithm to estimate the average hop count of the network is also designed in this paper.