Open Access Open Access  Restricted Access Subscription or Fee Access

An Optimized Congestion Control Mechanism by using Anti-Congestion Topology Routing (ACTR) Protocol in MANET

Shakkeera Shakkeera, Asha kanna, Jeinul Shifara, Juvairiya Begum, Mahzabeen Fatima


A Mobile Ad-Hoc Network is a self-configuring infra structure less network of mobile devices connected by wireless links. As the links are unstable, the link bandwidth keeps on changing in MANET environment. Each device in a MANET is free to move independently in any direction and therefore changes its links frequently. The primary challenge in building a MANET is equipping each device to continuously maintain the information required to properly route the traffic. In any network, when there is too much data traffic at a node due to which the network slows down or starts loosing the data, it is known as network congestion. It degrades quality of service and also can lead to network delays. The congestion problem in a network with shared resources, where multiple senders compete for link bandwidth, it is necessary to adjust the data rate used by each sender in order not to overload the network. Packets that arrive at a router and cannot be forwarded are dropped, consequently an excessive amount of packets arriving at a network bottleneck leads to many packet drops. In this paper, we aim at providing a solution to the problem of network congestion by designing a protocol that performs routing intelligently and minimizes the congestion while routing. For this we have proposed a protocol named as Anti-Congestion Topology Routing (ACTR) Protocol.
ACTR employs Circular topology restriction mechanism along with Constrained Shortest Path First (CSPF) algorithm. CSPF is an extension of normal Shortest Path First algorithm extended along with the constraints (conditions) to be satisfied like minimum bandwidth required per link, end-to-end delay, maximum number of links traversed can be considered as constraints in CSPF. For further enhancement of our proposed protocol, multiple constraints are considered in Constrained Shortest Path First (CSPF) Algorithm. The multiple constraints considered are minimum bandwidth and minimum hop count. The constraints are checked in prioritized manner. The ACTR protocol uses OSPF (Open Shortest Path First) & CSPF (Constrained Shortest Path First) protocols as the base protocol and adds-on the constrained circular routing technique to it. This proposed protocol will be compared with this two link state routing protocols and proved to be better in terms of End-to-End Delay.


MANET, OSPF, CSPF, Congestion

Full Text:



Bailan, “Routing Protocol Design Based on Mobile Ad Hoc Network”Third International Conference on Multimedia Information Networking and Security, 2011.

Xi Fang, Dejun Yang, and Guoliang Xue, “An Distributed Algorithm for Multi-constrained Any path Routing in Wireless Mesh Networks”In Proc .of IEEE ICC ,2011.

Satish Jamadagni, Praveen C H, "OSPF extensions for flexible CSPF algorithm support", Draft-satish-ospf-cspf-support- October 2011.

Phu Hung Le,Guy Pujolle,Thi-Mai-Trang Nguyen ”An Interference-aware multi-path routing protocol For Mobile Ad hocNetwork,2011

S.Santhi,G.Sudha Sadasivam,” Performance Evaluation of Different Routing Protocols to Minimize Congestion in Heterogeneous Network”,2011

Tomoyuki Ohta, Takeshi Hashimoto, and Yoshiaki Kakuda, “Self-Organizing Real-Time Service Dissemination and Collection Using Mobile Agents for Mobile Ad Hoc Networks” 14th IEEE International Symposium on Object / Component/Service Oriented Real-Time Distributed Computing Workshops, 2011.

Xihua Dong, Dapeng Wu, Yu Liu, Chi Zhou “Statistical QoS Provisioning in Mobile Ad hoc Networks” Sixth International Conference on Mobile Ad-hoc and Sensor Networks, 2010.

Abdelmajid HAJAMI, Kamal Oudidi, Mohammed ELKOUTBI, ”An enhanced algorithm for MANET clustering based on multi hops and network density”,2010

Ning Shi, “k Constrained Shortest Path Problem”, IEEE Transactions on Automation Science and Engineering, VOL. 7, NO. 1, January 2010.

Teerapat Sanguankotchakorn, Newton Perera, “Hybrid Multi-constrained Optimal Path QoS Routing with Inaccurate Link State” Ninth International Conference on Networks, 2010.

Abhik Banerjee, Juki Wirawan Tantra, Chuan Heng Foh, Chai Kiat Yeo, and Bu Sung Lee, “Controlling Route Discovery for Efficient Routing in Resource-constrained Sensor Networks” In Proceedings of IEEE CCNC, 2010.

Xi Fang, Dejun Yang, Pritam Gundecha and Guoliang Xue, “Multi- constrained Anypath Routing in Wireless Mesh Networks”In Proceedings of IEEE Secon 2010.

Phong C, Khuu, Michael J.Weber, Brian Loop, Gregory Sadosuk, Kyle Guan, Jessica Hsu, Reza Ghanadan, ”Efficient Dissemination Techniques for MANET Routing Control Messages”,2009.

Thaere EIDO, Abdessalem MRIBAH, Tülin ATMACA, ”Novel Constrained-Path Computation Algorithm for Failure Recovery and CAC in GMPLS optical Networks”,2008.

Christian Lochert, Bjorn Scheuermann, Martin Mauve,”A Survey on congestion control for Mobile Ad-hoc Networks”,2007.

M. Abolhasan, T. Wysocki and E. Dutkiewicz, “A review of routing protocols for mobile ad hoc networks”, Ad Hoc Networks, 2004, 2, pp. 1- 25.

Satish Jamadagni, Praveen C H, "OSPF extensions for flexible CSPF algorithm support", Draft-satish- ospf- cspf-support- October 2002.

P. Jacquet, P. Muhlethaler, A. Qayyum" A Laouiti,L.Viennot, T Clausen, MANET draft "draft-ietf- manet-olsr 02.txt",2000.

S. Corson, 1. Macker, RFC2501 - Mobile Ad hoc Networking (MANET): Routing Protocol, January 1999.

W.V.Wollman and Y. Barsoum. "Overview of Open Shortest Path First, version 2 (ospf v2) routing in the tactical environment", Proc. of IEEE MILCOM., vol..3, pp. 925-930, October 1995.


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.