Abstract
In this letter, capacity estimation for Mobile Ad hoc NETworks (MANETs) using directional antennas are studied. Two Matrix-based Fast Calculation Algorithms (MFCAs) are proposed to estimate the network capacity in a network scenario in which there is no channel sharing among multiple sessions and traffic is sensitive to delay with an end-to-end delay constraint. The first algorithm MFCA-1 is used to estimate network capacity in a situation where all links have the same delay. It estimates the maximum number of κ-hop sessions in a network based on the κ-hop adjacency matrix of the network. The second algorithm MFCA-2 is used to estimate network capacity in a situation where different links may have different delays. It calculates the maximum number of sessions in a network with an end-to-end delay constraint based on the adjacency matrix and the link-delay matrix of the network. Numerical and simulation results show that both MFCA-1 and MFCA-2 can calculate network capacity much faster than the well-known Brute-Force Search Algorithm (BFSA) but with the same accuracy.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
