基于矩阵的manet网络容量快速估计算法

Ning Li, Yan Guo, Shaoren Zheng, Chang Tian, Jun Zheng
{"title":"基于矩阵的manet网络容量快速估计算法","authors":"Ning Li, Yan Guo, Shaoren Zheng, Chang Tian, Jun Zheng","doi":"10.1109/ICW.2005.11","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":255955,"journal":{"name":"2005 Systems Communications (ICW'05, ICHSN'05, ICMCS'05, SENET'05)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"A matrix-based fast calculation algorithm for estimating network capacity of MANETs\",\"authors\":\"Ning Li, Yan Guo, Shaoren Zheng, Chang Tian, Jun Zheng\",\"doi\":\"10.1109/ICW.2005.11\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":255955,\"journal\":{\"name\":\"2005 Systems Communications (ICW'05, ICHSN'05, ICMCS'05, SENET'05)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-08-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2005 Systems Communications (ICW'05, ICHSN'05, ICMCS'05, SENET'05)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICW.2005.11\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2005 Systems Communications (ICW'05, ICHSN'05, ICMCS'05, SENET'05)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICW.2005.11","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

摘要

本文研究了使用定向天线的移动自组网(manet)的容量估计。提出了一种基于矩阵的网络容量快速计算算法,该算法基于网络的k-hop邻接矩阵,根据k-hop路径的最大数目计算网络容量,在多个会话之间没有信道共享且每个源对和目的对之间存在端到端延迟约束的网络场景下计算网络容量。通过数值和仿真结果表明,在相同的精度下,本文提出的算法可以比暴力搜索算法更快地估计网络容量。此外,该算法还可以适应全向天线的传输环境。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A matrix-based fast calculation algorithm for estimating network capacity of MANETs
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信