TY  - JOUR
T1  - Minimum Routing and Congestion Avoidance in Mobile Ad Hoc Networks Using M/M/m Queuing Models
AU - Lakshminarayanan, K. AU - PavaiMadheswari, S. 
JO  - International Journal of Soft Computing
VL  - 10
IS  - 4
SP  - 254
EP  - 260
PY  - 2015
DA  - 2001/08/19
SN  - 1816-9503
DO  - ijscomp.2015.254.260
UR  - https://makhillpublications.co/view-article.php?doi=ijscomp.2015.254.260
KW  - MANET
KW  -congestion
KW  -RREQ
KW  -avoidance
KW  -node
AB  - Mobile ad hoc networks are composed of mobile nodes communicating through wireless medium without any fixed backbone infrastructure. In these networks, broadcast and congestion are major issues. In MANET route discovery, conventional on demand route discovery methods employ flooding method where a mobile node blindly rebroadcasts Received Route Request (RREQ) packets until a route to a particular destination is established, it is costly and results in serious redundancy and collisions in the network. The problems of congestion it occurs in any intermediate node when data packets travel from source to destination and they incur high packet loss and long delay which cause the performance degradations of a network. This study proposes, a avoidance of congestion and minimum path routing in MANET. Initially, minimum routing is d-hop connecting and d-hop dominating sets method of cluster based routing is used in high dense region by using mean of neighbours. After segregation of networks, it initiates a minimum routing route discovery process to find a route to destination. This minimum routing is to reduce RREQ overhead during the route discovery operation. All the primary path nodes periodically calculate nearest neighbourhood node, it calculates the minimum path among all the path, the message is send from the path to the neighbour minimum path when the acknowledgment is received then a route is discovered to the destination. The congestion avoidance is performed by queuing models to avoid congestion in a routing path.
ER  -