IJRIT International Journal of Research in Information Technology, Volume 1, Issue 1, January 2013, Pg. 87-96

International Journal of Research in Information Technology (IJRIT) www.ijrit.com

ISSN 2001-5569

Entropy Based QoS Routing Algorithm in MANET Using Hierarchical Clustering Himanshu Gupta1, Pratibha Chauhan2, Suryambika Singh3, Pankaj Kumar Sharma4 1

Department of Information Technology, ABES Engineering College, Ghaziabad, Uttar Pradesh, India Department of Information Technology, ABES Engineering College, Ghaziabad, Uttar Pradesh, India 3 Department of Information Technology, ABES Engineering College, Ghaziabad, Uttar Pradesh, India 4 Sr. Associate Professor, Department of Information Technology, ABES Engineering College, Ghaziabad, Uttar Pradesh, India 1 [email protected], 2 [email protected], 3 [email protected], 4 [email protected] 2

Abstract A Mobile Ad Hoc Network (MANET) is a dynamic wireless network that can be formed without the need of any pre-existing infrastructure in which each node can act as a router. Because mobile nodes have limited battery power, it is therefore very important to use energy in MANET efficiently. Due to bandwidth constraint and dynamic topology of mobile ad hoc networks, multipath supported routing is very important research issue. This paper proposes an ad hoc on demand distance vector routing algorithm on the basis of entropy. Two entropy metrics are used for this purpose, relative motion entropy and energy entropy. Hierarchical clustering algorithm is used to optimize the set of possible routes for communication. The proposed algorithm assigns the construction of multiple paths to the destination node, resulting in the improved performance of packet delivery, average end-to-end delay and control packets ratio incurred at intermediate nodes. Keywords: AODV, Energy Entropy, Hierarchical Clustering, Euclidean Distance, Multipath routing.

Full text: https://sites.google.com/site/ijrit1/home/V1I425.pdf

Pratibha Chauhan, IJRIT