Abstract

The paper presents an analytical model to compute the saturated throughput of IEEE 802.11 distributed coordination function (DCF) in a multi-hop ad hoc network. Our work is based on the Bianchi's model where the performance of 802.11 DCF in the absence of hidden stations is analyzed using a discrete time Markov chain. In our model, the wireless stations are randomly located in an area according to a two-dimension Poisson distribution with density lambda, and every station always has a packet to transmit. We compute the saturated throughput with hidden terminal effect under ideal channel conditions. The influences of the packet size, average number of neighbors and initial contention window size on the throughput are presented

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.