Distributed admission control algorithm for random access wireless networks in the presence of hidden terminals Online publication date: Tue, 30-Jul-2019
by Ioannis K. Marmorkos; Costas C. Constantinou
International Journal of High Performance Computing and Networking (IJHPCN), Vol. 14, No. 2, 2019
Abstract: We address the problem of admission control for wireless clients in WLANs taking into account collisions between competing access points and considering explicitly the effect of hidden terminals, which play a prominent role in optimised client association. We propose an efficient, distributed admission control algorithm, where the wireless client node decides locally on which access point it will associate with in order to maximise its link throughput. The client can choose to optimise either its uplink or downlink throughput, depending on the type of traffic it predominantly intends to exchange with the network. The proposed approach takes into account the full contention resolution of the RTS/CTS IEEE802.11 medium access control protocol and leads towards an increase of the total throughput for the whole network. Finally, an algorithm is proposed, which can serve also as the basis for the development of efficient traffic offloading protocols in heterogeneous 5G networks.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of High Performance Computing and Networking (IJHPCN):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook