北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2006, Vol. 29 ›› Issue (3): 70-72.doi: 10.13190/jbupt.200603.70.009

• 研究报告 • 上一篇    下一篇

基于矩阵运算的Ad hoc网络容量快速估计算法

李 宁1,2,郭 艳2,田 畅1,郑少仁1,3   

  1. 1. 解放军理工大学 通信工程学院,江苏 南京 210007; 2. 解放军理工大学 理学院,江苏 南京 210007;
    3. 南京邮电大学 网络技术研究所,江苏 南京 210003
  • 收稿日期:2005-07-01 修回日期:1900-01-01 出版日期:2006-06-30 发布日期:2006-06-30
  • 通讯作者: 李宁

A Matrix-based Channel-sharing Fast Calculation Algorithm for Estimating Network Capacity of MANETs

LI Ning1,2, GUO Yan2, TIAN Chang1, ZHENG Shao-ren1,3   

  1. 1. Institute of Communications Engineering, PLA Univ. of Sci. & Tech., Nanjing 210007, China;
    2. Institute of Sciences, PLA Univ. of Sci. & Tech., Nanjing 210007, China;
    3. Nanjing University of Posts and Telecommunications, Nanjing 210003
  • Received:2005-07-01 Revised:1900-01-01 Online:2006-06-30 Published:2006-06-30
  • Contact: LI Ning

摘要:

采用定向天线的传输模式下,当信道带宽和端到端时延同时受到限制时,讨论了ad hoc网络容量的估计问题,提出了1种基于矩阵运算的网络容量快速估计算法,MCMFCA(写出全称)该算法与BFSA比较,前者的时间复杂度为0(N2/K),后者的为0{[N/(K+1)]K},MCMFCA算法更能够跟踪网络拓扑的变化。

关键词: 网络性能, 测量方法, 定向天线, MANETs

Abstract:

In this paper, we study capacity estimation for mobile ad hoc networks (MANETs) using directional antennas. 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. The new algorithm estimates the network capacity in terms of the maximum number of one-hop paths based on the adjacency matrix of the network. Through numerical results, we show that our proposed algorithm can calculate network capacity much faster than the well-known Brute-Force Search Algorithm (BFSA) but with the same accuracy.

Key words: network performance, measurement method, directional antennas, MANETs

中图分类号: