Multi-Path Routing Protocol to Control Congestion for Load Balancing in Mobile Adhoc Networks
DOI:
https://doi.org/10.26438/ijcse/v7i1.143147Keywords:
Multi-Path Routing, Congestion, Correlation Factor, Load Balance, Disjoint PathAbstract
The multi-path routing protocol is one of the approaches used to have less overhead, better bandwidth cost through the load distribution among a set of paths. However, due to the interference of the paths during the communication, it increases the end to end delay and do not work well under a highly congested network. We have proposed the congestion aware multipath routing protocol with load balancing. The paper explains the problem associated with the end-to-end delay. It deals with the problem of channel interference during the Multi-path communication. It suggests the congestion control mechanisms to improve the protocol performance. It proposes an additive increase/ multiplicative decrease and fast retransmits and recovery process and also it suggest the algorithm for load balancing scheme. In order to minimize the congestion formation, it selects the node disjoint paths for communication. The correlation factor among the selected multiple paths are calculated. It calculates the congestion formation in the network. It compares the proposed MPR protocol with ordinary DSR through the simulation and the simulation results are discussed.
References
[1] Elizabeth M Royer., and Chai-Keong Toh. A Review of Current Routing Protocols for Ad Hoc Mobile Wireless Networks. IEEE Personal Communications, Apr. 2003, 46-55.
[2] Sung-Ju Lee and Mario Gerla, "Split Multipath Routing With Maximally Disjoint Paths in Ad Hoc Networks", Proceedings of IEEE ICC`01, June 2001, vol 10, 3201-3205.
[3] Ye, Z., Krishnamurthy, S.V., Tripathi, S.K.: A Framework for Reliable Routing in Mobile Ad Hoc Networks. IEEE INFOCOM 2003, vol 1, 270-280.
[4] Shekhar H. M. P. and K.S Ramanatha. Mobile Agents based Congestion Aware Routing in Mobile Ad Hoc Networks. In Proceedings of o IEE International Conference on "3G & Beyond", 3G 2005, November 2005), pp. 47-53.
[5] L. Shrivastava, S. S. Bhadoria, and G. S. Tomar, “A load-balancing approach for congestion adaptivity in MANET,” in Proceedings of the International Conference on Computational Intelligence and Communication Networks (CICN `11), pp. 32–36, October 2011.
[6] L. Shrivastava, S. S. Bhadauria, and G. S. Tomar, “Influence of traffic load on the performance of AODV, DSR and DSDV in MANET,” International Journal of Communication Systems and Network Technologies, vol. 1, no. 1, pp. 22–34, 2013.
[7] B. Ramesh and D. Manjula, “Congestion adaptive AODV routing protocol for streaming video in mobile ad hoc networks,” International Journal of Communications, Network and System Sciences, vol. 4, pp. 285–385, 2008.
[8] A. Valarmathi and R. M. Chandrasekaran, “Congestion aware and adaptive dynamic source routing algorithm with load-balancing in MANETs,” International Journal of Computer Applications, vol. 8, no. 5, article 1, 2010.
[9] A. Gaba, S. Voulgaris, and M. van Steen, “Towards congestion-aware all-to-all information dissemination in mobile ad-hoc networks,” in Proceedings of the 2010 IEEE Globecom Workshops (GC `10), pp. 1690–1695, Miami, Fla, USA, December 2010.
[10] S. Soundararajan and R. S. Bhuvaneswaran, “Adaptive multi-path routing for load balancing in mobile Ad Hoc networks,” Journal of Computer Science, vol. 8, no. 5, pp. 648–655, 2012.
[11] S. Jain, S. Kokate, P. Thakur, and S. Takalkar, “A study of congestion aware adaptive routing protocols in MANET,” Computer Engineering and Intelligent Systems, vol. 3, no. 4, p. 64, 2012.
Downloads
Published
How to Cite
Issue
Section
License

This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.
