FAST CAPACITY ESTIMATION ALGORITHMS FOR MANETS USING DIRECTIONAL ANTENNAS

• 出 处: Journal of Electronics(China)
• 发表日期: 2007年05期
• 关键词: links constraint letter estimates faster scenario traffic have topology directio

In this letter,capacity estimation for Mobile Ad hoc NETworks (MANETs) using direc- tional 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 algo- rithm MFCA-1 is used to estimate network capacity in a situation where all links have the same delay. It estimates the maximum number of k-hop sessions in a network based on the k-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.

In this letter, capacity estimation for Mobile Ad hoc NETworks (MANETs) using direc- tional 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 algo- rithm MFCA-1 is used to estimate network capacity in a situation where all links have the same delay. It estimates the maximum number of k-hop sessions in a network based on the k-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 numerical results show that both MFCA-1 and MFCA-2 can calculate network capacity much faster th an the well-known Brute-Force Search Algorithm (BFSA) but with the same accuracy.