{"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.