异构WMN的延迟、吞吐量和包吸收率分析

S. Chien, Ka Kien Lo, K. Kwong, G. Poh, D. Chieng
{"title":"异构WMN的延迟、吞吐量和包吸收率分析","authors":"S. Chien, Ka Kien Lo, K. Kwong, G. Poh, D. Chieng","doi":"10.1049/cp.2012.2085","DOIUrl":null,"url":null,"abstract":"The pioneering work of Gupta and Kumar [1] has inspired many subsequent studies on asymptotically achievable per node throughput and delay analysis for wireless networks. In this paper, we evaluate the delay and maximum achievable per node throughput of a heterogeneous wireless mesh network (HWMN). We derive an analytical model which incorporates diffusion approximation method [2] and then compare with the results of per node information theoretic capacity done by P. Li and Y.G. Fang [3]. The network topology consists of n normal nodes and m more powerful helping nodes in a rectangular area. Results show that higher magnitude of exponent w gives higher absorption probability which consequently reduces the delay. We found that the derived maximum achievable per node throughput is inversely proportional to the average number of hops traversed by packets, node density, and number of squares in the network. Also, we are able to obtain the result stated in [1] i.e., maximum achievable per-node throughput is according to Θ(W1/√nlogn), where W1 is normal node transmission bandwidth. (6 pages)","PeriodicalId":383835,"journal":{"name":"IET International Conference on Wireless Communications and Applications","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Delay, throughput and packet absorption rate analysis of heterogeneous WMN\",\"authors\":\"S. Chien, Ka Kien Lo, K. Kwong, G. Poh, D. Chieng\",\"doi\":\"10.1049/cp.2012.2085\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The pioneering work of Gupta and Kumar [1] has inspired many subsequent studies on asymptotically achievable per node throughput and delay analysis for wireless networks. In this paper, we evaluate the delay and maximum achievable per node throughput of a heterogeneous wireless mesh network (HWMN). We derive an analytical model which incorporates diffusion approximation method [2] and then compare with the results of per node information theoretic capacity done by P. Li and Y.G. Fang [3]. The network topology consists of n normal nodes and m more powerful helping nodes in a rectangular area. Results show that higher magnitude of exponent w gives higher absorption probability which consequently reduces the delay. We found that the derived maximum achievable per node throughput is inversely proportional to the average number of hops traversed by packets, node density, and number of squares in the network. Also, we are able to obtain the result stated in [1] i.e., maximum achievable per-node throughput is according to Θ(W1/√nlogn), where W1 is normal node transmission bandwidth. (6 pages)\",\"PeriodicalId\":383835,\"journal\":{\"name\":\"IET International Conference on Wireless Communications and Applications\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IET International Conference on Wireless Communications and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1049/cp.2012.2085\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IET International Conference on Wireless Communications and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1049/cp.2012.2085","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

Gupta和Kumar的开创性工作[1]启发了许多关于无线网络渐近可实现的每节点吞吐量和延迟分析的后续研究。在本文中,我们评估了异构无线网状网络(HWMN)的延迟和最大可实现的每节点吞吐量。我们推导了一个包含扩散近似方法的解析模型[2],并与P. Li和Y.G. Fang[3]的每节点信息理论容量结果进行了比较。网络拓扑由矩形区域内的n个正常节点和m个更强大的辅助节点组成。结果表明,指数w的大小越大,吸收概率越高,从而减少了延迟。我们发现,每个节点可实现的最大吞吐量与数据包穿越的平均跳数、节点密度和网络中的方块数成反比。同样,我们能够得到[1]中所述的结果,即每个节点可实现的最大吞吐量根据Θ(W1/√nlogn),其中W1为正常节点传输带宽。(6页)
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Delay, throughput and packet absorption rate analysis of heterogeneous WMN
The pioneering work of Gupta and Kumar [1] has inspired many subsequent studies on asymptotically achievable per node throughput and delay analysis for wireless networks. In this paper, we evaluate the delay and maximum achievable per node throughput of a heterogeneous wireless mesh network (HWMN). We derive an analytical model which incorporates diffusion approximation method [2] and then compare with the results of per node information theoretic capacity done by P. Li and Y.G. Fang [3]. The network topology consists of n normal nodes and m more powerful helping nodes in a rectangular area. Results show that higher magnitude of exponent w gives higher absorption probability which consequently reduces the delay. We found that the derived maximum achievable per node throughput is inversely proportional to the average number of hops traversed by packets, node density, and number of squares in the network. Also, we are able to obtain the result stated in [1] i.e., maximum achievable per-node throughput is according to Θ(W1/√nlogn), where W1 is normal node transmission bandwidth. (6 pages)
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信