Congestion control and fairness with dynamic priority for ad hoc networks Online publication date: Mon, 08-Oct-2018
by Tapas Kumar Mishra; Sachin Tripathi
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 29, No. 3, 2018
Abstract: Recently, the network structure has changed rapidly in modern applications and has imposed priority for heterogeneous applications. In some scenarios, the priorities of the flows need to change in the middle of the communication. However, the major problem is that the packets of different applications are not served at the destination by their expected priority ratio even if the priority does not change. Considering the above problem, this paper presents a fair packet scheduling policy which collects information from each individual flow according to its priority and auto-updates the priorities of flows when required. Moreover, a hybrid congestion control technique based on queue occupancy and channel utilisation is framed to control congestion. The proposed model has been simulated using NS2 for two applications. The simulation result shows the model performs better with respect to fairness among different applications. Moreover, it achieves improved throughput by reducing packet loss.
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 Ad Hoc and Ubiquitous Computing (IJAHUC):
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