Bandwidth Constrained Priority-Based Routing Algorithm for Mobile Ad Hoc Networks
- 1 Electronics & Communication Engineering Department, Motilal Nehru National Institute of Technology (MNNIT), Allahabad, India
- 2 Electronics & Communication Engineering Department, Motilal Nehru National Institute of Technology (MNNIT), Allahabad, India
- 3 Electronics & Communication Engineering Department, Motilal Nehru National Institute of Technology (MNNIT), Allahabad, India
Abstract
A Mobile Ad hoc NETwork (MANET) is a dynamically formed self-configured network by an autonomous system of mobile nodes connected by wireless links. With the advancements of wireless technology, the necessity of Quality of Service (QoS) is increasing rapidly. Developing QoS constraint routing protocol for MANETs is still a challenging task. As the nodes are free to move randomly, most routing protocols for MANETs are susceptible to node mobility. As routing protocol has to decide which route is able to fulfill the requirement of the desired QoS, routing is the most important part to accomplish the specified application with desired QoS metrics. This paper is based on design of such a kind of proposed MANET algorithm that will estimate the available bandwidth throughout the path by assigning priority. Based on available bandwidth, packets are transferred from source to destination of the applications in queue based on priority. The proposed algorithm is implemented and simulated using NS-2 simulator. Results of our approach show that new protocol can significantly reduce overheads and decrease overall end-to-end delay.
- Perkins, C.E. (2001) Ad Hoc Network. Addsion-Wesley, Switzerland, 29-51.
- Chlamtac, I., Conti, M. and Liu, J.N. (2003) Mobile Ad Hoc Networking: Imperatives and Challenges. Ad Hoc Networks, 1, 13-64. http://dx.doi.org/10.1016/S1570-8705(03)00013-1
- Perkins, C.E. and Bhagwat, P. (1994) Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers. Proceedings of the ACM SIGCOMM, London, 31 August-2 September 1994, 234-244.
- Perkins, C.E. and Royer, E.B. (1999) Ad Hoc on Demand Distance Vector (AODV) Routing. Proceedings of 2nd IEEE Workshop on Mobile Computing System and Application, New Orleans, 25-26 February 1999, 90-100. http://dx.doi.org/10.1109/MCSA.1999.749281
- Johnson, D.B., Maltz, D.A. and Broch, J. (2001) DSR: The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks. Ad Hoc Networking, 5, 132-172.
- Lee, S.J. and Gerla, M. (2000) AODV-BR: Backup Routing in Ad Hoc Networks. 2000 IEEE Wireless Communications and Networking Confernce, 3, 1311-1316.
- Lai, W.K., Hsiao, S.Y. and Lin, Y.C. (2007) Adaptive Backup Routing for Ad-Hoc Networks. Computer Communications, 30, 453-464. http://dx.doi.org/10.1016/j.comcom.2006.09.011
- Yuan, Y.H., Chen, H.M. and Jia, M. (2005) An Optimized Ad-Hoc on Demand Multipath Distance Vector (AOMDV) Routing Protocol. Proceedings of the Asia-Pacific Conference on Communications, Perth, 5 October 2005, 569-573.
- Ahmed, I., Tepe, K.E. and Singh, B.K. (2010) Reliable Coverage Area Based Link Expiration Time (LET) Routing Metric for Mobile Ad Hoc Networks. Ad Hoc Networks, 28, 466-476.
- Wang, Y.H., Chuang, C.C., Hsu, C.P. and Chung, C.M. (2003) Ad Hoc on Demand Routing Protocol Setup with Backup Routes. Proceedings of ITRE International Conference on Information Technology: Research and Education, 11-13 August 2003, 137-141.
- Wang, Z. and Crowcroft, J. (1996) Quality-of-Service Routing for Supporting Multimedia Applications. IEEE Journal on Selected Areas in Communications, 14, 1228-1234. http://dx.doi.org/10.1109/49.536364
- Chen, Y., Farley, T. and Ye, N. (2004) QoS Requirements of Network Applications on the Internet. ACM Journal in Information-Knowledge-Systems Management, 4, 55-76.
- Filali, F. (2006) Wimeter: A Novel Technique for Available Bandwidth Estimation in WLANs and Its Assistance in QoS Provisioning. Eurecom Research Report, 1-16.