摘要
采用定向天线的传输模式下,当信道带宽和端到端时延同时受到限制时,讨论了Ad hoc网络容量的估计问题,提出了1种基于矩阵运算的网络容量快速估计算法(MCFCA).该算法与BFSA比较,前者的时间复杂度为O(N2/K),后者的为O{[N/(K+1)]K},MCFCA算法更能跟踪网络拓扑的变化.
The capacity estimation for mobile ad hoc networks （MANETs） using directional antennas is studied. A matrix-based channel-sharing fast calculation algorithm （MCFCA） is proposed to estimate the network capacity in a network scenario in which there is channel sharing among multiple sessions and traffic is delay sensitive with an end-to-end delay constraint. Comparing with the time complexity O{[N/（k ＋ 1）]^N} of the brute force search algorithm（BFSA）, the new algorithm can obtain the capacity of ad hoc networks with time complexity O （N2/k）. Therefore, MCFCA shows better behavior in tracing the time-varying network topology.
出处
《北京邮电大学学报》
EI
CAS
CSCD
北大核心
2006年第3期70-72,共3页
Journal of Beijing University of Posts and Telecommunications
基金
国家自然科学基金项目(60402005)
关键词
网络性能
测量方法
定向天线
MANETS
network performance
measurement method
directional antennas
mobile Ad hoc networks
