Abstract
IEEE 802.11 uses RTS/CTS (request to send/clear to send) reservation mechanism in multi-hop ad hoc networks to prevent collision drops caused by the hidden terminals. Extended hidden nodes impose great challenges to RTS/CTS mechanism by creating additional interferences and route failures. We introduce a Markov model to compute the probability of collision due to hidden and extended hidden nodes present in multi-hop ad hoc network under saturated traffic loads. This model is derived from the well-known Bianchi Markov chain model of IEEE 802.11 Distributed coordination function by introducing additional states in every back-off stage. Our model differentiates the collisions that could happen to RTS/CTS and data packets. We also compute the probability of link failure that occurs when the maximum retry limit is exceeded. The model is tested for varying network sizes with number of nodes 10, 50, 100, 150 and 200. The model validates the throughput, collision probability and link failure probability against the Bianchi model and ns-2.35 simulation result.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
