Академический Документы
Профессиональный Документы
Культура Документы
ABSTRACT
The Mobile Ad hoc Networks (MANETs) often deal KEYWORD: Congestion control Mobile Ad hoc
with obstacles that occur in the form of packet loss Networks (MANETs), AODV routing protocol, Mobile
and so that can be efficiently reduced by involving Agents (MA), Total Congestion Metric (TCM),
congestion
estion control which includes routing algorithm Transmission opportunity limit (TXOP).
and a flow control at the network layer. We are
proposing agent based agent based congestion control 1. INTRODUCTION
technique for MANETs in this paper with Modified Mobile ad hoc networks have a wireless hosts whose
AODV protocol. Here the mobile agents (MA) collect main task is to communicate with each other when a
and broadcast
adcast the information about network fixed infrastructure is absent. The Route in between
congestion .The mobile agent based congestion two mobile hosts in MANET ET consists of hops through
control AODV routing protocol is used to avoid other hosts in the network [4]. The most important
congestion in ad hoc network, and the modification task of finding and maintaining routes in MANET is
done to have the same route for the MANET without nontrivial since host mobility causes frequent
changing it. Which can be done by inserting a unpredictable dynamic topological changes in the
protocol which alerts the sender to send some less network. Ad hoc mode is a method meth used for
packets in real time. The work of mobile agents is to connecting the wireless devices to directly
carry routing information and nodes congestion status communicate with each other in dynamic fashion
whenever the MANET is created. Whenever a mobile without any definite network infrastructure required.
agent moves through the network,
work, it selects a less
less- These are self-organizing,
organizing, self-structuring
self networks.
loaded neighbour node as its next hop and All nodes in the network do the work of both a
simultaneously keeps on updating routing table participant and of establishing a short-lived
short network
according to the node’s congestion status. With the because as a router that has the functionality to
help of mobile agents, such is the role of MAs which forward the data. Ad hoc networking is same as peer-
peer
creates the dynamic network topology iin real time. to-peer
peer networking and nodes move dynamically in
Considering the simulation results using NS NS-2, we network. Which means we don’t require of any access
acce
showed that our proposed technique efficient that point to connect to any other node in the network. [3]
traditional one which has numerous amount of packet Mobile nodes without any problem can communicate
loss. Our protocol has high delivery ratio and directly through wireless link only if they are within
throughput with reduced delay which results in each other’s radio range and if they are not, then they
providing efficient protocol when compared with the rely on other neighbouring nodes which can act as
different existing techniques. routers to relay packets [2]. Mobile ad-hoc
ad networks
have the ability of dreaming connecting anywhere and
at any time into reality. The ultimate goal of mobile
ad hoc networking is to expansion of the mobility into
2.2 Properties AODV Routing Protocol: Figure 1: Congestion due to two sources sharing
Every node always assigns backup route(s) in same path
alternative route table.
In the RREP phase Alternative route(s) Therefore the proposed algorithm works on particular
determined. common node, in above case at node 3. The common
At source node no complete route(s) information node all the time will keep a track of bandwidth usage
known. of channel, and as soon as it receives
receiv message from
There are no multiple complete routes available. other source then it will check if there’s space
AODV fills up RREQs with unique IDs so available in the channel, if there is available space so
duplication is avoided. that it can transmit the partial packets or all packets, if
The backup route(s) or other routes which were it has then it will transmit or else it has to hold the
discovered while route discovery are used message up to some specified time known as waiting
whenever primary routes fail. time.
@ IJTSRD | Available Online @ www.ijtsrd.com | Volume – 2 | Issue – 5 | Jul-Aug 2018 Page: 2435
International Journal of Trend in Scientific Research and Development (IJTSRD) ISSN: 2456-6470
2456
Figure 4: congestion due to common path between Figure 5: Discovering a congestion free route for the
two sources in 50 nodes affected source for 50 nodes
5. CONCLUSION 6. REFERENCES
We started our study with analyzing various 1. Bandana Bhatia, Neha Sood,” AODV based
parameters causing congestion in MANET. After the Congestion Control Protocols: Review”,(IJCSIT)
analysis we further made study about how the International Journal of Computer Science and
congestion can be controlled and how the efficiency Information Technologies, Vol. 5 (3) , 2014,
of the network can be improved. We came up with 4570-4575
two possible methods which could cause problems in
2. L. Shrivastava, G. S. Tomar, and S. S. Bhadauria,
a network and finding solution to it. The congestion
“A Survey on Congestion Adaptive Routing
problem due to one common route to reach
Protocols for Mobile Ad-hoc Networks”, Int.
destination and the problem with the flow of the
Journal of Computer Theory and Engineering,
source which cause flooding a node due to which
vol.3, Issue 2, 2011, pp. 189-196.
packets are lost. These two are important issues in a
MANET and can be made congestion free using the 3. L. Xia, Z. Liu, Y. Chang, P. Sun, “An Improved
algorithms. AODV Routing Protocol Based on the Congestion
@ IJTSRD | Available Online @ www.ijtsrd.com | Volume – 2 | Issue – 5 | Jul-Aug 2018 Page: 2437
International Journal of Trend in Scientific Research and Development (IJTSRD) ISSN: 2456-6470
Control and Routing Repair Mechanism”, Int. Networks”, Innovations in Information
Conf. Communications and Mobile Computing, Technology (IIT), 2012 International Conference
IEEE, China, 2009, vol. 2, pp. 259-262. on , pp.305-309, 18-20 March 2012.
4. Li, C. Dan, W. Min and L. Shurong, “Mobile 7. Pingale, A Rakshe, S. A. Jain, and S. R. Kokate,
Agent Based Congestion Control AODV Routing “A Study of congestion aware adaptive routing
Protocol”, Advanced Information Networking and protocols in MANET”, International Journal of
Applications Workshops (WAINA), 2013 27th Advanced Technology and Engineering Research
International Conference on, pp.62-66, 25-28 (IJATER), May 2012, v. 2, Issue 2.
March 2013.
8. S. Floyd and K. Fall, “Promoting the use of end-
5. Barkha Shakya, Deepak Kulhare, Arpit Solanki, to-end congestion control in the internet”
Investigation of TCP Congestion Control with IEEE/ACM Transactions on Networking, 7(4),
Reliable Communication Techniques for August 1999.
MANET. International Journal of Computer
9. Nishu Garg, R. P. Mahapatra “MANET Security
Applications Vol65 No-14.Pp 0975-8887, 2013.
Issues”, IJCSNS International Journal of
6. M. Ali, B. G. Stewart, A. Shahrabi and A. Computer Science and Network Security, VOL.9
Vallavaraj, “ Congestion Adaptive Multipath No.8, August 2009.
Routing for Load Balancing in Mobile Adhoc
@ IJTSRD | Available Online @ www.ijtsrd.com | Volume – 2 | Issue – 5 | Jul-Aug 2018 Page: 2438