By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Ning Li ; Nanjing Inst. of Commun. Eng., China ; Yan Guo ; Shaoren Zheng ; Chang Tian
more authors

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.

Published in:

2005 Systems Communications (ICW'05, ICHSN'05, ICMCS'05, SENET'05)

Date of Conference:

14-17 Aug. 2005