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}
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.