Congestion control scheme using network coding with local route assistance in mobile adhoc network
by Navneet Kaur; Rakesh Singhai
International Journal of Computer Applications in Technology (IJCAT), Vol. 60, No. 3, 2019

Abstract: Mobile adhoc network is a wireless infrastructureless and self-organised disseminated network. Congestion is a critical issue which occurs in a network when traffic offered to the network exceeds the resource accessibility. This research addresses a novel approach for congestion control for the performance improvement of basic routing protocol AODV. The congestion is discovered based on parameters node queue length, channel utilisation and residual energy. To reinforce the congestion control, a network coding mechanism is employed in event of high congestion to reduce the quantity of transmissions among nodes. Local route assistance by neighbouring non-congested node is performed in case of medium congestion to avoid condition of high congestion and to reduce recovery time. The proposed technique shows enhanced performance in performance parameters routing overhead, packet delivery ratio, number of congested nodes, end to end delay, residual energy and normalised routing load. This algorithm is highly adaptive and scalable and mainly reduces packet loss due to congestion and energy consumption of nodes in high mobility cases.

Online publication date: Tue, 25-Jun-2019

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Computer Applications in Technology (IJCAT):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your 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