QUEUEING MODELS IN MOBILE AD-HOC NETWORKS
- 1 Department of Science and Humanities, Sri Krishna College of Technology, Kovaipudur, Coimbatore-641 042, Tamil Nadu, India
The Mobile Ad-hoc Networks (MANETs) has gain an essential part of the attention of researchers and become very well-liked in last few years. MANETs can operate with no fixed communications and can live rapid changes in the network topology. They can be studied officially as graphs in which the set of boundaries varies in time. One of the main methods to determine the presentation of MANETs is simulation. This study proposes Enhanced Probabilistic Adhoc on Demand Distance Vector (EPAODV) routing protocol, which solves the broadcast storm problem of Adhoc on Demand Distance Vector (AODV). Our evaluation of MANETs is based on the evaluation of the throughput, end to end delay and packet delivery ratio. We evaluated the end to end delay as it is one of the most important characteristic evaluation metric in computer networks. In our proposed algorithm, using a queueing model M/M/C: ∞/FIFO, we are able to enhance that better results are obtained in the case EPAODV protocol such as increasing throughput, data delivery ratio and then decreasing the end delay compare to the existing protocols.
Copyright: © 2014 S. Baskar and S. Palaniammal. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
- 1,814 Views
- 1,971 Downloads
- 0 Citations
- Mobile Adhoc Networks (MANETs)
- Enhanced Probabilistic Adhoc On Demand Distance Vector (EPAODV)
- Adhoc On-Demand Distance Vector (AODV) Routing Protocol
- Probabilistic Adhoc On Demand Distance Vector (PAODV)
- Queueing Model