A matrix-based fast calculation algorithm for estimating network capacity of MANETs

In this paper, we study capacity estimation for mobile ad hoc networks, (MANETs) using directional antennas. A matrix-based fast calculation algorithm is proposed to calculate the network capacity in a network scenario in which there is no channel sharing among multiple sessions and there is an end-to-end delay constraint between each source and destination pair The algorithm calculates the network capacity in terms of the maximum number of k-hop paths based on the k-hop adjacency matrix of the network. Through numerical and simulation results, we show that our proposed algorithm can estimate network capacity much faster than the brute-force search algorithm with the same accuracy. In addition, our proposed algorithm can also be adapted to a transmission environment using omni-directional antennas.

[1]  Chien-Chung Shen,et al.  Topology control for ad hoc networks with directional antennas , 2002, Proceedings. Eleventh International Conference on Computer Communications and Networks.

[2]  W.K.G. Seah,et al.  Topology-based capacity analysis for ad hoc networks with end-to-end delay constraints , 2004, Proceedings of the IEEE 6th Circuits and Systems Symposium on Emerging Technologies: Frontiers of Mobile and Wireless Communication (IEEE Cat. No.04EX710).

[3]  Cauligi S. Raghavendra,et al.  Capacity bounds for ad-hoc networks using directional antennas , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[4]  A. Goldsmith,et al.  Ad hoc network capacity , 2000, Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154).

[5]  Ram Ramanathan,et al.  On the performance of ad hoc networks with beamforming antennas , 2001, MobiHoc '01.

[6]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[7]  H. Vincent Poor,et al.  On the capacity of mobile ad hoc networks with delay constraints , 2006, IEEE Transactions on Wireless Communications.