Abstract

In multihop wireless networks, packets of a flow originating from a source node are relayed by intermediate nodes (relay nodes) and travel towards their destination along a multihop wireless path. Since the traffic forwarding capability of each node varies according to its level of contention, ideally, a node should not transmit more packets to its relay node than the corresponding relay node can forward. Instead, each node should yield its channel access opportunity to its neighbor nodes so that all the nodes can evenly share the channel and have similar forwarding capabilities. In this manner, nodes can utilize the wireless channel effectively, and further increase the end-to-end throughput of a multihop path. We propose a fully distributed contention window adaptation (CWA) mechanism, which adjusts the channel access probability depending on the difference between the incoming and outgoing traffic at each node, in order to equate the traffic forwarding capabilities among all the nodes in the path. We implement the proposed adaptive contention algorithm on Madwifi Linux kernel driver for Wi-Fi interface with Atheros chipset and carry out an empirical study in our division building. The experiment results demonstrate how the proposed mechanism can improve end-to-end throughput performance in the multihop wireless networks.

Full Text
Paper version not known

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.