Non-Saturated Heterogeneous Mobile Ad-hoc Network Throughput Analysis Considering Max Retry Limit and Max Contention Window Size

Mukta, N. Gupta
{"title":"Non-Saturated Heterogeneous Mobile Ad-hoc Network Throughput Analysis Considering Max Retry Limit and Max Contention Window Size","authors":"Mukta, N. Gupta","doi":"10.1109/ICSCCC.2018.8703290","DOIUrl":null,"url":null,"abstract":"Performance analysis of IEEE 802.11 wireless ad-hoc networks had attracted lots of analytical researches since last decade. A lot of analytical models have been designed considering homogeneous conditions. In the current work, we developed a mathematical model for analyzing the system throughput based on Markov’s chain incorporating the limit on contention window size and packet drop after short retry limit get exhausted. The approach is designed for non-saturated heterogeneous conditions, however could be easily adapted for saturated networks by considering probability of at least one packet waiting for transmission at the start of counter decrement as 1. Simulations are carried out in network simulator and are compared with other existing analytical approaches. The experimental outcomes verify the contribution in terms of more accurate prediction of network behavior.","PeriodicalId":148491,"journal":{"name":"2018 First International Conference on Secure Cyber Computing and Communication (ICSCCC)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 First International Conference on Secure Cyber Computing and Communication (ICSCCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSCCC.2018.8703290","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Performance analysis of IEEE 802.11 wireless ad-hoc networks had attracted lots of analytical researches since last decade. A lot of analytical models have been designed considering homogeneous conditions. In the current work, we developed a mathematical model for analyzing the system throughput based on Markov’s chain incorporating the limit on contention window size and packet drop after short retry limit get exhausted. The approach is designed for non-saturated heterogeneous conditions, however could be easily adapted for saturated networks by considering probability of at least one packet waiting for transmission at the start of counter decrement as 1. Simulations are carried out in network simulator and are compared with other existing analytical approaches. The experimental outcomes verify the contribution in terms of more accurate prediction of network behavior.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
考虑最大重试限制和最大争用窗口大小的非饱和异构移动自组网吞吐量分析
近十年来,IEEE 802.11无线自组织网络的性能分析引起了大量的分析研究。许多分析模型都是在齐次条件下设计的。在当前的工作中,我们建立了一个基于马尔可夫链的数学模型来分析系统吞吐量,该模型考虑了竞争窗口大小的限制和短重试限制耗尽后的丢包。该方法是为非饱和异构条件设计的,但可以很容易地适应于饱和网络,通过考虑在计数器递减开始时至少有一个数据包等待传输的概率为1。在网络模拟器上进行了仿真,并与现有的分析方法进行了比较。实验结果验证了在更准确地预测网络行为方面的贡献。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
To Alleviate The Flooding Attack and Intensify Efficiency in MANET Deep Leaming Approaches for Brain Tumor Segmentation: A Review Q-AODV: A Flood control Ad-Hoc on Demand Distance Vector Routing Protocol Sentimental Analysis On Social Feeds to Predict the Elections A Comparative study of various Video Tampering detection methods
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1