On demand secure routing protocol using Convex-Hull & K-mean approach in MANET

Mobile ad-hoc network is networks that are collection of mobile device that can communicate and share information between each other, without any predefine infrastructure or centralized system. Another challenge in MANET is energy constraints because each of the mobile nodes is operated by limited energy battery. This paper presents a new on-demand power saving routing algorithm for mobile ad-hoc networks. The protocol is based on node identification using k-means & Convex Hull that gives less hopping, energy saving on demand routing protocol. K-means identify cluster from sender node then convex-hull find the outer region area of the cluster using some mathematical expression find out the best node to forward the data here also used one priority based protocol for energy saving node identification.