A Matrix-Based Fast Calculation Algorithm for Estimating Network Capacity of MANETs

Authors:
Ning Li;Yan Guo;Shaoren Zheng;Chang Tian;Jun Zheng
Affiliations:
Nanjing Institute of Communications Engineering;Nanjing Institute of Communications Engineering;Nanjing University of Posts and Telecommunications;Nanjing Institute of Communications Engineering;University of Ottawa
Venue:
ICW '05 Proceedings of the 2005 Systems Communications
Year:
2005

Citing 0
Cited 3

A fast algorithm to calculate powers of a Boolean matrix for diameter computation of random graphs

WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
An agent using matrix for backward path search on MANET

KES-AMSTA'08 Proceedings of the 2nd KES International conference on Agent and multi-agent systems: technologies and applications
A cost matrix agent for shortest path routing in ad hoc networks

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.